Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates

Abstract

Unitarity randomized benchmarking (URB) is an experimental procedure for estimating the coherence of implemented quantum gates independently of state preparation and measurement errors. These estimates of the coherence are measured by the unitarity. A central problem in this experiment is relating the number of data points to rigorous confidence intervals. In this work we provide a bound on the required number of data points for Clifford URB as a function of confidence and experimental parameters. This bound has favorable scaling in the regime of near-unitary noise and is asymptotically independent of the length of the gate sequences used. We also show that, in contrast to standard randomized benchmarking, a nontrivial number of data points is always required to overcome the randomness introduced by state preparation and measurement errors even in the limit of perfect gates. Our bound is sufficiently sharp to benchmark small-dimensional systems in realistic parameter regimes using a modest number of data points. For example, we show that the unitarity of single-qubit Clifford gates can be rigorously estimated using few hundred data points under the assumption of gate-independent noise. This is a reduction of orders of magnitude compared to previously known bounds.

arXiv comment18 pages main text, 26 pages appendix, 6 figures. This version is close to published version. Several paragraphs of discussion were added throughout the main text

References in corpus (37)

• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Scalable Noise Estimation with Random Unitary Operators
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Evenly distributed unitaries: on the structure of unitary designs
• Randomized benchmarking of single qubit gates in a 2D array of neutral atom qubits
• Implementing optimal control pulse shaping for improved single-qubit gates
• Estimating the Coherence of Noise
• Multiqubit Clifford groups are unitary 3-designs
• Randomized Benchmarking with Confidence
• Characterizing errors on qubit operations via iterative randomized benchmarking
• Quantifying the quantum gate fidelity of single-atom spin qubits in silicon by randomized benchmarking
• Investigating the limits of randomized benchmarking protocols
• Contractivity of positive and trace preserving maps under $L_p$ norms
• Comparing Experiments to the Fault-Tolerance Threshold
• Randomized Benchmarking of Multi-Qubit Gates
• What randomized benchmarking actually measures
• Bounding quantum gate error rate based on reported average fidelity
• 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
• Randomized benchmarking of atomic qubits in an optical lattice
• Real Randomized Benchmarking
• Accelerated Randomized Benchmarking
• Robust Characterization of Loss Rates
• Estimating the coherence of noise in quantum control of a solid-state qubit
• Randomized Benchmarking with Restricted Gate Sets
• A complete Randomized Benchmarking Protocol accounting for Leakage Errors
• An Ideal Characterization of the Clifford Operators
• Approximate Randomized Benchmarking for Finite Groups
• A universal set of qubit quantum channels
• Representations of the multi-qubit Clifford group

Cited by in corpus (11)

• Theory of quantum system certification: a tutorial
• A general framework for randomized benchmarking
• Bounding the average gate fidelity of composite channels using the unitarity
• Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking
• Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
• Randomized benchmarking for non-Markovian noise
• Spectral Quantum Tomography
• Unitarity estimation for quantum channels
• Exploring Quantum Average-Case Distances: proofs, properties, and examples
• Estimation of correlations and non-separability in quantum channels via unitarity benchmarking
• Coherent randomized benchmarking