Leakage Benchmarking for Universal Gate Sets

Abstract

Errors are common issues in quantum computing platforms, among which leakage is one of the most challenging to address. This is because leakage, i.e., the loss of information stored in the computational subspace to undesired subspaces in a larger Hilbert space, is more difficult to detect and correct than errors that preserve the computational subspace. As a result, leakage presents a significant obstacle to the development of fault-tolerant quantum computation. In this paper, we propose an efficient and accurate benchmarking framework called leakage randomized benchmarking (LRB) for measuring leakage rates on multi-qubit quantum systems. Our approach is more insensitive to state preparation and measurement (SPAM) noise than existing leakage benchmarking protocols, requires fewer assumptions about the gate set itself, and can be used to benchmark multi-qubit leakages, which was not done previously. We also extend the LRB protocol to an interleaved variant called interleaved LRB (iLRB), which can benchmark the average leakage rate of generic $n$-site quantum gates with reasonable noise assumptions. We demonstrate the iLRB protocol on benchmarking generic two-qubit gates realized using flux tuning, and analyze the behavior of iLRB under corresponding leakage models. Our numerical experiments show good agreement with theoretical estimations, indicating the feasibility of both the LRB and iLRB protocols. Keywords: quantum computing; randomized benchmarking; leakage error; quantum gates

27 pages, 5 figures

References in corpus (27)

• A Quantum Engineer's Guide to Superconducting Qubits
• Quantum computing with trapped ions
• Randomized Benchmarking of Quantum Gates
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Efficient Z-Gates for Quantum Computing
• Direct Fidelity Estimation from Few Pauli Measurements
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits
• Practical characterization of quantum devices without tomography
• Measuring and Suppressing Quantum State Leakage in a Superconducting Qubit
• Characterizing large-scale quantum computers via cycle benchmarking
• Efficient learning of quantum noise
• Gate Set Tomography
• Fast adiabatic qubit gates using only ${\sigma }_z$ control
• Quantification and Characterization of Leakage Errors
• Fluxonium: an alternative qubit platform for high-fidelity operations
• Qutrit randomized benchmarking
• A general framework for randomized benchmarking
• Characterizing Universal Gate Sets via Dihedral Benchmarking
• Mitigating realistic noise in practical noisy intermediate-scale quantum devices
• Quantifying error and leakage in an encoded Si/SiGe triple-dot qubit
• Characterization of Leakage Errors via Randomized Benchmarking
• Robust Characterization of Loss Rates
• Randomized Benchmarking with Restricted Gate Sets
• A complete Randomized Benchmarking Protocol accounting for Leakage Errors
• Approximate Randomized Benchmarking for Finite Groups
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking

Cited by in corpus (1)

• Randomized Benchmarking with Leakage Errors