Theory of mirror benchmarking and demonstration on a quantum computer
arXiv:2108.10431
Abstract
A new class of protocols called mirror benchmarking was recently proposed to measure the system-level performance of quantum computers. These protocols involve circuits with random sequences of gates followed by mirroring, that is, inverting each gate in the sequence. We give a simple proof that mirror benchmarking leads to an exponential decay of the survival probability with sequence length, under the uniform noise assumption, provided the twirling group forms a 2-design. The decay rate is determined by a quantity that is a quadratic function of the error channel, and for certain types of errors is equal to the unitarity. This result yields a new method for estimating the coherence of noise. We present data from mirror benchmarking experiments run on the Honeywell System Model H1. This data constitutes a set of performance curves, indicating the success probability for random circuits as a function of qubit number and circuit depth.
References in corpus (15)
- Randomized Benchmarking of Quantum Gates
- Entanglement and quantum computation with ions in thermal motion
- 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
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Noise tailoring for scalable quantum computation via randomized compiling
- Benchmarking an 11-qubit quantum computer
- Estimating the Coherence of Noise
- Multiqubit Clifford groups are unitary 3-designs
- Randomized Benchmarking with Confidence
- Comparing Experiments to the Fault-Tolerance Threshold
- Direct randomized benchmarking for multi-qubit devices
- Statistical analysis of randomized benchmarking
- Randomized Benchmarking of Clifford Operators