Quantum circuit scheduler for QPUs usage optimization

• URL: http://arxiv.org/abs/2404.01055v2
• Date: Thu, 12 Sep 2024 08:42:04 GMT
• Title: Quantum circuit scheduler for QPUs usage optimization
• Authors: Javier Romero-Alvarez, Jaime Alvarado-Valiente, Jorge Casco-Seco, Enrique Moguel, Jose Garcia-Alonso, Javier Berrocal, Juan M. Murillo,
• Abstract summary: We propose a technique to reduce waiting times and optimize quantum computers usage by scheduling circuits from different users into combined circuits that are executed at the same time. Results show that the noise suffered by executing a combination of circuits through the proposed scheduler does not critically affect the outcomes.
• Score: 0.31635222504032556
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Progress in the realm of quantum technologies is paving the way for a multitude of potential applications across different sectors. However, the reduced number of available quantum computers, their technical limitations and the high demand for their use are posing some problems for developers and researchers. Mainly, users trying to execute quantum circuits on these devices are usually facing long waiting times in the tasks queues. In this context, this work propose a technique to reduce waiting times and optimize quantum computers usage by scheduling circuits from different users into combined circuits that are executed at the same time. To validate this proposal, different widely known quantum algorithms have been selected and executed in combined circuits. The obtained results are then compared with the results of executing the same algorithms in an isolated way. This allowed us to measure the impact of the use of the scheduler. Among the obtained results, it has been possible to verify that the noise suffered by executing a combination of circuits through the proposed scheduler does not critically affect the outcomes.

Related papers

• On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Program Scheduling [48.142860424323395]
  We introduce the Quantum Program Scheduling Problem (QPSP) to improve the utility efficiency of quantum resources. Specifically, a quantum program scheduling method concerning the circuit width, number of measurement shots, and submission time of quantum programs is proposed to reduce the execution latency.
  arXiv  Detail & Related papers  (2024-04-11T16:12:01Z)
• 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)
• Pulse-efficient quantum machine learning [0.0]
  We investigate the impact of pulse-efficient circuits on quantum machine learning algorithms. We find that pulse-efficient transpilation vastly reduces average circuit durations. We conclude by applying pulse-efficient transpilation to the Hamiltonian Variational Ansatz and show that it delays the onset of noise-induced barren plateaus.
  arXiv  Detail & Related papers  (2022-11-02T18:00:01Z)
• 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)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Advancing Hybrid Quantum-Classical Computation with Real-Time Execution [10.818632836746668]
  We describe a next-generation implementation of classical computation embedded within quantum programs. It enables the real-time calculation and adjustment of program variables based on the mid-circuit state of measured qubits.
  arXiv  Detail & Related papers  (2022-06-26T19:50:15Z)
• Application-Oriented Performance Benchmarks for Quantum Computing [0.0]
  benchmarking suite is designed to be readily accessible to a broad audience of users. Our methodology is constructed to anticipate advances in quantum computing hardware that are likely to emerge in the next five years.
  arXiv  Detail & Related papers  (2021-10-07T01:45:06Z)
• Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns [0.0]
  Current quantum processors are noisy, have limited coherence and imperfect gate implementations. We present novel deterministic algorithms for compiling recurrent quantum circuit patterns in time. Our solution produces unmatched results on RyRz circuits.
  arXiv  Detail & Related papers  (2021-02-17T13:59:12Z)
• Enabling Multi-programming Mechanism for Quantum Computing in the NISQ Era [0.0]
  NISQ devices have several physical limitations and unavoidable noisy quantum operations. Only small circuits can be executed on a quantum machine to get reliable results. We propose a Quantum Multi-programming Compiler (QuMC) to execute multiple quantum circuits on quantum hardware simultaneously.
  arXiv  Detail & Related papers  (2021-02-10T08:46:16Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.