CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
arXiv:2012.02333 · doi:10.1145/3445814.3446758
Abstract
Quantum computing (QC) is a new paradigm offering the potential of exponential speedups over classical computing for certain computational problems. Each additional qubit doubles the size of the computational state space available to a QC algorithm. This exponential scaling underlies QC's power, but today's Noisy Intermediate-Scale Quantum (NISQ) devices face significant engineering challenges in scalability. The set of quantum circuits that can be reliably run on NISQ devices is limited by their noisy operations and low qubit counts. This paper introduces CutQC, a scalable hybrid computing approach that combines classical computers and quantum computers to enable evaluation of quantum circuits that cannot be run on classical or quantum computers alone. CutQC cuts large quantum circuits into smaller subcircuits, allowing them to be executed on smaller quantum devices. Classical postprocessing can then reconstruct the output of the original circuit. This approach offers significant runtime speedup compared with the only viable current alternative--purely classical simulations--and demonstrates evaluation of quantum circuits that are larger than the limit of QC or classical simulation. Furthermore, in real-system runs, CutQC achieves much higher quantum circuit evaluation fidelity using small prototype quantum computers than the state-of-the-art large NISQ devices achieve. Overall, this hybrid approach allows users to leverage classical and quantum computing resources to evaluate quantum programs far beyond the reach of either one alone.
14 pages, 12 figures, In Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '21), April 19-23, 2021, Virtual, USA. ACM, New York, NY, USA
References in corpus (23)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- Characterizing Quantum Supremacy in Near-Term Devices
- Quantum algorithms: an overview
- Extending the computational reach of a noisy superconducting quantum processor
- Towards Quantum Chemistry on a Quantum Computer
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Quantum optimization using variational algorithms on near-term quantum devices
- Procedure for systematically tuning up crosstalk in the cross resonance gate
- Fluctuations of Energy-Relaxation Times in Superconducting Qubits
- Rydberg mediated entanglement in a two-dimensional neutral atom qubit array
- Trading classical and quantum computational resources
- Simulating Large Quantum Circuits on a Small Quantum Computer
- Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
- 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit
- Approximate Quantum Fourier Transform and Decoherence
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- 64-Qubit Quantum Circuit Simulation
- Full-State Quantum Circuit Simulation by Using Data Compression
- Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
- Optimal Layout Synthesis for Quantum Computing
- Optimality Study of Existing Quantum Computing Layout Synthesis Tools
Cited by in corpus (38)
- The Future of Quantum Computing with Superconducting Qubits
- Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
- MorphQ: Metamorphic Testing of the Qiskit Quantum Computing Platform
- JigSaw: Boosting Fidelity of NISQ Programs via Measurement Subsetting
- High Dimensional Quantum Machine Learning With Small Quantum Computers
- Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices
- Quantum Divide and Compute: Exploring The Effect of Different Noise Sources
- Cutting multi-control quantum gates with ZX calculus
- Revisiting the Mapping of Quantum Circuits: Entering the Multi-Core Era
- HAMMER: boosting fidelity of noisy Quantum circuits by exploiting Hamming behavior of erroneous outcomes
- Doubly optimal parallel wire cutting without ancilla qubits
- Classical Splitting of Parametrized Quantum Circuits
- Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler
- Networked Quantum Services
- Quantum circuit compilation and hybrid computation using Pauli-based computation
- -QER: An Intelligent Approach towards Quantum Error Reduction
- Qoncord: A Multi-Device Job Scheduling Framework for Variational Quantum Algorithms
- Error suppression by a virtual two-qubit gate
- iQuantum: A Case for Modeling and Simulation of Quantum Computing Environments
- Distributed Quantum Computing: Applications and Challenges
- A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting
- Simulation of Quantum Computers: Review and Acceleration Opportunities
- Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation
- Divide-and-conquer verification method for noisy intermediate-scale quantum computation
- Cutting a Wire with Non-Maximally Entangled States
- A Multilevel Framework for Partitioning Quantum Circuits
- Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
- Folding-Free ZNE: A Comprehensive Quantum Zero-Noise Extrapolation Approach for Mitigating Depolarizing and Decoherence Noise
- Identifying Bottlenecks of NISQ-friendly HHL algorithms
- Accelerating Simulation of Quantum Circuits under Noise via Computational Reuse
- Network Operations Scheduling for Distributed Quantum Computing
- On the Impact of Classical and Quantum Communication Networks Upon Modular Quantum Computing Architecture System Performance
- Quantum Circuit Cutting for Classical Shadows
- GTQCP: Greedy Topology-Aware Quantum Circuit Partitioning
- Distributing Quantum Computations, Shot-wise
- Qubit-efficient quantum combinatorial optimization solver
- Circuit Folding: Scalable and Graph-Based Circuit Cutting via Modular Structure Exploitation
- How Many Shots Are Enough for a Quantum Circuit?