Estimating the fidelity of T gates using standard interleaved randomized benchmarking

Abstract

Randomized benchmarking (RB) is an important protocol for robustly characterizing the error rates of quantum gates. The technique is typically applied to the Clifford gates since they form a group that satisfies a convenient technical condition of forming a unitary 2-design, in addition to having a tight connection to fault-tolerant quantum computing and an efficient classical simulation. In order to achieve universal quantum computing one must add at least one additional gate such as the T gate (also known as the $\pi$/8 gate). Here we propose and analyze a simple variation of the standard interleaved RB protocol that can accurately estimate the average fidelity of the T gate while retaining the many advantages of a unitary 2-design and the fidelity guarantees that such a design delivers, as well as the efficient classical simulation property of the Clifford group. Our work complements prior methods that have succeeded in estimating T gate fidelities, but only by relaxing the 2-design constraint and using a more complicated data analysis.

9 pages, 7 figures

References in corpus (7)

• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Direct Fidelity Estimation from Few Pauli Measurements
• Evenly distributed unitaries: on the structure of unitary designs
• Randomized Benchmarking of Multi-Qubit Gates
• Accelerated Randomized Benchmarking
• Hybrid benchmarking of arbitrary quantum gates

Cited by in corpus (33)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Demonstration of quantum error correction and universal gate set on a binomial bosonic logical qubit
• Gate Set Tomography
• Theory of quantum system certification: a tutorial
• A general framework for randomized benchmarking
• Direct randomized benchmarking for multi-qubit devices
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Statistical analysis of randomized benchmarking
• Bounding the average gate fidelity of composite channels using the unitarity
• QInfer: Statistical inference software for quantum applications
• Randomized benchmarking for individual quantum gates
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Learning correlated noise in a 39-qubit quantum processor
• Efficient verification of quantum gates with local operations
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Demonstrating scalable randomized benchmarking of universal gate sets
• Efficient Experimental Verification of Quantum Gates with Local Operations
• Measuring energy by measuring any other observable
• Remote Cross-resonance Gate between Superconducting Fixed-frequency Qubits
• Randomised benchmarking for universal qudit gates
• Proof-of-principle experimental demonstration of quantum gate verification
• Hands-on Introduction to Randomized Benchmarking
• Coherent randomized benchmarking
• Estimating the bias of CX gates via character randomized benchmarking
• A framework for randomized benchmarking over compact groups
• Measurement-based interleaved randomised benchmarking using IBM processors
• A Theory of Direct Randomized Benchmarking
• Error Mitigation of BQP Computations using Measurement-Based Verification
• T-Count Optimizing Genetic Algorithm for Quantum State Preparation
• Characterisation of individual gates using twirling circuits
• Investigating the effect of noise channels on the quality of unitary t-designs
• Qudit non-Clifford interleaved benchmarking