Quantum channel decomposition with pre- and post-selection

Abstract

The quantum channel decomposition techniques, which contain the so-called probabilistic error cancellation and gate/wire cutting, are powerful approach for simulating a hard-to-implement (or an ideal) unitary operation by concurrently executing relatively easy-to-implement (or noisy) quantum channels. However, such virtual simulation necessitates an exponentially large number of decompositions, thereby significantly limiting their practical applicability. This paper proposes a channel decomposition method for target unitaries that have their input and output conditioned on specific quantum states, namely unitaries with pre- and post-selection. Specifically, we explicitly determine the requisite number of decomposing channels, which could be significantly smaller than the selection-free scenario. Furthermore, we elucidate the structure of the resulting decomposed unitary. We demonstrate an application of this approach to the quantum linear solver algorithm, highlighting the efficacy of the proposed method.

arXiv commentpublished version, 11 pages, 5 figures

References in corpus (20)

• Quantum algorithm for solving linear systems of equations
• Error mitigation for short-depth quantum circuits
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Practical Quantum Error Mitigation for Near-Future Applications
• Trading classical and quantum computational resources
• Simulating Large Quantum Circuits on a Small Quantum Computer
• High-order quantum algorithm for solving linear differential equations
• Efficient quantum algorithm for dissipative nonlinear differential equations
• Real- and imaginary-time evolution with compressed quantum circuits
• Quantum algorithm for linear differential equations with exponentially improved dependence on precision
• Constructing a virtual two-qubit gate by sampling single-qubit operations
• A Quantum Algorithm for Solving Linear Differential Equations: Theory and Experiment
• Fast quantum circuit cutting with randomized measurements
• Quasiprobability decompositions with reduced sampling overhead
• Optimal resource cost for error mitigation
• Overhead for simulating a non-local channel with local channels by quasiprobability sampling
• High Dimensional Quantum Machine Learning With Small Quantum Computers
• Experimental Simulation of Larger Quantum Circuits with Fewer Superconducting Qubits
• Efficient Construction of a Control Modular Adder on a Carry-Lookahead Adder Using Relative-phase Toffoli Gates
• Divide-and-conquer verification method for noisy intermediate-scale quantum computation

Cited by in corpus (2)

• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Doubly optimal parallel wire cutting without ancilla qubits