Online Job Scheduler for Fault-tolerant Quantum Multiprogramming

• URL: http://arxiv.org/abs/2505.06741v1
• Date: Sat, 10 May 2025 19:24:37 GMT
• Title: Online Job Scheduler for Fault-tolerant Quantum Multiprogramming
• Abstract summary: We formulate the online job scheduling problem for fault-tolerant quantum computing systems based on lattice surgery.<n>Our scheduler approximates lattice surgery programs, originally represented as polycubes, using simpler cuboid representations.<n>In addition, we incorporate a mechanism into the scheduling process, demonstrating that it can further enhance QPU utilization.
• Score: 0.33554367023486936
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum computers are expected to be offered as cloud services due to their significant resource and infrastructure requirements. Quantum multiprogramming, which runs multiple quantum jobs in parallel, is a promising approach to maximize the utilization of such systems. A key challenge in this setting is the need for an online scheduler capable of handling jobs submitted dynamically while other programs are already running. In this study, we formulate the online job scheduling problem for fault-tolerant quantum computing systems based on lattice surgery and propose an efficient scheduler to address it. To meet the responsiveness required in an online environment, our scheduler approximates lattice surgery programs, originally represented as polycubes, by using simpler cuboid representations. This approximation enables efficient scheduling while improving overall throughput. In addition, we incorporate a defragmentation mechanism into the scheduling process, demonstrating that it can further enhance QPU utilization.

Related papers

• Centralizing Task-based Approach to Quantum Network Control [71.48385446560893]
  layered architectures impose stringent design and timing constraints on quantum networks.<n>We simulate a resource-centric, task-based approach to quantum network control by utilizing a centralized controller.
  arXiv  Detail & Related papers  (2026-05-05T03:57:17Z)
• Advanced Scheduling Strategies for Distributed Quantum Computing Jobs [1.4757786825685777]
  Scaling the number of qubits available across multiple quantum devices is an active area of research within distributed quantum computing (DQC)<n>The latter aspect is very challenging because, while reducing the makespan of job batches remains a relevant objective, novel quantum-specific constraints must be considered, including QPU utilization, non-local gate density, and the latency associated with queued DQC jobs.
  arXiv  Detail & Related papers  (2026-02-27T16:35:32Z)
• Q-IRIS: The Evolution of the IRIS Task-Based Runtime to Enable Classical-Quantum Workflows [1.0894174366773024]
  We present a proof-of-concept hybrid execution framework integrating the IRIS task-based runtime with the XACC quantum programming framework.<n>IRIS orchestrates multiple programs written in the quantum intermediate representation (QIR) across heterogeneous backends.<n>We demonstrate how task granularity can improve simulator throughput and reduce queueing behavior.
  arXiv  Detail & Related papers  (2025-12-15T22:11:00Z)
• The Fast for the Curious: How to accelerate fault-tolerant quantum applications [101.46859364118622]
  We evaluate strategies for reducing the run time of fault-tolerant quantum computations.<n>We discuss how the co-design of hardware, fault tolerance, and algorithmic subroutines can reduce run times.
  arXiv  Detail & Related papers  (2025-10-30T02:27:55Z)
• Adaptive Job Scheduling in Quantum Clouds Using Reinforcement Learning [1.0542466736167886]
  Current quantum systems face critical bottlenecks, including limited qubit counts, brief coherence intervals, and high susceptibility to errors.<n>We introduce a simulation-based tool that supports distributed scheduling and concurrent execution of quantum jobs on networked QPUs connected via real-time classical channels.
  arXiv  Detail & Related papers  (2025-06-12T16:54:19Z)
• Ecosystem-Agnostic Standardization of Quantum Runtime Architecture: Accelerating Utility in Quantum Computing [0.0]
  This research covers all layers of Quantum Computing Optimization Middleware (QCOM) It requires execution on real quantum hardware (QH) There is a need for a widely adopted runtime platform (RP) driven by the open-source community.
  arXiv  Detail & Related papers  (2024-09-26T16:43:07Z)
• Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks [5.239117416189216]
  Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors.<n>This paper addresses resource management and circuit scheduling in such settings.<n>We propose circuit scheduling algorithms based on Mixed-Integer Linear Programming (MILP)
  arXiv  Detail & Related papers  (2024-09-19T11:39:46Z)
• 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)
• SCIM MILQ: An HPC Quantum Scheduler [2.4646794072984477]
  SCIM MILQ is a scheduler for quantum tasks in HPC infrastructure. It combines well-established scheduling techniques with methods to unique quantum computing, such as circuit cutting. It reduces the noise in the circuit by up to 10%, increasing the outcome's reliability.
  arXiv  Detail & Related papers  (2024-04-04T15:17:38Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• ESDI: Entanglement Scheduling and Distribution in the Quantum Internet [4.558581187459857]
  Quantum entanglement distribution between remote nodes is key to many promising quantum applications. This paper considers entanglement scheduling and distribution among many source-destination pairs with different requests over an entire quantum network topology. Inspired by optimal scheduling disciplines in conventional single-queue scenarios, we design a general optimization framework for entanglement scheduling and distribution called ESDI.
  arXiv  Detail & Related papers  (2023-03-30T17:09:59Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Better than the Best: Gradient-based Improper Reinforcement Learning for Network Scheduling [60.48359567964899]
  We consider the problem of scheduling in constrained queueing networks with a view to minimizing packet delay. We use a policy gradient based reinforcement learning algorithm that produces a scheduler that performs better than the available atomic policies.
  arXiv  Detail & Related papers  (2021-05-01T10:18:34Z)
• Using the Parameterized Quantum Circuit combined with Variational-Quantum-Eigensolver (VQE) to create an Intelligent social workers' schedule problem solver [0.0]
  We propose an adaptive and intelligence solution, which efficiently recalculates the schedules of social workers. The quantum feasibility of the algorithm will be modelled with docplex and tested on IBMQ computers.
  arXiv  Detail & Related papers  (2020-10-12T17:14:37Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.