A general framework for randomized benchmarking

Abstract

Randomized benchmarking (RB) refers to a collection of protocols that in the past decade have become central methods for characterizing quantum gates. These protocols aim at efficiently estimating the quality of a set of quantum gates in a way that is resistant to state preparation and measurement errors. Over the years many versions have been developed, however, a comprehensive theoretical treatment of RB has been missing. In this work, we develop a rigorous framework of RB general enough to encompass virtually all known protocols as well as novel, more flexible extensions. Overcoming previous limitations on error models and gate sets, this framework allows us, for the first time, to formulate realistic conditions under which we can rigorously guarantee that the output of any RB experiment is well-described by a linear combination of matrix exponential decays. We complement this with a detailed analysis of the fitting problem associated with RB data. We introduce modern signal processing techniques to RB, prove analytical sample complexity bounds, and numerically evaluate performance and limitations. In order to reduce the resource demands of this fitting problem, we introduce novel, scalable post-processing techniques to isolate exponential decays, significantly improving the practical feasibility of a large set of RB protocols. These post-processing techniques overcome shortcomings in efficiency of several previously proposed methods such as character benchmarking and linear-cross entropy benchmarking. Finally, we discuss, in full generality, how and when RB decay rates can be used to infer quality measures like the average fidelity. On the technical side, our work substantially extends the recently developed Fourier-theoretic perspective on RB by making use of the perturbation theory of invariant subspaces, as well as ideas from signal processing.

arXiv comment61 pages, 7 figures, replaced by final version in PRX Quantum

References in corpus (60)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• User-friendly tail bounds for sums of random matrices
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• The European Quantum Technologies Roadmap
• Roads towards fault-tolerant universal quantum computation
• Scalable Noise Estimation with Random Unitary Operators
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Quantum certification and benchmarking
• Characterization of addressability by simultaneous randomized benchmarking
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Symmetrised Characterisation of Noisy Quantum Processes
• Soundness and completeness of quantum root-mean-square errors
• Estimating the Coherence of Noise
• Multiqubit Clifford groups are unitary 3-designs
• Quantification and Characterization of Leakage Errors
• Randomized Benchmarking with Confidence
• Characterizing errors on qubit operations via iterative randomized benchmarking
• Theory of quantum system certification: a tutorial
• Investigating the limits of randomized benchmarking protocols
• What randomized benchmarking actually measures
• Direct randomized benchmarking for multi-qubit devices
• Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
• Efficient classical simulation of noisy random quantum circuits in one dimension
• 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
• Non-exponential Fidelity Decay in Randomized Benchmarking with Low-Frequency Noise
• Characterization of Leakage Errors via Randomized Benchmarking
• Probing context-dependent errors in quantum processors
• Efficient error characterization in Quantum Information Processing
• Gate fidelity fluctuations and quantum process invariants
• Recovering quantum gates from few average gate fidelities
• Real Randomized Benchmarking
• Statistical analysis of randomized benchmarking
• Multi-qubit Randomized Benchmarking Using Few Samples
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• Robust Characterization of Loss Rates
• Bounding the average gate fidelity of composite channels using the unitarity
• Randomized Benchmarking with Restricted Gate Sets
• Estimating the fidelity of T gates using standard interleaved randomized benchmarking
• Randomized benchmarking for individual quantum gates
• 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
• Approximate Randomized Benchmarking for Finite Groups
• Stable super-resolution limit and smallest singular value of restricted Fourier matrices
• Benchmarking near-term quantum computers via random circuit sampling
• Compressive Spectral Estimation with Single-Snapshot ESPRIT: Stability and Resolution
• Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
• Randomized Benchmarking under Different Gatesets
• Hybrid benchmarking of arbitrary quantum gates
• Randomized benchmarking in measurement-based quantum computing
• A polar decomposition for quantum channels (with applications to bounding error propagation in quantum circuits)
• Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors
• Randomized Benchmarking, Correlated Noise, and Ising Models
• A framework for randomized benchmarking over compact groups

Cited by in corpus (86)

