Randomized Benchmarking under Different Gatesets

Abstract

We provide a comprehensive analysis of the differences between two important standards for randomized benchmarking (RB): the Clifford-group RB protocol proposed originally in Emerson et al (2005) and Dankert et al (2006), and a variant of that RB protocol proposed later by the NIST group in Knill et al, PRA (2008). While these two protocols are frequently conflated or presumed equivalent, we prove that they produce distinct exponential fidelity decays leading to differences of up to a factor of 3 in the estimated error rates under experimentally realistic conditions. These differences arise because the NIST RB protocol does not satisfy the unitary two-design condition for the twirl in the Clifford-group protocol and thus the decay rate depends on non-invariant features of the error model. Our analysis provides an important first step towards developing definitive standards for benchmarking quantum gates and a more rigorous theoretical underpinning for the NIST protocol and other RB protocols lacking a group-structure. We conclude by discussing the potential impact of these differences for estimating fault-tolerant overheads.

References in corpus (29)

• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Quantum Computing with Very Noisy 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
• Characterizing Quantum Gates via Randomized Benchmarking
• Characterization of addressability by simultaneous randomized benchmarking
• Symmetrised Characterisation of Noisy Quantum Processes
• Randomized benchmarking of single qubit gates in a 2D array of neutral atom qubits
• Optimal quantum control using randomized benchmarking
• Single-qubit-gate error below 10^-4 in a trapped ion
• Quantification and Characterization of Leakage Errors
• Characterizing errors on qubit operations via iterative randomized benchmarking
• Quantifying the quantum gate fidelity of single-atom spin qubits in silicon by randomized benchmarking
• What randomized benchmarking actually measures
• Robust Extraction of Tomographic Information via Randomized Benchmarking
• Characterizing Universal Gate Sets via Dihedral Benchmarking
• Randomized benchmarking with gate-dependent noise
• Scalable randomized benchmarking of non-Clifford gates
• Characterization of Leakage Errors via Randomized Benchmarking
• Efficient error characterization in Quantum Information Processing
• Robust Characterization of Loss Rates
• A complete Randomized Benchmarking Protocol accounting for Leakage Errors
• Rolling quantum dice with a superconducting qubit
• From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters
• Randomized Benchmarking of Clifford Operators

Cited by in corpus (14)

• Computational advantage of quantum random sampling
• Theory of quantum system certification: a tutorial
• A general framework for randomized benchmarking
• A volumetric framework for quantum computer benchmarks
• High-fidelity parametric beamsplitting with a parity-protected converter
• Randomized benchmarking for individual quantum gates
• Randomized Benchmarking Beyond Groups
• Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors
• Gate-set evaluation metrics for closed-loop optimal control on nitrogen-vacancy center ensembles in diamond
• Coherent randomized benchmarking
• A Theory of Direct Randomized Benchmarking
• Measurement-based interleaved randomised benchmarking using IBM processors
• Error Mitigation of BQP Computations using Measurement-Based Verification
• Distribution of Non-Locality On Quantum Random Circuits