Accrediting outputs of noisy intermediate-scale quantum computing devices
arXiv:1811.09709 · doi:10.1088/1367-2630/ab4fd6
Abstract
We present an accreditation protocol for the outputs of noisy intermediate-scale quantum devices. By testing entire circuits rather than individual gates, our accreditation protocol can provide an upper-bound on the variation distance between noisy and noiseless probability distribution of the outputs of the target circuit of interest. Our accreditation protocol requires implementation of quantum circuits no larger than the target circuit, therefore it is practical in the near term and scalable in the long term. Inspired by trap-based protocols for the verification of quantum computations, our accreditation protocol assumes that noise in single-qubit gates is bounded (but potentially gate-dependent) in diamond norm. We allow for arbitrary spatial and temporal correlations in the noise affecting state preparation, measurements and two-qubit gates. We describe how to implement our protocol on real-world devices, and we also present a novel cryptographic protocol (which we call `mesothetic' protocol) inspired by our accreditation protocol.
arXiv commentAccepted version
References in corpus (39)
- Quantum Computing in the NISQ era and beyond
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Characterizing Quantum Supremacy in Near-Term Devices
- Randomized Benchmarking of Quantum Gates
- Robust randomized benchmarking of quantum processes
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
- Noise tailoring for scalable quantum computation via randomized compiling
- Scalable Noise Estimation with Random Unitary Operators
- Procedure for systematically tuning up crosstalk in the cross resonance gate
- Universal blind quantum computation
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Average-case complexity versus approximate simulation of commuting quantum computations
- Unconditionally verifiable blind computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Verification of quantum computation: An overview of existing approaches
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- High-fidelity trapped-ion quantum logic using near-field microwaves
- Experimental verification of quantum computations
- Bounding quantum gate error rate based on reported average fidelity
- Robustness and device independence of verifiable blind quantum computing
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- Interactive Proofs For Quantum Computations
- Post hoc verification of quantum computation
- Post hoc verification with a single prover
- Randomized benchmarking with gate-dependent noise
- Interactive proofs for BQP via self-tested graph states
- Quantum Circuits with Mixed States
- Direct certification of a class of quantum simulations
- Robust self-testing of many-qubit states
- How to Verify a Quantum Computation
- Resource-efficient verification of quantum computing using Serfling's bound
- Verifiable fault-tolerance in measurement-based quantum computation
- Unbiased Simulation of Near-Clifford Quantum Circuits
- Optimised resource construction for verifiable quantum computation
- Reducing resources for verification of quantum computations
- Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors
- Nonadaptive fault-tolerant verification of quantum supremacy with noise
Cited by in corpus (24)
- Measuring the Capabilities of Quantum Computers
- Application-Oriented Performance Benchmarks for Quantum Computing
- Theory of quantum system certification: a tutorial
- Non-Markovian Quantum Process Tomography
- ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling
- Quantum Computing: An Overview Across the System Stack
- Efficient verification of Boson Sampling
- Efficient verification of quantum processes
- Characterizing the Reproducibility of Noisy Quantum Circuits
- Efficiently improving the performance of noisy quantum computers
- A Practical Introduction to Benchmarking and Characterization of Quantum Computers
- Experimental accreditation of outputs of noisy quantum computers
- Stability of noisy quantum computing devices
- Blind quantum computation for a user who only performs single-qubit gates
- Quantum algorithms for scientific computing
- Mitigating errors by quantum verification and post-selection
- Leveraging Randomized Compiling for the QITE Algorithm
- Divide-and-conquer verification method for noisy intermediate-scale quantum computation
- In situ characterization of linear-optical networks in randomized boson sampling
- Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation
- Accreditation of Analogue Quantum Simulators
- Gaining confidence on the correct realization of arbitrary quantum computations
- QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers
- Accreditation Against Limited Adversarial Noise