Quantum Computing Is an Orchestration Problem: I Built a Multi-Provider Scheduler and Measured What the Textbooks Only Describe

说明与用途

量子云服务存在不可预测的队列和不可靠的指标。Quantum Orchestrator 自动选择最佳后端，测量等待时间、执行时间和保真度，证明队列占主导地位，后端选择影响精度。

问题

Quantum computing services expose long, unpredictable queues and unreliable backend availability, making scheduling and fidelity selection difficult for users.

结果

Measured queue-to-execution ratio of 1822:1 on IBM hardware; autonomous backend selection improved fidelity from ~94% to ~97%; a two-basis VQE achieved chemical accuracy, separating shot noise from bias.

工作流

• 1. Submit a quantum circuit to Quantum Orchestrator.
• 2. Orchestrator queries each backend adapter for availability and estimated queue.
• 3. It selects the backend with the shortest expected wait and highest expected fidelity.
• 4. The job is submitted; the orchestrator waits, respecting a dynamic fallback threshold and absolute timeout.
• 5. Upon completion, the orchestrator records queue time, execution time, and fidelity.
• 6. Results are reported to the user, including any fallback to simulators if real hardware is unavailable.

证据

On the same IBM quantum processor, on the same afternoon, the same two-qubit circuit took 2 seconds to run and 61 minutes to reach the front of the queue — a queue-to-execution ratio of 1822:1.

来源

Autonomous backend selection moves not only wait time but fidelity (~94% vs 97% on the same circuit, different processors).

来源