Cutting circuits with multiple two-qubit unitaries
arXiv:2312.11638 · doi:10.22331/q-2025-02-18-1634
Abstract
Quasiprobabilistic cutting techniques allow us to partition large quantum circuits into smaller subcircuits by replacing non-local gates with probabilistic mixtures of local gates. The cost of this method is a sampling overhead that scales exponentially in the number of cuts. It is crucial to determine the minimal cost for gate cutting and to understand whether allowing for classical communication between subcircuits can improve the sampling overhead. In this work, we derive a closed formula for the optimal sampling overhead for cutting an arbitrary number of two-qubit unitaries and provide the corresponding decomposition. We find that cutting several arbitrary two-qubit unitaries together is cheaper than cutting them individually and classical communication does not give any advantage.
(v2): 24 pages, 5 figures, published version
References in corpus (13)
- Error mitigation for short-depth quantum circuits
- Practical Quantum Error Mitigation for Near-Future Applications
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- Trading classical and quantum computational resources
- Simulating Large Quantum Circuits on a Small Quantum Computer
- Circuit knitting with classical communication
- Constructing a virtual two-qubit gate by sampling single-qubit operations
- Fast quantum circuit cutting with randomized measurements
- Overhead for simulating a non-local channel with local channels by quasiprobability sampling
- Doubly optimal parallel wire cutting without ancilla qubits
- Optimal joint cutting of two-qubit rotation gates
- Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
- An alternative approach to optimal wire cutting without ancilla qubits