Benchmarking quantum logic operations relative to thresholds for fault tolerance

Abstract

Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates -- defined via the diamond norm -- which can differ from average error rates by orders of magnitude. One method for resolving this discrepancy is to randomize the physical implementation of quantum gates, using techniques like randomized compiling (RC). In this work, we use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor. We find that, under RC, gate errors are accurately described by a stochastic Pauli noise model without coherent errors, and that spatially-correlated coherent errors and non-Markovian errors are strongly suppressed. We further show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set. Our results show that randomized benchmarks are a viable route to both verifying that a quantum processor's error rates are below a fault-tolerance threshold, and to bounding the failure rates of near-term algorithms, if -- and only if -- gates are implemented via randomization methods which tailor noise.

References in corpus (18)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Randomized Benchmarking of Quantum Gates
• Fault-tolerant quantum computation with high threshold in two dimensions
• Robust randomized benchmarking of quantum processes
• Topological fault-tolerance in cluster state quantum computation
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Low-distance Surface Codes under Realistic Quantum Noise
• Subsystem fault tolerance with the Bacon-Shor code
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Transmon qubit readout fidelity at the threshold for quantum error correction without a quantum-limited amplifier
• Quantum error correction of coherent errors by randomization
• The Fibonacci scheme for fault-tolerant quantum computation
• Comparison of a quantum error correction threshold for exact and approximate errors
• Fault-tolerance thresholds for the surface code with fabrication errors
• State leakage during fast decay and control of a superconducting transmon qubit
• Generalized Performance of Concatenated Quantum Codes -- A Dynamical Systems Approach
• Extending the Computational Reach of a Superconducting Qutrit Processor

Cited by in corpus (8)

• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Benchmarking quantum gates and circuits
• Quasi-Probabilistic Readout Correction of Mid-Circuit Measurements for Adaptive Feedback via Measurement Randomized Compiling
• Operational Markovianization in Randomized Benchmarking
• Quantum error mitigation in the regime of high noise using deep neural network: Trotterized dynamics
• Learning a quantum computer's capability
• Introducing Reduced-Width QNNs, an AI-inspired Ansatz Design Pattern
• (2+1)D quantum electrodynamics at finite density on a quantum computer