• Semiconductor Spin Qubits
• Computational advantage of quantum random sampling
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Universal logic with encoded spin qubits in silicon
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Benchmarking quantum computers
• Noise-assisted digital quantum simulation of open systems
• Robust and Efficient Hamiltonian Learning
• Learning Quantum Hamiltonians from Single-qubit Measurements
• Realizing the Nishimori transition across the error threshold for constant-depth quantum circuits
• Thrifty shadow estimation: re-using quantum circuits and bounding tails
• Estimating gate-set properties from random sequences
• Emulating two qubits with a four-level transmon qudit for variational quantum algorithms
• A randomized benchmarking suite for mid-circuit measurements
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Demonstrating scalable randomized benchmarking of universal gate sets
• Qibolab: an open-source hybrid quantum operating system
• Benchmarking universal quantum gates via channel spectrum
• Benchmarking quantum gates and circuits
• Swap Test-based Characterization of Quantum Processes in Universal Quantum Computers
• Semi-device-dependent blind quantum tomography
• Fully scalable randomized benchmarking without motion reversal
• Algorithm-Oriented Qubit Mapping for Variational Quantum Algorithms
• Limits to Quantum Gate Fidelity from Near-Field Thermal and Vacuum Fluctuations
• Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
• Markovian Noise Modelling and Parameter Extraction Framework for Quantum Devices
• Stability of classical shadows under gate-dependent noise
• Linear Cross Entropy Benchmarking with Clifford Circuits
• Operational Markovianization in Randomized Benchmarking
• Cross-Platform Verification in Quantum Networks
• Unveiling quantum phase transitions from traps in variational quantum algorithms
• Randomised benchmarking for universal qudit gates
• Characterizing quantum instruments: from non-demolition measurements to quantum error correction
• Non-adaptive measurement-based quantum computation on IBM Q
• Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time
• Group twirling and noise tailoring for multi-qubit controlled phase gates
• On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations
• Hands-on Introduction to Randomized Benchmarking
• Disti-Mator: an entanglement distillation-based state estimator
• Anticoncentration and State Design of Doped Real Clifford Circuits and Tensor Networks
• Dual-Capability Machine Learning Models for Quantum Hamiltonian Parameter Estimation and Dynamics Prediction
• Quantum encoder for fixed Hamming-weight subspaces
• Hamiltonian Learning via Shadow Tomography of Pseudo-Choi States
• Benchmarking of universal qutrit gates
• Non-Haar random circuits form unitary designs as fast as Haar random circuits
• Approximate inverse measurement channel for shallow shadows
• Cross-Platform Comparison of Arbitrary Quantum Processes
• Lower Bounds on Learning Pauli Channels with Individual Measurements
• Robust Estimation of Nonlinear Properties of Quantum Processes
• Universal framework for simultaneous tomography of quantum states and SPAM noise
• Almost All Quantum Channels Are Diagonalizable
• Leakage Benchmarking for Universal Gate Sets
• A Theory of Direct Randomized Benchmarking
• Quantum noise modeling through Reinforcement Learning
• Randomized Benchmarking Protocol for Dynamic Circuits
• Noisy Probabilistic Error Cancellation and Generalized Physical Implementability
• Tomography of parametrized quantum states
• Benchmarking the performance of a high-Q cavity qudit using random unitaries
• Bosonic randomized benchmarking with passive transformations
• Counting collisions in random circuit sampling for benchmarking quantum computers
• Pseudochaotic Many-Body Dynamics as a Pseudorandom State Generator
• On Computational Complexity of Unitary and State Design Properties
• Noise resilience in adaptive and symmetric monitored quantum circuits
• SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning
• Scalable Full-Stack Benchmarks for Quantum Computers
• Classical certification of quantum gates under the dimension assumption
• A double selection entanglement distillation-based state estimator
• Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity
• Experimental measurement and a physical interpretation of quantum shadow enumerators
• Blind-spots of Randomized Benchmarking Under Temporal Correlations
• Optimizing Circuit Reusing and its Application in Randomized Benchmarking
• Simplifying errors by symmetry and randomisation
• Characterisation of individual gates using twirling circuits
• Optimal randomized measurements for a family of non-linear quantum properties
• Classification of quantum states of light using random measurements through a multimode fiber
• Shallow quantum circuit for generating extremely low-entangled approximate state designs
• Anticoncentration is (almost) all you need
• PyQBench: a Python library for benchmarking gate-based quantum computers
• Ptychographic estimation of pure multiqubit states in a quantum device
• Benchmarking Single-Qubit Gates on a Neutral Atom Quantum Processor
• Benchmarking non-Clifford gates using only Pauli twirling group
• Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors
• Efficient Characterization of Coherent and Correlated Low-Degree Noise in Layers of Gates
• Enlarging the GKP stabilizer group for enhanced noise protection
• Accreditation Against Limited Adversarial Noise