Circuit knitting with classical communication

Abstract

The scarcity of qubits is a major obstacle to the practical usage of quantum computers in the near future. To circumvent this problem, various circuit knitting techniques have been developed to partition large quantum circuits into subcircuits that fit on smaller devices, at the cost of a simulation overhead. In this work, we study a particular method of circuit knitting based on quasiprobability simulation of nonlocal gates with operations that act locally on the subcircuits. We investigate whether classical communication between these local quantum computers can help. We provide a positive answer by showing that for circuits containing $n$ nonlocal CNOT gates connecting two circuit parts, the simulation overhead can be reduced from $O(9^n)$ to $O(4^n)$ if one allows for classical information exchange. Similar improvements can be obtained for general Clifford gates and, at least in a restricted form, for other gates such as controlled rotation gates.

v3: 20 pages, 6 figures; published version

References in corpus (1)

• Application of a resource theory for magic states to fault-tolerant quantum computing

Cited by in corpus (47)

• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Early Fault-Tolerant Quantum Computing
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Distributing circuits over heterogeneous, modular quantum computing network architectures
• Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices
• Cutting multi-control quantum gates with ZX calculus
• A randomized benchmarking suite for mid-circuit measurements
• Doubly optimal parallel wire cutting without ancilla qubits
• Classical simulation of non-Gaussian fermionic circuits
• Networked Quantum Services
• Optimal joint cutting of two-qubit rotation gates
• Quantum circuit compilation and hybrid computation using Pauli-based computation
• Overhead-constrained circuit knitting for variational quantum dynamics
• Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
• Experimental demonstration of a high-fidelity virtual two-qubit gate
• Error suppression by a virtual two-qubit gate
• Cutting circuits with multiple two-qubit unitaries
• Distributed quantum machine learning via classical communication
• Cutting a Wire with Non-Maximally Entangled States
• Optimal wire cutting with classical communication
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• On the Impact of Classical and Quantum Communication Networks Upon Modular Quantum Computing Architecture System Performance
• Joint Wire Cutting with Non-Maximally Entangled States
• Single entanglement connection architecture between multi-layer bipartite Hardware Efficient Ansatz
• Shadow Simulation of Quantum Processes
• Multithreaded parallelism for heterogeneous clusters of QPUs
• Readout Error Mitigation for Mid-Circuit Measurements and Feedforward
• Power of quantum measurement in simulating unphysical operations
• Noisy Probabilistic Error Cancellation and Generalized Physical Implementability
• Density matrix representation of hybrid tensor networks for noisy quantum devices
• Q-gen: A Parameterized Quantum Circuit Generator
• Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection
• Perspectives on Utilization of Measurements in Quantum Algorithms
• A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks
• Circuit cutting with classical side information
• Virtual Quantum Markov Chains
• Correcting and extending Trotterized quantum many-body dynamics
• Gate Teleportation in Noisy Quantum Networks with the SquidASM Simulator
• Gibbs state sampling via cluster expansions
• Power and limitations of distributed quantum state purification
• Dynamic LOCC Circuits for Automated Entanglement Manipulation
• Network Requirements for Distributed Quantum Computation
• Circuit Folding: Scalable and Graph-Based Circuit Cutting via Modular Structure Exploitation
• Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits
• Unitary-transformed projective squeezing: applications for circuit-knitting and state-preparation of non-Gaussian states
• Mitigating errors in state preparation and measurement with noncomputational states
• Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA