QRCC: Evaluating Large Quantum Circuits on Small Quantum Computers through Integrated Qubit Reuse and Circuit Cutting
arXiv:2312.10298 · doi:10.1145/3622781.3674179
Abstract
Quantum computing has recently emerged as a promising computing paradigm for many application domains. However, the size of quantum circuits that can be run with high fidelity is constrained by the limited quantity and quality of physical qubits. Recently proposed schemes, such as wire cutting and qubit reuse, mitigate the problem but produce sub-optimal results as they address the problem individually. In addition, gate cutting, an alternative circuit-cutting strategy that is suitable for circuits computing expectation values, has not been fully explored in the field. In this paper, we propose QRCC, an integrated approach that exploits qubit reuse and circuit-cutting (including wire cutting and gate cutting) to run large circuits on small quantum computers. Circuit-cutting techniques introduce non-negligible post-processing overhead, which increases exponentially with the number of cuts. QRCC exploits qubit reuse to find better cutting solutions to minimize the cut numbers and thus the post-processing overhead. Our evaluation results show that on average we reduce the number of cuts by 29% and additional reduction when considering gate cuts.
References in corpus (21)
- Emergence of scaling in random networks
- Quantum Machine Learning
- Characterizing Quantum Supremacy in Near-Term Devices
- The Variational Quantum Eigensolver: a review of methods and best practices
- Towards Quantum Chemistry on a Quantum Computer
- Quantum computing for finance: overview and prospects
- Quantum optimization using variational algorithms on near-term quantum devices
- Quantum algorithms for supervised and unsupervised machine learning
- A new quantum ripple-carry addition circuit
- Full-State Quantum Circuit Simulation by Using Data Compression
- Constructing a virtual two-qubit gate by sampling single-qubit operations
- SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
- Suppressing ZZ Crosstalk of Quantum Computers through Pulse and Scheduling Co-Optimization
- HAMMER: boosting fidelity of noisy Quantum circuits by exploiting Hamming behavior of erroneous outcomes
- QDB: From Quantum Algorithms Towards Correct Quantum Programs
- 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms
- ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors
- Navigating the dynamic noise landscape of variational quantum algorithms with QISMET
- Clifford-based Circuit Cutting for Quantum Simulation
- AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs
- FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodes