Optimal joint cutting of two-qubit rotation gates
arXiv:2312.09679 · doi:10.1103/PhysRevA.109.052440
Abstract
Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments. Here, we introduce a scheme for joint cutting of two-qubit rotation gates based on a virtual gate-teleportation protocol. By that, we significantly lower the previous upper bounds on the sampling overhead and prove optimality of the scheme. Furthermore, we show that no classical communication between the circuit partitions is required. For parallel two-qubit rotation gates we derive an optimal ancilla-free decomposition, which include CNOT gates as a special case.
References in corpus (30)
- Quantum Machine Learning
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- Quantum Teleportation is a Universal Computational Primitive
- Error mitigation for short-depth quantum circuits
- Towards Quantum Chemistry on a Quantum Computer
- Robustness of entanglement
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Optimal local implementation of non-local quantum gates
- Simulating Large Quantum Circuits on a Small Quantum Computer
- Entangling operations and their implementation using a small amount of entanglement
- Estimating outcome probabilities of quantum circuits using quasiprobabilities
- The non-local content of quantum operations
- Methodology for replacing indirect measurements with direct measurements
- Quantum circuit optimizations for NISQ architectures
- Circuit knitting with classical communication
- Constructing a virtual two-qubit gate by sampling single-qubit operations
- Phase Gadget Synthesis for Shallow Circuits
- Fast quantum circuit cutting with randomized measurements
- Quasiprobability decompositions with reduced sampling overhead
- Non-local Operations: Purification, storage, compression, tomography, and probabilistic implementation
- Overhead for simulating a non-local channel with local channels by quasiprobability sampling
- Representation of entanglement by negative quasi-probabilities
- On the efficiency of nonlocal gates generation
- Entanglement cost of implementing controlled-unitary operations
- Entanglement requirements for implementing bipartite unitary operations
- Cutting multi-control quantum gates with ZX calculus
- Virtual quantum resource distillation
- How to simulate a quantum computer using negative probabilities
- Annealing Optimisation of Mixed ZX Phase Circuits
Cited by in corpus (10)
- Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
- Combining quantum processors with real-time classical communication
- Cutting circuits with multiple two-qubit unitaries
- Cutting a Wire with Non-Maximally Entangled States
- Joint Wire Cutting with Non-Maximally Entangled States
- Multithreaded parallelism for heterogeneous clusters of QPUs
- Circuit Folding: Scalable and Graph-Based Circuit Cutting via Modular Structure Exploitation
- Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits
- CutReg: A loss regularizer for enhancing the scalability of QML via adaptive circuit cutting
- Time-frequency-correlated Native CCZ Gate in Superconducting Circuits