Project: Benchmark a Device Model
You cannot trust a quantum processor you have not characterized. Randomized benchmarking (RB) is the field's standard answer: it measures an average gate error that is robust to state-preparation and measurement (SPAM) errors, by averaging over random Clifford sequences. This capstone builds the fundamental RB primitive — a random sequence plus its exact recovery — whose survival probability is the data point a full RB experiment fits.
The RB protocol
For each sequence length :
- Draw random Clifford gates .
- Append the single recovery Clifford , so the ideal net operation is the identity.
- Run, measure, and record the survival probability .
- Repeat over many random sequences and average.
On a noiseless device every sequence returns the qubit to , giving survival regardless of . On real hardware errors accumulate and the averaged survival decays.
The decay model
Averaging over the Clifford group depolarizes the errors, so the mean survival follows a clean exponential in the sequence length:
where is the depolarizing parameter and absorb SPAM. Fitting yields the average error per Clifford
which is what gets quoted as a device's gate fidelity. Because the form of the decay is fixed and soak up state-prep and readout errors, the extracted isolates gate quality — RB's key advantage over naive process tomography.
A length-3 instance
Take the sequence . Its inverse, applied in reverse with each gate inverted, is (since and ). Concatenated, the circuit is the identity, so a perfect simulator returns survival — the noise-free reference against which a noisy device's decay is measured.
Try it
Build the length-3 sequence and its recovery, then measure. The grader checks the output distribution: all probability on outcome , the ideal survival of .
Sign in on the full site to ask questions and join the discussion.