Scalable randomized benchmarking of non-Clifford gates

Abstract

Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterization of $n$-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomized benchmarking procedure over $n$-qubit unitary matrices that correspond to protected non-Clifford gates for a class of stabilizer codes. We present efficient methods for representing and composing group elements, sampling them uniformly, and synthesizing corresponding $\mathrm{poly}(n)$-sized circuits. The procedure provides experimental access to two independent parameters that together characterize the average gate fidelity of a group element.

5+4 pages, 1 figure

References in corpus (11)

• Randomized Benchmarking of Quantum Gates
• Fault-tolerant quantum computation with high threshold in two dimensions
• Robust randomized benchmarking of quantum processes
• Characterization of addressability by simultaneous randomized benchmarking
• Process verification of two-qubit quantum gates by randomized benchmarking
• Topological Computation without Braiding
• Randomized Benchmarking of Multi-Qubit Gates
• Robust Characterization of Loss Rates
• Reducing the quantum computing overhead with complex gate distillation
• Rolling quantum dice with a superconducting qubit
• A Non-Commuting Stabilizer Formalism

Cited by in corpus (66)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Trapped-Ion Quantum Computing: Progress and Challenges
• Quantum information processing with superconducting circuits: a review
• Quantum certification and benchmarking
• Demonstration of quantum error correction and universal gate set on a binomial bosonic logical qubit
• Theory of quantum system certification: a tutorial
• Benchmarking Gate Fidelities in a Si/SiGe Two-Qubit Device
• 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
• Multi-exponential Error Extrapolation and Combining Error Mitigation Techniques for NISQ Applications
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Recovering quantum gates from few average gate fidelities
• Real Randomized Benchmarking
• Statistical analysis of randomized benchmarking
• Multi-qubit Randomized Benchmarking Using Few Samples
• Benchmarking high fidelity single-shot readout of semiconductor qubits
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• Bounding the average gate fidelity of composite channels using the unitarity
• QInfer: Statistical inference software for quantum applications
• 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
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Independent State and Measurement Characterization for Quantum Computers
• Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate
• Efficient verification of quantum gates with local operations
• A randomized benchmarking suite for mid-circuit measurements
• Noise filtering of composite pulses for singlet-triplet qubits
• Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
• Demonstrating scalable randomized benchmarking of universal gate sets
• Randomized Benchmarking under Different Gatesets
• A polar decomposition for quantum channels (with applications to bounding error propagation in quantum circuits)
• Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors
• Benchmarking universal quantum gates via channel spectrum
• Operational, gauge-free quantum tomography
• Fully scalable randomized benchmarking without motion reversal
• Randomized Benchmarking Beyond Groups
• Quantum Process Identification: A Method for Characterizing Non-Markovian Quantum Dynamics
• Continuous-variable quantum state designs: theory and applications
• Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
• Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates
• Linear Cross Entropy Benchmarking with Clifford Circuits
• Randomised benchmarking for universal qudit gates
• Projective toric designs, quantum state designs, and mutually unbiased bases
• Group twirling and noise tailoring for multi-qubit controlled phase gates
• Hands-on Introduction to Randomized Benchmarking
• Coherent randomized benchmarking
• Reliable Characterization for Improving and Validating Accurate Quantum Operations
• Estimating the bias of CX gates via character randomized benchmarking
• Randomized Benchmarking Protocol for Dynamic Circuits
• Fidelity decay and error accumulation in random quantum circuits
• A Theory of Direct Randomized Benchmarking
• Scalable Full-Stack Benchmarks for Quantum Computers
• Certification of continuous-variable gates using average channel-fidelity witnesses
• Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums
• Characterisation of individual gates using twirling circuits
• Benchmarking non-Clifford gates using only Pauli twirling group
• Cloud-Assisted Contracted Simulation of Quantum Chains