Characterizing Universal Gate Sets via Dihedral Benchmarking

Abstract

We describe a practical experimental protocol for robustly characterizing the error rates of non-Clifford gates associated with dihedral groups, including gates in SU(2) associated with arbitrarily small angle rotations. Our dihedral benchmarking protocol is a generalization of randomized benchmarking that relaxes the usual unitary 2-design condition. Combining this protocol with existing randomized benchmarking schemes enables an efficient means of characterizing universal gate sets for quantum information processing in a way that is independent of state-preparation and measurement errors. In particular, our protocol enables direct benchmarking of the $T$ gate (sometime called $\pi /8$-gate) even for the gate-dependent error model that is expected in leading approaches to fault-tolerant quantum computation.

4 pages, 3 figures

References in corpus (20)

• Surface codes: Towards practical large-scale quantum computation
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• 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
• Characterization of addressability by simultaneous randomized benchmarking
• Self-Consistent Quantum Process Tomography
• Randomized Benchmarking with Confidence
• Robust Extraction of Tomographic Information via Randomized Benchmarking
• Modeling quantum noise for efficient testing of fault-tolerant circuits
• Accelerated Randomized Benchmarking
• Comparison of a quantum error correction threshold for exact and approximate errors
• Reducing the quantum computing overhead with complex gate distillation
• Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
• Tractable Simulation of Error Correction with Honest Approximations to Realistic Fault Models
• Rolling quantum dice with a superconducting qubit

Cited by in corpus (76)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Trapped-Ion Quantum Computing: Progress and Challenges
• Noise tailoring for scalable quantum computation via randomized compiling
• Quantum certification and benchmarking
• Demonstration of quantum error correction and universal gate set on a binomial bosonic logical qubit
• Characterizing large-scale quantum computers via cycle benchmarking
• Gate Set Tomography
• Theory of quantum system certification: a tutorial
• Fault-Tolerant Logical Gates in the IBM Quantum Experience
• A general framework for randomized benchmarking
• Modelling and Simulating the Noisy Behaviour of Near-term Quantum Computers
• What randomized benchmarking actually measures
• Efficient estimation of Pauli channels
• Direct randomized benchmarking for multi-qubit devices
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Detecting and tracking drift in quantum information processors
• Randomized benchmarking with gate-dependent noise
• Scalable randomized benchmarking of non-Clifford gates
• Introduction to Quantum Gate Set Tomography
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Probing context-dependent errors in quantum processors
• Recovering quantum gates from few average gate fidelities
• Learning robust control for generating universal quantum gates
• Real Randomized Benchmarking
• Statistical analysis of randomized benchmarking
• Multi-qubit Randomized Benchmarking Using Few Samples
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• Bounding the average gate fidelity of composite channels using the unitarity
• Randomized Benchmarking with Restricted Gate Sets
• Randomized benchmarking for individual quantum gates
• Estimating the fidelity of T gates using standard interleaved randomized benchmarking
• From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters
• Approximate Randomized Benchmarking for Finite Groups
• Randomized benchmarking for non-Markovian noise
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Bootstrapping quantum process tomography via a perturbative ansatz
• Independent State and Measurement Characterization for Quantum Computers
• Learning correlated noise in a 39-qubit quantum processor
• Efficient verification of quantum gates with local operations
• Efficiently improving the performance of noisy quantum computers
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Demonstrating scalable randomized benchmarking of universal gate sets
• Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
• Randomized benchmarking for qudit Clifford gates
• Randomized Benchmarking under Different Gatesets
• Randomized benchmarking in measurement-based quantum computing
• Leveraging Randomized Compiling for the QITE Algorithm
• Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors
• A polar decomposition for quantum channels (with applications to bounding error propagation in quantum circuits)
• Benchmarking universal quantum gates via channel spectrum
• Operational, gauge-free quantum tomography
• Fully scalable randomized benchmarking without motion reversal
• Randomized Benchmarking Beyond Groups
• Efficient Assessment of Process Fidelity
• Techniques for learning sparse Pauli-Lindblad noise models
• Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
• Comparing randomized benchmarking figure with average infidelity of quantum gate-set
• Efficient flexible characterization of quantum processors with nested error models
• Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates
• Randomized benchmarking in the presence of time-correlated dephasing noise
• Linear Cross Entropy Benchmarking with Clifford Circuits
• Randomised benchmarking for universal qudit gates
• Learning optimal quantum models is NP-hard
• Coherent randomized benchmarking
• Recommender systems inspired by the structure of quantum theory
• Combining $T_1$ and $T_2$ estimation with randomized benchmarking and bounding the diamond distance
• Estimating the bias of CX gates via character randomized benchmarking
• Benchmarking of universal qutrit gates
• Measurement-based interleaved randomised benchmarking using IBM processors
• Leakage Benchmarking for Universal Gate Sets
• A Theory of Direct Randomized Benchmarking
• Approximate 3-designs and partial decomposition of the Clifford group representation using transvections
• Qudit non-Clifford interleaved benchmarking
• Benchmarking non-Clifford gates using only Pauli twirling group
• Three-state quantum walk on the Cayley Graph of the Dihedral Group
• Accreditation Against Limited Adversarial Noise