Divide-and-conquer verification method for noisy intermediate-scale quantum computation

Abstract

Several noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip, where two-qubit gates can be directly applied on only some pairs of qubits. In this paper, we propose a method to efficiently verify such noisy intermediate-scale quantum computation. To this end, we first characterize small-scale quantum operations with respect to the diamond norm. Then by using these characterized quantum operations, we estimate the fidelity $⟨{\psi }_t|{\hat{\rho }}_{\mathrm{out}}|{\psi }_t⟩$ between an actual $n$-qubit output state ${\hat{\rho }}_{\mathrm{out}}$ obtained from the noisy intermediate-scale quantum computation and the ideal output state (i.e., the target state) $|{\psi }_t⟩$. Although the direct fidelity estimation method requires $O(2^n)$ copies of ${\hat{\rho }}_{\mathrm{out}}$ on average, our method requires only $O(D^3{2}^{12D})$ copies even in the worst case, where $D$ is the denseness of $|{\psi }_t⟩$. For logarithmic-depth quantum circuits on a sparse chip, $D$ is at most $O(\log n)$, and thus $O(D^3{2}^{12D})$ is a polynomial in $n$. By using the IBM Manila 5-qubit chip, we also perform a proof-of-principle experiment to observe the practical performance of our method.

arXiv comment17 pages, 7 figures, v3: Added a proof-of-principle experiment (Sec. IV) and improved Sec. V, Accepted for publication in Quantum

References in corpus (48)

• 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
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• A Quantum Approximate Optimization Algorithm
• Quantum Circuit Learning
• Error mitigation for short-depth quantum circuits
• Efficient variational quantum simulator incorporating active error minimisation
• Quantum state estimation
• Practical Quantum Error Mitigation for Near-Future Applications
• Direct Fidelity Estimation from Few Pauli Measurements
• Maximum-likelihood estimation of the density matrix
• Trading classical and quantum computational resources
• Unconditionally verifiable blind computation
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Low-cost error mitigation by symmetry verification
• Learning-based quantum error mitigation
• Verifiable measurement-only blind quantum computing with stabilizer testing
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Optimality Study of Existing Quantum Computing Layout Synthesis Tools
• Constructing a virtual two-qubit gate by sampling single-qubit operations
• Mitigating realistic noise in practical noisy intermediate-scale quantum devices
• Post hoc verification of quantum computation
• Post hoc verification with a single prover
• Verification of Many-Qubit States
• Efficient Verification of Hypergraph States
• Verified measurement-based quantum computing with hypergraph states
• How to Verify a Quantum Computation
• Quantum Circuit Cutting with Maximum Likelihood Tomography
• Resource-efficient verification of quantum computing using Serfling's bound
• Efficient verification of Dicke states
• Overhead for simulating a non-local channel with local channels by quasiprobability sampling
• Non-interactive classical verification of quantum computation
• Securing Quantum Computations in the NISQ Era
• Preparation of an Exciton Condensate of Photons on a 53-Qubit Quantum Computer
• Accrediting outputs of noisy intermediate-scale quantum computing devices
• Measurement-only verifiable blind quantum computing with quantum input verification
• Quantum de Finetti theorem under fully-one-way adaptive measurements
• Quantum Divide and Compute: Hardware Demonstrations and Noisy Simulations
• Verifying commuting quantum computations via fidelity estimation of weighted graph states
• Mermin's Inequalities of Multiple qubits with Orthogonal Measurements on IBM Q 53-qubit system
• Generic detection-based error-mitigation using quantum autoencoders
• A deep learning model for noise prediction on near-term quantum devices
• Experimental accreditation of outputs of noisy quantum computers
• Large-scale quantum hybrid solution for linear systems of equations
• A quantum procedure for map generation
• Characterizing the memory capacity of transmon qubit reservoirs

Cited by in corpus (4)

• Algorithm-Oriented Qubit Mapping for Variational Quantum Algorithms
• Resource-efficient Generalized Quantum Subspace Expansion
• Quantum channel decomposition with pre- and post-selection
• Quantum computation capability verification protocol for NISQ devices with dihedral coset problem