Approximate Randomized Benchmarking for Finite Groups

Abstract

We investigate randomized benchmarking in a general setting with quantum gates that form a representation, not necessarily an irreducible one, of a finite group. We derive an estimate for the average fidelity, to which experimental data may then be calibrated. Furthermore, we establish that randomized benchmarking can be achieved by the sole implementation of quantum gates that generate the group as well as one additional arbitrary group element. In this case, we need to assume that the noise is close to being covariant. This yields a more practical approach to randomized benchmarking. Moreover, we show that randomized benchmarking is stable with respect to approximate Haar sampling for the sequences of gates. This opens up the possibility of using Markov chain Monte Carlo methods to obtain the random sequences of gates more efficiently. We demonstrate these results numerically using the well-studied example of the Clifford group as well as the group of monomial unitary matrices. For the latter, we focus on the subgroup with nonzero entries consisting of n-th roots of unity, which contains T gates.

arXiv comment36 pages, 2 figures, close to published version

References in corpus (32)

• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Randomized Benchmarking of Quantum Gates
• Prescription for experimental determination of the dynamics of a quantum black box
• Robust randomized benchmarking of quantum processes
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Scalable Noise Estimation with Random Unitary Operators
• Characterizing Quantum Gates via Randomized Benchmarking
• Random Quantum Circuits are Approximate 2-designs
• Characterization of addressability by simultaneous randomized benchmarking
• Symmetrised Characterisation of Noisy Quantum Processes
• Randomized benchmarking and process tomography for gate errors in a solid-state qubit
• Randomized benchmarking of single qubit gates in a 2D array of neutral atom qubits
• Single-qubit-gate error below 10^-4 in a trapped ion
• Randomized Benchmarking with Confidence
• Quantifying the quantum gate fidelity of single-atom spin qubits in silicon by randomized benchmarking
• Contractivity of positive and trace preserving maps under $L_p$ norms
• Randomized Benchmarking of Multi-Qubit Gates
• What randomized benchmarking actually measures
• Unital Quantum Channels - Convex Structure and Revivals of Birkhoff's Theorem
• Approaches for approximate additivity of the Holevo information of quantum channels
• Characterizing Universal Gate Sets via Dihedral Benchmarking
• Ergodic and Mixing Quantum Channels in Finite Dimensions
• Randomized benchmarking with gate-dependent noise
• Scalable randomized benchmarking of non-Clifford gates
• How to efficiently select an arbitrary Clifford group element
• Randomized benchmarking of atomic qubits in an optical lattice
• Efficient error characterization in Quantum Information Processing
• Independent, extensible control of same-frequency superconducting qubits by selective broadcasting
• Randomized Benchmarking with Restricted Gate Sets
• Structure of irreducibly covariant quantum channels for finite groups

Cited by in corpus (30)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum certification and benchmarking
• Efficient learning of quantum noise
• Theory of quantum system certification: a tutorial
• A general framework for randomized benchmarking
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Probing context-dependent errors in quantum processors
• Randomized benchmarking for individual quantum gates
• Subspace benchmarking high-fidelity entangling operations with trapped ions
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Randomized Benchmarking in the Analogue Setting
• A polar decomposition for quantum channels (with applications to bounding error propagation in quantum circuits)
• Randomized Benchmarking Beyond Groups
• Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
• Positive Maps From Irreducibly Covariant Operators
• Estimation of correlations and non-separability in quantum channels via unitarity benchmarking
• Coherent randomized benchmarking
• Hands-on Introduction to Randomized Benchmarking
• Benchmarking of universal qutrit gates
• Lower Bounds on Learning Pauli Channels with Individual Measurements
• Estimating the bias of CX gates via character randomized benchmarking
• A Theory of Direct Randomized Benchmarking
• Leakage Benchmarking for Universal Gate Sets
• Bosonic randomized benchmarking with passive transformations
• On the classification of two-qubit group orbits and the use of coarse-grained 'shape' as a superselection property
• Fermionic Averaged Circuit Eigenvalue Sampling
• Blind-spots of Randomized Benchmarking Under Temporal Correlations
• Hardware-efficient random circuits to classify noise in a multi-qubit system