Randomized Benchmarking (Gate Fidelity)
The standard protocol for estimating average gate error rates in quantum processors, developed by Magesan, Gambetta, and Emerson. Random sequences of Clifford gates followed by an inversion gate are applied, and the survival probability decays exponentially with sequence length at a rate determined by the average gate infidelity. Interleaved randomized benchmarking extends the protocol to characterize individual gate errors.[1]
- Algorithm: Clifford randomized benchmarking protocol
- Category: other
- Framework: Qiskit, Cirq, pyGSTi
- Hardware: All quantum platforms
- Reproducible: Yes
- Published:
- gate-fidelity
- Clifford
- error-rate
- QCVV
- standardization
What algorithm does Randomized Benchmarking (Gate Fidelity) use?
Randomized Benchmarking (Gate Fidelity) uses the Clifford randomized benchmarking protocol algorithm, categorized under other.
Frequently Asked Questions
What is the Randomized Benchmarking (Gate Fidelity) benchmark?
The standard protocol for estimating average gate error rates in quantum processors, developed by Magesan, Gambetta, and Emerson. Random sequences of Clifford gates followed by an inversion gate are applied, and the survival probability decays exponentially with sequence length at a rate determined by the average gate infidelity. Interleaved randomized benchmarking extends the protocol to characterize individual gate errors.
Is Randomized Benchmarking (Gate Fidelity) reproducible?
Yes, this benchmark is reproducible.