From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters

Abstract

Randomized benchmarking (RB) protocols have become an essential tool for providing a meaningful partial characterization of experimental quantum operations. While the RB decay rate is known to enable estimates of the average fidelity of those operations under gate-independent Markovian noise, under gate-dependent noise this rate is more difficult to interpret rigorously. In this paper, we prove that single-qubit RB decay parameter $p$ coincides with the decay parameter of the gate-set circuit fidelity, a novel figure of merit which characterizes the expected average fidelity over arbitrary circuits of operations from the gate-set. We also prove that, in the limit of high-fidelity single-qubit experiments, the possible alarming disconnect between the average gate fidelity and RB experimental results is simply explained by a basis mismatch between the gates and the state-preparation and measurement procedures, that is, to a unitary degree of freedom in labeling the Pauli matrices. Based on numerical evidence and physically motivated arguments, we conjecture that these results also hold for higher dimensions.

arXiv comment10 pages, 3 figures

References in corpus (20)

• 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
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Scalable Noise Estimation with Random Unitary Operators
• Procedure for systematically tuning up crosstalk in the cross resonance gate
• Characterizing Quantum Gates via Randomized Benchmarking
• A universal gate for fixed-frequency qubits via a tunable bus
• Optimal quantum control using randomized benchmarking
• Process verification of two-qubit quantum gates by randomized benchmarking
• Demonstration of weight-four parity measurements in the surface code architecture
• Randomized Benchmarking of Multi-Qubit Gates
• What randomized benchmarking actually measures
• Characterizing Universal Gate Sets via Dihedral Benchmarking
• Gatemon Benchmarking and Two-Qubit Operation
• Randomized benchmarking with gate-dependent noise
• Scalable randomized benchmarking of non-Clifford gates
• Efficient error characterization in Quantum Information Processing
• A complete Randomized Benchmarking Protocol accounting for Leakage Errors
• Bounding experimental quantum error rates relative to fault-tolerant thresholds

Cited by in corpus (26)

• Theory of quantum system certification: a tutorial
• Benchmarking Gate Fidelities in a Si/SiGe Two-Qubit Device
• Fault-Tolerant Logical Gates in the IBM Quantum Experience
• A general framework for randomized benchmarking
• Direct randomized benchmarking for multi-qubit devices
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Bounding the average gate fidelity of composite channels using the unitarity
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• The Impact of Imperfect Timekeeping on Quantum Control
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Group-theoretic error mitigation enabled by classical shadows and symmetries
• Demonstrating scalable randomized benchmarking of universal gate sets
• Randomized Benchmarking under Different Gatesets
• Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors
• Fully scalable randomized benchmarking without motion reversal
• On the freedom in representing quantum operations
• Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
• Comparing randomized benchmarking figure with average infidelity of quantum gate-set
• Randomized benchmarking in the presence of time-correlated dephasing noise
• On the robustness of the hybrid qubit computational gates through simulated randomized benchmarking protocols
• Estimating the bias of CX gates via character randomized benchmarking
• A Theory of Direct Randomized Benchmarking
• Measurement-based interleaved randomised benchmarking using IBM processors
• Practical Quantum Computing: The value of local computation
• Approximate 3-designs and partial decomposition of the Clifford group representation using transvections