Fully scalable randomized benchmarking without motion reversal

Abstract

We introduce binary randomized benchmarking (BiRB), a protocol that streamlines traditional RB by using circuits consisting almost entirely of i.i.d. layers of gates. BiRB reliably and efficiently extracts the average error rate of a Clifford gate set by sending tensor product eigenstates of random Pauli operators through random circuits with i.i.d. layers. Unlike existing RB methods, BiRB does not use motion reversal circuits -- i.e., circuits that implement the identity (or a Pauli) operator -- which simplifies both the method and the theory proving its reliability. Furthermore, this simplicity enables scaling BiRB to many more qubits than the most widely-used RB methods.

9 pages + appendices, 5 figures, v2: Close to published version, fixed typos in theory section

References in corpus (40)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Characterizing Quantum Supremacy in Near-Term Devices
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Validating quantum computers using randomized model circuits
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Noise tailoring for scalable quantum computation via randomized compiling
• Direct Fidelity Estimation from Few Pauli Measurements
• Characterizing Quantum Gates via Randomized Benchmarking
• Practical characterization of quantum devices without tomography
• Characterization of addressability by simultaneous randomized benchmarking
• Symmetrised Characterisation of Noisy Quantum Processes
• Characterizing large-scale quantum computers via cycle benchmarking
• Efficient learning of quantum noise
• Gate Set Tomography
• Randomized Benchmarking with Confidence
• Three Qubit Randomized Benchmarking
• Measuring the Capabilities of Quantum Computers
• Quantifying the quantum gate fidelity of single-atom spin qubits in silicon by randomized benchmarking
• Qutrit randomized benchmarking
• A general framework for randomized benchmarking
• What randomized benchmarking actually measures
• Efficient estimation of Pauli channels
• Direct randomized benchmarking for multi-qubit devices
• Hadamard-free circuits expose the structure of the Clifford group
• Characterizing Universal Gate Sets via Dihedral Benchmarking
• Randomized benchmarking with gate-dependent noise
• Scalable randomized benchmarking of non-Clifford gates
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Probing quantum processor performance with pyGSTi
• Real Randomized Benchmarking
• Statistical analysis of randomized benchmarking
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• A taxonomy of small Markovian errors
• Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
• Randomized Benchmarking with Restricted Gate Sets
• From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Demonstrating scalable randomized benchmarking of universal gate sets

Cited by in corpus (8)

• Benchmarking quantum computers
• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Benchmarking Quantum Computers: Towards a Standard Performance Evaluation Approach
• Hands-on Introduction to Randomized Benchmarking
• Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements
• Randomized Benchmarking Protocol for Dynamic Circuits
• A Theory of Direct Randomized Benchmarking