Constructing a virtual two-qubit gate by sampling single-qubit operations

Abstract

We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the result, we describe a strategy to decompose a two-qubit gate to a sequence of single-qubit operations. Required operations are projective measurement of a qubit in Pauli basis, and $\pi /2$ rotation around x, y, and z axes. The required number of sampling to get an expectation value of a target observable within an error of $\epsilon$ is roughly $O(9^k/{\epsilon }^2)$, where $k$ is the number of "cuts" performed. The proposed technique enables to perform "virtual" gates between a distant pair of qubits, where there is no direct interaction and thus a number of swap gates are inevitable otherwise. It can also be utilized to improve the simulation of a large quantum computer with a small-sized quantum device, which is an idea put forward by [Peng, et al., arXiv:1904.00102]. This work can enhance the connectivity of qubits on near-term, noisy quantum computers.

References in corpus (7)

• Probing many-body dynamics on a 51-atom quantum simulator
• Quantum Computational Supremacy
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• Methodology for replacing indirect measurements with direct measurements
• Tensor Networks in a Nutshell
• Ground-state energy estimation of the water molecule on a trapped ion quantum computer
• Generalization of the output of variational quantum eigensolver by parameter interpolation with low-depth ansatz

Cited by in corpus (54)

• The Future of Quantum Computing with Superconducting Qubits
• Doubling the size of quantum simulators by entanglement forging
• Circuit knitting with classical communication
• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Fast quantum circuit cutting with randomized measurements
• Combining quantum processors with real-time classical communication
• Overhead for simulating a non-local channel with local channels by quasiprobability sampling
• High Dimensional Quantum Machine Learning With Small Quantum Computers
• Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices
• Perturbative quantum simulation
• N-electron valence perturbation theory with reference wavefunctions from quantum computing: application to the relative stability of hydroxide anion and hydroxyl radical
• Experimental Simulation of Larger Quantum Circuits with Fewer Superconducting Qubits
• Cutting multi-control quantum gates with ZX calculus
• Architectural Vision for Quantum Computing in the Edge-Cloud Continuum
• Doubly optimal parallel wire cutting without ancilla qubits
• Probabilistic Interpolation of Quantum Rotation Angles
• Networked Quantum Services
• Optimal joint cutting of two-qubit rotation gates
• Gutzwiller wave function on a quantum computer using a discrete Hubbard-Stratonovich transformation
• Overhead-constrained circuit knitting for variational quantum dynamics
• Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
• Improved simulation of quantum circuits dominated by free fermionic operations
• Experimental demonstration of a high-fidelity virtual two-qubit gate
• Distributed Quantum Computing: Applications and Challenges
• Error suppression by a virtual two-qubit gate
• Cutting circuits with multiple two-qubit unitaries
• A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting
• Quantifying fermionic nonlinearity of quantum circuits
• Cutting a Wire with Non-Maximally Entangled States
• Divide-and-conquer verification method for noisy intermediate-scale quantum computation
• Optimal wire cutting with classical communication
• Single entanglement connection architecture between multi-layer bipartite Hardware Efficient Ansatz
• Joint Wire Cutting with Non-Maximally Entangled States
• Resource-efficient Generalized Quantum Subspace Expansion
• Power of quantum measurement in simulating unphysical operations
• Multithreaded parallelism for heterogeneous clusters of QPUs
• Noisy Probabilistic Error Cancellation and Generalized Physical Implementability
• Quantum channel decomposition with pre- and post-selection
• Perspectives on Utilization of Measurements in Quantum Algorithms
• Density matrix representation of hybrid tensor networks for noisy quantum devices
• QRCC: Evaluating Large Quantum Circuits on Small Quantum Computers through Integrated Qubit Reuse and Circuit Cutting
• Qonductor: A Cloud Orchestrator for Quantum Computing
• Entanglement-informed Construction of Variational Quantum Circuits
• Circuit cutting with classical side information
• Correcting and extending Trotterized quantum many-body dynamics
• Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA
• Circuit connectivity boosts by quantum-classical-quantum interfaces
• Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits
• Mitigating errors in state preparation and measurement with noncomputational states
• CutReg: A loss regularizer for enhancing the scalability of QML via adaptive circuit cutting
• Unitary-transformed projective squeezing: applications for circuit-knitting and state-preparation of non-Gaussian states
• Power and limitations of distributed quantum state purification
• Dynamic LOCC Circuits for Automated Entanglement Manipulation
• Circuit Folding: Scalable and Graph-Based Circuit Cutting via Modular Structure Exploitation