Cross-verification of independent quantum devices
arXiv:1905.09790 · doi:10.1103/PhysRevX.11.031049
Abstract
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers. This naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to classical simulation. Here we present a verification technique that exploits the principles of measurement-based quantum computation to link quantum circuits of different input size, depth, and structure. Our approach enables consistency checks of quantum computations within a device, as well as between independent devices. We showcase our protocol by applying it to five state-of-the-art quantum processors, based on four distinct physical architectures: nuclear magnetic resonance, superconducting circuits, trapped ions, and photonics, with up to 6 qubits and 200 distinct circuits.
References in corpus (41)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum Teleportation is a Universal Computational Primitive
- Characterizing Quantum Supremacy in Near-Term Devices
- Measurement-based quantum computation
- Probing the relaxation towards equilibrium in an isolated strongly correlated 1D Bose gas
- Quantum information processing with superconducting circuits: a review
- Quantum Computational Supremacy
- Entanglement and quantum computation with ions in thermal motion
- Robust randomized benchmarking of quantum processes
- Experimental entanglement of six photons in graph states
- Experimental ten-photon entanglement
- Noise tailoring for scalable quantum computation via randomized compiling
- Experimental Comparison of Two Quantum Computing Architectures
- Experimental Demonstration of Blind Quantum Computing
- A quantum information processor with trapped ions
- Unconditionally verifiable blind computation
- Characterizing large-scale quantum computers via cycle benchmarking
- Parametrically Activated Entangling Gates Using Transmon Qubits
- Emergence of coherence and the dynamics of quantum phase transitions
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Quantum Computing with NMR
- Cross-Platform Verification of Intermediate Scale Quantum Devices
- Experimental verification of quantum computations
- Determinism in the one-way model
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Measurement-based quantum computation with trapped ions
- Solving systems of linear equations on a quantum computer
- Analytical modeling of parametrically-modulated transmon qubits
- Post hoc verification with a single prover
- Post hoc verification of quantum computation
- Interactive proofs for BQP via self-tested graph states
- Reducing multi-photon rates in pulsed down-conversion by temporal multiplexing
- Single-copy entanglement detection
- Experimental few-copy multi-particle entanglement detection
- Compiling gate networks on an Ising quantum computer
- Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
- Preparing pseudo-pure states with controlled-transfer gates
- Practical and efficient experimental characterization of multiqubit stabilizer states
- Experimental demonstration of a measurement-based realisation of a quantum channel