A Theory of Direct Randomized Benchmarking

Abstract

Randomized benchmarking (RB) protocols are widely used to measure an average error rate for a set of quantum logic gates. However, the standard version of RB is limited because it only benchmarks a processor's native gates indirectly, by using them in composite $n$-qubit Clifford gates. Standard RB's reliance on $n$-qubit Clifford gates restricts it to the few-qubit regime, because the fidelity of a typical composite $n$-qubit Clifford gate decreases rapidly with increasing $n$. Furthermore, although standard RB is often used to infer the error rate of native gates, by rescaling standard RB's error per Clifford to an error per native gate, this is an unreliable extrapolation. Direct RB is a method that addresses these limitations of standard RB, by directly benchmarking a customizable gate set, such as a processor's native gates. Here we provide a detailed introduction to direct RB, we discuss how to design direct RB experiments, and we present two complementary theories for direct RB. The first of these theories uses the concept of error propagation or scrambling in random circuits to show that direct RB is reliable for gates that experience stochastic Pauli errors. We prove that the direct RB decay is a single exponential, and that the decay rate is equal to the average infidelity of the benchmarked gates, under broad circumstances. This theory shows that group twirling is not required for reliable RB. Our second theory proves that direct RB is reliable for gates that experience general gate-dependent Markovian errors, using similar techniques to contemporary theories for standard RB. Our two theories for direct RB have complementary regimes of applicability, and they provide complementary perspectives on why direct RB works. Together these theories provide comprehensive guarantees on the reliability of direct RB.

Version to be published in Quantum

References in corpus (78)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Improved Simulation of Stabilizer Circuits
• Quantum Computing with Very Noisy Devices
• Characterizing Quantum Supremacy in Near-Term Devices
• Fast Scramblers
• Randomized Benchmarking of Quantum Gates
• An addressable quantum dot qubit with fault-tolerant control fidelity
• A >99.9%-fidelity quantum-dot spin qubit with coherence limited by charge noise
• Robust randomized benchmarking of quantum processes
• A programmable two-qubit quantum processor in silicon
• Operator Spreading in Random Unitary Circuits
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws
• Quantum CNOT Gate for Spins in Silicon
• Noise tailoring for scalable quantum computation via randomized compiling
• Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
• Scalable Noise Estimation with Random Unitary Operators
• Direct Fidelity Estimation from Few Pauli Measurements
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
• Evenly distributed unitaries: on the structure of unitary designs
• Local random quantum circuits are approximate polynomial-designs
• Characterization of addressability by simultaneous randomized benchmarking
• Self-Consistent Quantum Process Tomography
• A universal quantum circuit for two-qubit transformations with three CNOT gates
• Symmetrised Characterisation of Noisy Quantum Processes
• Measuring and Suppressing Quantum State Leakage in a Superconducting Qubit
• Characterizing large-scale quantum computers via cycle benchmarking
• Randomized benchmarking of single qubit gates in a 2D array of neutral atom qubits
• Optimal quantum control using randomized benchmarking
• Process verification of two-qubit quantum gates by randomized benchmarking
• Gate Set Tomography
• Estimating the Coherence of Noise
• Quantification and Characterization of Leakage Errors
• Randomized Benchmarking with Confidence
• Three Qubit Randomized Benchmarking
• Characterizing errors on qubit operations via iterative randomized benchmarking
• Measuring the Capabilities of Quantum Computers
• Quantifying the quantum gate fidelity of single-atom spin qubits in silicon by randomized benchmarking
• Investigating the limits of randomized benchmarking protocols
• A general framework for randomized benchmarking
• What randomized benchmarking actually measures
• Direct randomized benchmarking for multi-qubit devices
• Hadamard-free circuits expose the structure of the Clifford group
• Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
• Characterizing Universal Gate Sets via Dihedral Benchmarking
• Decoupling with random quantum circuits
• Detecting and tracking drift in quantum information processors
• Randomized benchmarking with gate-dependent noise
• Scalable randomized benchmarking of non-Clifford gates
• Restless Tuneup of High-Fidelity Qubit Gates
• Scalable randomized benchmarking of quantum computers using mirror circuits
• How to efficiently select an arbitrary Clifford group element
• Non-exponential Fidelity Decay in Randomized Benchmarking with Low-Frequency Noise
• Probing quantum processor performance with pyGSTi
• Recognizing Small-Circuit Structure in Two-Qubit Operators and Timing Hamiltonians to Compute Controlled-Not Gates
• Experimental quantum verification in the presence of temporally correlated noise
• Real Randomized Benchmarking
• Accelerated Randomized Benchmarking
• Statistical analysis of randomized benchmarking
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• Robust Characterization of Loss Rates
• Estimating the coherence of noise in quantum control of a solid-state qubit
• A taxonomy of small Markovian errors
• Randomized Benchmarking with Restricted Gate Sets
• Estimating the fidelity of T gates using standard interleaved randomized benchmarking
• A complete Randomized Benchmarking Protocol accounting for Leakage Errors
• From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters
• Approximate Randomized Benchmarking for Finite Groups
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate
• Demonstrating scalable randomized benchmarking of universal gate sets
• Operator growth in random quantum circuits with symmetry
• Randomized Benchmarking under Different Gatesets
• Hybrid benchmarking of arbitrary quantum gates
• Fully scalable randomized benchmarking without motion reversal

Cited by in corpus (2)

• Randomized Benchmarking with Leakage Errors
• Benchmarking Single-Qubit Gates on a Neutral Atom Quantum Processor