Experimental accreditation of outputs of noisy quantum computers
arXiv:2103.06603 · doi:10.1103/PhysRevA.104.042603
Abstract
We provide and experimentally demonstrate an accreditation protocol that upper-bounds the variation distance between noisy and noiseless probability distributions of the outputs of arbitrary quantum computations. We accredit the outputs of twenty-four quantum circuits executed on programmable superconducting hardware, ranging from depth nine circuits on ten qubits to depth twenty-one circuits on four qubits. Our protocol requires implementing the "target" quantum circuit along with a number of random Clifford circuits and subsequently post-processing the outputs of these Clifford circuits. Importantly, the number of Clifford circuits is chosen to obtain the bound with the desired confidence and accuracy, and is independent of the size and nature of the target circuit. We thus demonstrate a practical and scalable method of ascertaining the correctness of the outputs of arbitrary-sized noisy quantum computers--the ultimate arbiter of the utility of the computer itself.
arXiv commentAccepted version
References in corpus (32)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Characterizing Quantum Supremacy in Near-Term Devices
- Randomized Benchmarking of Quantum Gates
- Multi-particle entanglement of hot trapped ions
- Prescription for experimental determination of the dynamics of a quantum black box
- Robust randomized benchmarking of quantum processes
- Validating quantum computers using randomized model circuits
- Noise tailoring for scalable quantum computation via randomized compiling
- Benchmarking an 11-qubit quantum computer
- Direct Fidelity Estimation from Few Pauli Measurements
- Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
- Practical characterization of quantum devices without tomography
- Self-Consistent Quantum Process Tomography
- Unconditionally verifiable blind computation
- Characterizing large-scale quantum computers via cycle benchmarking
- Efficient learning of quantum noise
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Quantum Process Tomography of the Quantum Fourier Transform
- Efficient estimation of Pauli channels
- Direct randomized benchmarking for multi-qubit devices
- Post hoc verification of quantum computation
- Post hoc verification with a single prover
- Introduction to Quantum Gate Set Tomography
- Experimental Estimation of Average Fidelity of a Clifford Gate on a 7-qubit Quantum Processor
- How to Verify a Quantum Computation
- Practical experimental certification of computational quantum gates via twirling
- Demonstration of quantum volume 64 on a superconducting quantum computing system
- Modeling Noisy Quantum Circuits Using Experimental Characterization
- Accrediting outputs of noisy intermediate-scale quantum computing devices
- Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
- Reducing resources for verification of quantum computations
- Microwave-based Arbitrary CPHASE Gates for Transmon Qubits