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.

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

References in corpus (11)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A Quantum Approximate Optimization Algorithm
• Direct Fidelity Estimation from Few Pauli Measurements
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Securing Quantum Computations in the NISQ Era
• 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
• Mermin's Inequalities of Multiple qubits with Orthogonal Measurements on IBM Q 53-qubit system
• A deep learning model for noise prediction on near-term quantum devices
• Experimental accreditation of outputs of noisy quantum computers

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