QuSplit: Achieving Both High Fidelity and Throughput via Job Splitting on Noisy Quantum Computers
- URL: http://arxiv.org/abs/2501.12492v1
- Date: Tue, 21 Jan 2025 20:43:32 GMT
- Title: QuSplit: Achieving Both High Fidelity and Throughput via Job Splitting on Noisy Quantum Computers
- Authors: Jinyang Li, Yuhong Song, Yipei Liu, Jianli Pan, Lei Yang, Travis Humble, Weiwen Jiang,
- Abstract summary: We propose a novel and efficient Genetic Algorithm-based scheduling framework with the consideration of job splitting.
Experimental results demonstrate that our approach maintains high fidelity across all jobs and significantly improves system throughput.
- Score: 6.46676684248918
- License:
- Abstract: As we enter the quantum utility era, the computing paradigm shifts toward quantum-centric computing, where multiple quantum processors collaborate with classical computers, exemplified by platforms like IBM Quantum and Amazon Braket. In this paradigm, efficient resource management is crucial; however, unlike classical computing, quantum processors face significant challenges due to noise, which raises fidelity concerns in quantum applications. Compounding this issue, the noise characteristics across different quantum processors are inherently heterogeneous, making resource optimization even more complex. Existing resource management strategies primarily focus on mapping and scheduling jobs to these heterogeneous backends, which leads to some jobs suffering extremely low fidelity. Targeting quantum optimization jobs (e.g., VQC, VQE, QAOA) - one of the most promising quantum applications in the NISQ era, we hypothesize that running the later stages of a job on a high-fidelity quantum processor can significantly enhance overall fidelity. To validate this hypothesis, we use the VQE as a case study and propose a novel and efficient Genetic Algorithm-based scheduling framework with the consideration of job splitting. Experimental results demonstrate that our approach maintains high fidelity across all jobs and significantly improves system throughput. Furthermore, the proposed algorithm shows excellent scalability with respect to the number of quantum processors and the volume of jobs, making it a robust solution for emerging quantum computing platforms.
Related papers
- Variational Quantum Algorithms for Combinatorial Optimization [0.571097144710995]
Variational Algorithms (VQA) have emerged as one of the strongest candidates towards reaching practical applicability of NISQ systems.
This paper explores the current state and recent developments of VQAs, emphasizing their applicability to Approximate optimization.
We implement QAOA circuits with varying depths to solve the MaxCut problem on graphs with 10 and 20 nodes.
arXiv Detail & Related papers (2024-07-08T22:02:39Z) - Quantum Multi-Agent Reinforcement Learning for Aerial Ad-hoc Networks [0.19791587637442667]
This paper presents an aerial communication use case and introduces a hybrid quantum-classical (HQC) ML algorithm to solve it.
Results show a slight increase in performance for the quantum-enhanced solution with respect to a comparable classical algorithm.
These promising results show the potential of QMARL to industrially-relevant complex use cases.
arXiv Detail & Related papers (2024-04-26T15:57:06Z) - Unlocking Quantum Optimization: A Use Case Study on NISQ Systems [0.0]
This paper considers two industrial relevant use cases: one in the realm of optimizing charging schedules for electric vehicles, the other concerned with the optimization of truck routes.
Our central contribution are systematic series of examples derived from these uses cases that we execute on different processors of the gate-based quantum computers of IBM as well as on the quantum annealer of D-Wave.
arXiv Detail & Related papers (2024-04-10T17:08:07Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Generative AI-enabled Quantum Computing Networks and Intelligent
Resource Allocation [80.78352800340032]
Quantum computing networks execute large-scale generative AI computation tasks and advanced quantum algorithms.
efficient resource allocation in quantum computing networks is a critical challenge due to qubit variability and network complexity.
We introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation.
arXiv Detail & Related papers (2024-01-13T17:16:38Z) - 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) - Preparing random state for quantum financing with quantum walks [1.2074552857379273]
We propose an efficient approach to load classical data into quantum states that can be executed by quantum computers or quantum simulators on classical hardware.
A practical example of implementing SSQW using Qiskit has been released as open-source software.
Showing its potential as a promising method for generating desired probability amplitude distributions highlights the potential application of SSQW in option pricing through quantum simulation.
arXiv Detail & Related papers (2023-02-24T08:01:35Z) - 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) - Quantum circuit architecture search on a superconducting processor [56.04169357427682]
Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry.
However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability.
We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
arXiv Detail & Related papers (2022-01-04T01:53:42Z) - 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)
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.