Demonstrating scalable randomized benchmarking of universal gate sets
arXiv:2207.07272 · doi:10.1103/PhysRevX.13.041030
Abstract
Randomized benchmarking (RB) protocols are the most widely used methods for assessing the performance of quantum gates. However, the existing RB methods either do not scale to many qubits or cannot benchmark a universal gate set. Here, we introduce and demonstrate a technique for scalable RB of many universal and continuously parameterized gate sets, using a class of circuits called randomized mirror circuits. Our technique can be applied to a gate set containing an entangling Clifford gate and the set of arbitrary single-qubit gates, as well as gate sets containing controlled rotations about the Pauli axes. We use our technique to benchmark universal gate sets on four qubits of the Advanced Quantum Testbed, including a gate set containing a controlled-S gate and its inverse, and we investigate how the observed error rate is impacted by the inclusion of non-Clifford gates. Finally, we demonstrate that our technique scales to many qubits with experiments on a 27-qubit IBM Q processor. We use our technique to quantify the impact of crosstalk on this 27-qubit device, and we find that it contributes approximately 2/3 of the total error per gate in random many-qubit circuit layers.
arXiv comment15 pages + appendices. v2: Corrected error in Section IIIA step 3 + minor edits. v3: Added new theory results
References in corpus (46)
- 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
- Quantum Computing with Very Noisy Devices
- Characterizing Quantum Supremacy in Near-Term Devices
- Randomized Benchmarking of Quantum Gates
- Robust randomized benchmarking of quantum processes
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Validating quantum computers using randomized model circuits
- Efficient Z-Gates for Quantum Computing
- Noise tailoring for scalable quantum computation via randomized compiling
- 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
- Minimal Universal Two-qubit Quantum Circuits
- Symmetrised Characterisation of Noisy Quantum Processes
- Characterizing large-scale quantum computers via cycle benchmarking
- Detecting crosstalk errors in quantum information processors
- Gate Set Tomography
- Measuring the Capabilities of Quantum Computers
- 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
- Robust Extraction of Tomographic Information via Randomized Benchmarking
- Characterizing Universal Gate Sets via Dihedral Benchmarking
- Scalable randomized benchmarking of non-Clifford gates
- The effect of noise correlations on randomized benchmarking
- Scalable randomized benchmarking of quantum computers using mirror circuits
- Probing quantum processor performance with pyGSTi
- Probing context-dependent errors in quantum processors
- Experimental Characterization of Crosstalk Errors with Simultaneous Gate Set Tomography
- Experimental quantum verification in the presence of temporally correlated noise
- Real Randomized Benchmarking
- Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
- A taxonomy of small Markovian errors
- Bounding the average gate fidelity of composite channels using the unitarity
- Randomized Benchmarking with Restricted Gate Sets
- 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
- Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
- Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate
- Hybrid benchmarking of arbitrary quantum gates
- Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors
- Efficient flexible characterization of quantum processors with nested error models
Cited by in corpus (12)
- A Practical Introduction to Benchmarking and Characterization of Quantum Computers
- Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer
- Fully scalable randomized benchmarking without motion reversal
- Empirical learning of dynamical decoupling on quantum processors
- Hands-on Introduction to Randomized Benchmarking
- A Theory of Direct Randomized Benchmarking
- Learning a quantum computer's capability
- Scalable Full-Stack Benchmarks for Quantum Computers
- Model validation and error attribution for a drifting qubit
- Robust Error Accumulation Suppression for Quantum Circuits
- Benchmarking quantum devices beyond classical capabilities
- End-to-End Quantum Algorithms for the Jones Polynomial