Overhead for simulating a non-local channel with local channels by quasiprobability sampling

Abstract

As the hardware technology for quantum computing advances, its possible applications are actively searched and developed. However, such applications still suffer from the noise on quantum devices, in particular when using two-qubit gates whose fidelity is relatively low. One way to overcome this difficulty is to substitute such non-local operations by local ones. Such substitution can be performed by decomposing a non-local channel into a linear combination of local channels and simulating the original channel with a quasiprobability-based method. In this work, we first define a quantity that we call channel robustness of non-locality, which quantifies the cost for the decomposition. While this quantity is challenging to calculate for a general non-local channel, we give an upper bound for a general two-qubit unitary channel by providing an explicit decomposition. The decomposition is obtained by generalizing our previous work whose application has been restricted to a certain form of two-qubit unitary. This work develops a framework for a resource reduction suitable for first-generation quantum devices.

arXiv comment7 pages, 2 figures

References in corpus (23)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• A Quantum Approximate Optimization Algorithm
• Quantum computational chemistry
• Quantum Circuit Learning
• Error mitigation for short-depth quantum circuits
• Quantum fingerprinting
• Practical Quantum Error Mitigation for Near-Future Applications
• Optimal Creation of Entanglement Using a Two--Qubit Gate
• A geometric theory of non-local two-qubit operations
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Trading classical and quantum computational resources
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Variational Quantum State Diagonalization
• Variational Quantum Linear Solver
• The SWAP test and the Hong-Ou-Mandel effect are equivalent
• Methodology for replacing indirect measurements with direct measurements
• Quantifying magic for multi-qubit operations
• Constructing a virtual two-qubit gate by sampling single-qubit operations
• Calculating transition amplitudes by variational quantum deflation
• Unbiased Simulation of Near-Clifford Quantum Circuits

Cited by in corpus (34)

• Circuit knitting with classical communication
• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Quantum simulation with hybrid tensor networks
• Fast quantum circuit cutting with randomized measurements
• 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
• Experimental Simulation of Larger Quantum Circuits with Fewer Superconducting Qubits
• Cutting multi-control quantum gates with ZX calculus
• Doubly optimal parallel wire cutting without ancilla qubits
• Networked Quantum Services
• Optimal joint cutting of two-qubit rotation gates
• Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
• Overhead-constrained circuit knitting for variational quantum dynamics
• Distributed Quantum Computing: Applications and Challenges
• Error suppression by a virtual two-qubit gate
• Cutting circuits with multiple two-qubit unitaries
• SCIM MILQ: An HPC Quantum Scheduler
• Divide-and-conquer verification method for noisy intermediate-scale quantum computation
• Optimal wire cutting with classical communication
• Exponential Qubit Reduction in Optimization for Financial Transaction Settlement
• Shadow Simulation of Quantum Processes
• Power of quantum measurement in simulating unphysical operations
• Quantum channel decomposition with pre- and post-selection
• Noisy Probabilistic Error Cancellation and Generalized Physical Implementability
• Circuit cutting with classical side information
• Sampling-based quasiprobability simulation for fault-tolerant quantum error correction on the surface codes under coherent noise
• Correcting and extending Trotterized quantum many-body dynamics
• Virtual Quantum Markov Chains
• Circuit Folding: Scalable and Graph-Based Circuit Cutting via Modular Structure Exploitation
• Ideal stochastic process modeling with post-quantum quasiprobabilistic theories
• Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA
• Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits
• Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction