HALO: A Fine-Grained Resource Sharing Quantum Operating System

• URL: http://arxiv.org/abs/2602.07191v1
• Date: Fri, 06 Feb 2026 20:54:00 GMT
• Title: HALO: A Fine-Grained Resource Sharing Quantum Operating System
• Abstract summary: We present HALO, the first quantum operating system design that supports fine-grained resource-sharing.<n>First, a hardware-aware qubit-sharing algorithm that places shared helper qubits on regions of the quantum computer.<n>Second, a shot-adaptive scheduler that allocates execution windows according to each job's sampling requirements.
• Score: 5.958557121586318
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As quantum computing enters the cloud era, thousands of users must share access to a small number of quantum processors. Users need to wait minutes to days to start their jobs, which only takes a few seconds for execution. Current quantum cloud platforms employ a fair-share scheduler, as there is no way to multiplex a quantum computer among multiple programs at the same time, leaving many qubits idle and significantly under-utilizing the hardware. This imbalance between high user demand and scarce quantum resources has become a key barrier to scalable and cost-effective quantum computing. We present HALO, the first quantum operating system design that supports fine-grained resource-sharing. HALO introduces two complementary mechanisms. First, a hardware-aware qubit-sharing algorithm that places shared helper qubits on regions of the quantum computer that minimize routing overhead and avoid cross-talk noise between different users' processes. Second, a shot-adaptive scheduler that allocates execution windows according to each job's sampling requirements, improving throughput and reducing latency. Together, these mechanisms transform the way quantum hardware is scheduled and achieve more fine-grained parallelism. We evaluate HALO on the IBM Torino quantum computer on helper qubit intense benchmarks. Compared to state-of-the-art systems such as HyperQ, HALO improves overall hardware utilization by up to 2.44x, increasing throughput by 4.44x, and maintains fidelity loss within 33%, demonstrating the practicality of resource-sharing in quantum computing.

Related papers

• Strategic Plan for Neutral Atom Quantum Computation [84.56908019536233]
  We present a strategic plan for neutral atom quantum computation, bringing together hardware development and theory advancements.<n>The concept of practical quantum advantage is defined, along with how to verify claims of advantage, and approaches to designing quantum algorithms that deliver practical advantage.
  arXiv  Detail & Related papers  (2026-07-23T17:36:19Z)
• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Quantum Digital Twins for Uncertainty Quantification [1.1510009152620668]
  We develop and construct "quantum digital twins," virtual versions of quantum processing units. To demonstrate the potential benefit of quantum digital twins, we create and deploy hybrid quantum ensembles on five quantum digital twins.
  arXiv  Detail & Related papers  (2024-10-29T09:41:42Z)
• QOS: A Quantum Operating System [0.5571222258950509]
  We introduce QOS, a cloud operating system for managing quantum resources.<n>QOS exposes a hardware-agnostic API for transparent quantum job execution.<n>We show that the QOS achieves 2.6--456.5$times$ higher fidelity, increases resource utilization by up to 9.6$times$, and reduces waiting times by up to 5$times$ while sacrificing only 1--3% fidelity, on average, compared to the baselines.
  arXiv  Detail & Related papers  (2024-06-27T12:05:27Z)
• On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Job Scheduling [47.39648643132327]
  We introduce the Quantum Job Scheduling Problem (QJSP) to improve the utility efficiency of quantum resources.<n>We propose a noise-aware quantum job scheduler (NAQJS) concerning the circuit width, number of measurement shots, and submission time of quantum jobs.<n>We conduct extensive experiments on a simulated Qiskit noise model, as well as on the Xiaohong (from QuantumCTek) superconducting quantum processor.
  arXiv  Detail & Related papers  (2024-04-11T16:12:01Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Parallelizing Quantum-Classical Workloads: Profiling the Impact of Splitting Techniques [4.741651490006498]
  We evaluate two workload splitting techniques on IBM's Quantum Cloud. We see that (1) VQE with circuit cutting is 39% better in ground state estimation than the uncut version, and (2) QSVM that combines data parallelization with reduced feature set yields upto 3x improvement in quantum workload execution time.
  arXiv  Detail & Related papers  (2023-05-11T05:46:55Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.