Multi-qubit Randomized Benchmarking Using Few Samples
arXiv:1701.04299 · doi:10.1103/PhysRevA.100.032304
Abstract
Randomized benchmarking (RB) is an efficient and robust method to characterize gate errors in quantum circuits. Averaging over random sequences of gates leads to estimates of gate errors in terms of the average fidelity. These estimates are isolated from the state preparation and measurement errors that plague other methods like channel tomography and direct fidelity estimation. A decisive factor in the feasibility of randomized benchmarking is the number of sampled sequences required to obtain rigorous confidence intervals. Previous bounds were either prohibitively loose or required the number of sampled sequences to scale exponentially with the number of qubits in order to obtain a fixed confidence interval at a fixed error rate. Here we show that, with a small adaptation to the randomized benchmarking procedure, the number of sampled sequences required for a fixed confidence interval is dramatically smaller than could previously be justified. In particular, we show that the number of sampled sequences required is essentially independent of the number of qubits and scales favorably with the average error rate of the system under investigation. We also show that the number of samples required for long sequence lengths can be made substantially smaller than previous rigorous results (even for single qubits) as long as the noise process under investigation is not unitary. Our results bring rigorous randomized benchmarking on systems with many qubits into the realm of experimental feasibility.
arXiv commentv3: Added discussion of the impact of variance heteroskedasticity on the RB fitting procedure. Close to published version
References in corpus (50)
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
- Quantum state tomography via compressed sensing
- Randomized Benchmarking of Quantum Gates
- A Theory of Fault-Tolerant Quantum Computation
- Prescription for experimental determination of the dynamics of a quantum black box
- Robust randomized benchmarking of quantum processes
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Noise tailoring for scalable quantum computation via randomized compiling
- Scalable Noise Estimation with Random Unitary Operators
- Direct Fidelity Estimation from Few Pauli Measurements
- Characterizing Quantum Gates via Randomized Benchmarking
- Efficient measurement of quantum gate error by interleaved randomized benchmarking
- Evenly distributed unitaries: on the structure of unitary designs
- Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
- Quantum Data Hiding
- Practical characterization of quantum devices without tomography
- Self-Consistent Quantum Process Tomography
- Estimating the Coherence of Noise
- Multiqubit Clifford groups are unitary 3-designs
- Initialization by measurement of a two-qubit superconducting circuit
- Quantification and Characterization of Leakage Errors
- Randomized Benchmarking with Confidence
- Three Qubit Randomized Benchmarking
- Quantifying the quantum gate fidelity of single-atom spin qubits in silicon by randomized benchmarking
- Investigating the limits of randomized benchmarking protocols
- Benchmarking Gate Fidelities in a Si/SiGe Two-Qubit Device
- Fault-Tolerant Logical Gates in the IBM Quantum Experience
- Randomized Benchmarking of Multi-Qubit Gates
- Error Mitigation by Symmetry Verification on a Variational Quantum Eigensolver
- What randomized benchmarking actually measures
- Robust Extraction of Tomographic Information via Randomized Benchmarking
- Characterizing Universal Gate Sets via Dihedral Benchmarking
- Convergence Conditions for Random Quantum Circuits
- Randomized benchmarking with gate-dependent noise
- Scalable randomized benchmarking of non-Clifford gates
- Non-exponential Fidelity Decay in Randomized Benchmarking with Low-Frequency Noise
- Characterization of Leakage Errors via Randomized Benchmarking
- Gate fidelity fluctuations and quantum process invariants
- Real Randomized Benchmarking
- Accelerated Randomized Benchmarking
- Robust Characterization of Loss Rates
- Independent, extensible control of same-frequency superconducting qubits by selective broadcasting
- Bounding the average gate fidelity of composite channels using the unitarity
- Rolling quantum dice with a superconducting qubit
- An Ideal Characterization of the Clifford Operators
- Representations of the multi-qubit Clifford group
- Derandomizing quantum circuits with measurement based unitary designs
Cited by in corpus (24)
- Quantum certification and benchmarking
- Theory of quantum system certification: a tutorial
- A general framework for randomized benchmarking
- Direct randomized benchmarking for multi-qubit devices
- Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
- Nonstabilizerness determining the hardness of direct fidelity estimation
- Recovering quantum gates from few average gate fidelities
- Real Randomized Benchmarking
- Statistical analysis of randomized benchmarking
- Robust and Efficient Hamiltonian Learning
- Randomized Benchmarking with Restricted Gate Sets
- Modeling Noisy Quantum Circuits Using Experimental Characterization
- Suppression of mid-circuit measurement crosstalk errors with micromotion
- Subspace benchmarking high-fidelity entangling operations with trapped ions
- Thrifty shadow estimation: re-using quantum circuits and bounding tails
- Estimating gate-set properties from random sequences
- Representations of the multi-qubit Clifford group
- Operational, gauge-free quantum tomography
- Robust certification of arbitrary outcome quantum measurements from temporal correlations
- Kerdock Codes Determine Unitary 2-Designs
- Coherent randomized benchmarking
- Estimating the bias of CX gates via character randomized benchmarking
- Hardware-efficient random circuits to classify noise in a multi-qubit system
- Duality theory for Clifford tensor powers