Randomized Benchmarking

Ask an experimentalist how good their quantum gates are and you have asked a surprisingly slippery question. The honest answer is a whole channel — a $d^2\times d^2$ matrix of numbers describing exactly how every input state is corrupted — and reconstructing it by process tomography costs a number of measurements that explodes with the number of qubits and, worse, folds in the very state-preparation and measurement (SPAM) errors you were trying to see past. Randomized benchmarking is the elegant escape. It refuses to reconstruct the channel and instead extracts one operationally meaningful number, the average error per gate, from the way a single survival probability decays as random gate sequences are made longer. This article is the deep-tier synthesis of the noise-characterization thread. It takes the CPTP-map framework from aq-qci-cptp-maps-quantum-operations, the operator-sum picture from aq-qci-kraus-representation-q9, and the single-parameter geometry of aq-qci-depolarizing-channel and aq-qci-pauli-bit-phase-flip-channels, and assembles from them the protocol that now headlines nearly every quantum-hardware announcement. The mathematical engine is twirling: averaging an arbitrary error channel over the Clifford group — a unitary $2$ -design — symmetrizes it into a depolarizing channel described by a single number $p$ . Compose one such channel per gate and the survival probability collapses to a clean exponential $A\,p^{m}+B$ . The masterstroke is the closing move: the last gate is chosen to invert the whole random sequence, so in a noiseless world the system returns exactly home and any failure to return is pure accumulated error. That single design choice is what quarantines all SPAM error into the constants $A$ and $B$ , leaving the decay rate $p$ — and hence the fidelity — untouched.

Key takeaways

Randomized benchmarking (RB) estimates the average error per gate by running random Clifford sequences of growing length $m$ , capped by a recovery gate that ideally returns the system to its starting state.
Because the Clifford group is a unitary $2$ -design, twirling the error channel over random Cliffords collapses it to a depolarizing channel with a single parameter $p$ .
The averaged survival probability decays as $F(m)=A\,p^{m}+B$ ; the constants $A,B$ absorb all SPAM error, so the extracted $p$ is SPAM-robust — the defining virtue of RB.
The average gate fidelity is $F_{\mathrm{avg}}=p+(1-p)/d$ and the error rate per Clifford is $r=(1-p)(d-1)/d$ , with $d=2^{n}$ .
Interleaved RB isolates one target gate, purity/unitarity benchmarking separates coherent from incoherent error, and simultaneous RB exposes crosstalk.
The model is exact only for gate-independent, time-independent (Markovian) noise; a non-exponential decay is a physical signal that those assumptions have broken.
Key idea: twirling an arbitrary error channel over the Clifford group (a unitary 2-design) collapses it to a depolarizing channel with one parameter $p$ ; composing $m$ random gates gives a survival decay $A\,p^{m}+B$ whose rate $p$ is immune to SPAM error, from which the average gate fidelity follows.

The core insight

Twirling an arbitrary error channel over a unitary $2$ -design (the Clifford group) collapses it to a depolarizing channel with a single parameter $p$ ; composing $m$ random gates gives a survival-probability decay $A\,p^{m}+B$ whose rate $p$ is immune to SPAM errors, from which the average gate fidelity follows.

Where this lives today

Randomized benchmarking is the currency of gate-quality reporting. Every serious superconducting, trapped-ion, and spin-qubit platform quotes RB numbers: single-qubit Clifford errors in the $10^{-3}$ – $10^{-4}$ range and two-qubit errors in the $10^{-2}$ – $10^{-3}$ range are the modern baseline, and interleaved RB is the accepted way to certify a specific CZ or CNOT. Google's 2019 supremacy experiment reported per-gate errors from exactly this family of protocols — single-qubit around $0.16\%$ , two-qubit around $0.6\%$ in isolation and higher when neighbors run simultaneously, a gap that simultaneous RB is designed to quantify as crosstalk. IBM now folds RB-style measurements into layer-level metrics such as error per layered gate (EPLG) to capture how a whole device performs under parallel load. Alongside RB sits cross-entropy benchmarking (XEB), a cousin that also uses random circuits but reads out a distribution's fidelity rather than a survival probability, and gate-set tomography, which trades RB's efficiency for a full self-consistent reconstruction when you need to know what the error is, not just how big. The live theoretical frontier is noise that violates RB's founding assumptions: gate-dependent and non-Markovian error, where the clean exponential can deform, and where a careful representation-theoretic analysis is needed to say what $p$ still means. That the protocol keeps earning its place — from a daily calibration check to the headline number in a device announcement — is a testament to the one structural idea at its core: randomize, then invert, and let SPAM fall away.

The physical picture

Picture a fixed but unknown error sitting after each gate. On its own that error is lopsided — it might barely touch states near the poles of the Bloch sphere while badly corrupting those on the equator. Randomized benchmarking refuses to let the error keep any preferred direction. By sandwiching it between uniformly random Cliffords, every application points the error along a fresh, randomly chosen axis, and the average over the group washes out all directional structure. What survives is an isotropic "fog" — a depolarizing channel that shrinks the Bloch vector by the same factor no matter which way it points. After $m$ gates the fog has depth $p^{m}$ , and watching how the visibility of the starting state fades with depth reads off the per-gate error. The recovery gate is the quiet genius of the protocol. Each random Clifford is classically tracked, and the final gate is set to the inverse of their product, so the ideal sequence is the identity and lands the system exactly back where it started. Any shortfall in the returned ground-state population is therefore entirely accumulated gate error. This is why SPAM can only rescale the picture, never tilt it: a mis-focused camera (readout error) or a slightly wrong starting position (preparation error) changes the brightness $A$ and the floor $B$ of the fading image, but the rate at which it fades is fixed by the gates alone. The first figure shows both halves of this story — the random-then-invert circuit, and the twirl that turns a lopsided error into isotropic fog.

Figure

A random benchmarking sequence of m Cliffords capped by a recovery gate whose ideal product is the identity, alongside the twirl that averages an arbitrary lopsided error Λ over the Clifford group into an isotropic depolarizing channel D_p with a single parameter p

The exponential shape is not an approximation adopted for convenience — it is the exact mathematical consequence of the $2$ -design property combined with Markovian, gate-independent noise. When the measured data refuses to sit on a single exponential, that refusal is physics, not statistical noise: it is telling you the error has memory (non-Markovian) or depends on which gate was applied. The second figure is the object an experimentalist actually fits: an averaged survival curve, with the fitted decay $p$ converted into the two numbers that get quoted — the average error per Clifford $r$ and the average gate fidelity $F_{\mathrm{avg}}$ .

Figure

Randomized benchmarking decay for a single qubit: the averaged survival probability F(m) = A pᵐ + B fitted with p = 0.998 falls from A + B = 1 toward the SPAM floor B = 0.5, giving average error per Clifford r = (1−p)(d−1)/d = 0.001 and average gate fidelity F_avg = p + (1−p)/d = 0.999

The core equations

The observable is a single decay. One prepares an initial state, applies $m$ uniformly random Cliffords followed by the recovery gate, measures the survival probability, and averages over many random sequences and over $m$ . Under gate-independent, Markovian noise the result is exactly a single exponential plus an offset.

F(m) = A\,p^{\,m} + B \qquad (1)

where: $F(m)$ — averaged survival probability (ground-state population) for sequences of $m$ random Cliffords; $m$ — number of random Cliffords before the recovery gate; $p$ — depolarizing parameter of the twirled error channel; $A,\,B$ — SPAM-dependent constants absorbing preparation and measurement error. Reading it: the physics of the gates lives only in the base $p$ ; everything about how you prepared and read out the qubit is quarantined in $A$ and $B$ . The reason a single number suffices is that twirling turns any error into a depolarizing channel, which is the one-parameter family that shrinks every Bloch vector by the same factor toward the maximally mixed state.

\mathcal{D}_p(\rho) = p\,\rho + (1-p)\,\frac{\mathbb{1}}{d} \qquad (2)

where: $\rho$ — input density operator; $d=2^{n}$ — Hilbert-space dimension for $n$ qubits; $\mathbb{1}/d$ — maximally mixed state; $p$ — probability weight on the input (depolarizing parameter). At $p=1$ the channel is the identity; at $p=0$ it erases the state to $\mathbb{1}/d$ . The bridge from "arbitrary error" to "depolarizing" is the twirl: average the conjugated channel over the group. Because the Clifford group is a unitary $2$ -design, this uniform average equals the Haar average, which is provably depolarizing.

\bar{\Lambda}(\rho) = \frac{1}{|\mathrm{Cl}|}\sum_{U\in\mathrm{Cl}} U^{\dagger}\,\Lambda\!\big(U\rho U^{\dagger}\big)\,U = \mathcal{D}_p(\rho) \qquad (3)

where: $\Lambda$ — arbitrary CPTP error channel; $U$ — Clifford unitary, summed uniformly over the group $\mathrm{Cl}$ ; $|\mathrm{Cl}|$ — group order; $\bar{\Lambda}$ — twirled channel, provably of depolarizing form. The twirl integrand is quadratic in $U$ (one $U$ , one $U^{\dagger}$ ), which is exactly why the second moment — the $2$ -design property — is all that is needed. The decay rate is converted into the headline figure of merit by computing the average fidelity of the depolarizing channel to the identity, integrated over pure input states.

F_{\mathrm{avg}} = \int \mathrm{d}\psi\; \langle\psi|\,\mathcal{D}_p\!\big(|\psi\rangle\langle\psi|\big)\,|\psi\rangle = p + \frac{1-p}{d} \qquad (4)

where: $F_{\mathrm{avg}}$ — average gate fidelity; $|\psi\rangle$ — pure input state integrated over the uniform Fubini–Study measure; $p$ — RB decay parameter. The integral is trivial because the depolarizing overlap is state-independent — a hallmark of the twirled form. The number physicists actually quote is the complementary error rate — the average infidelity per Clifford.

r = 1 - F_{\mathrm{avg}} = \frac{(1-p)(d-1)}{d} \qquad (5)

where: $r$ — average error rate per gate (infidelity); $d-1$ — dimension factor; $p$ — RB decay parameter. For one qubit ( $d=2$ ) this is simply $r=(1-p)/2$ . To pin the error of a specific gate rather than the group average, interleaved RB runs a second sequence with the target gate inserted between every random Clifford and compares the two decays.

r_{\overline{\mathcal{G}}} = \frac{d-1}{d}\left(1 - \frac{p_{\overline{\mathcal{G}}}}{p}\right) \qquad (6)

where: $r_{\overline{\mathcal{G}}}$ — estimated error of the interleaved gate $\mathcal{G}$ ; $p_{\overline{\mathcal{G}}}$ — decay of the interleaved sequence; $p$ — decay of the reference sequence. The ratio $p_{\overline{\mathcal{G}}}/p$ isolates the extra depolarization contributed by $\mathcal{G}$ . Finally, RB's average infidelity is bounded against the worst-case error that matters for fault tolerance — the diamond distance — but only loosely, which is a crucial caveat.

r \le \lVert \mathcal{E} - \mathcal{I} \rVert_{\diamond} \le \sqrt{d(d+1)\,r} \qquad (7)

where: $\lVert\cdot\rVert_{\diamond}$ — diamond-norm distance from the identity channel (worst-case error); $r$ — RB average error rate; $\mathcal{E},\mathcal{I}$ — the actual error and identity channels. The square-root upper bound means RB can be quadratically optimistic about worst-case error when the noise is coherent.

Derivation ATwirling collapses any channel to a depolarizing channel

The goal of this derivation is to prove the central lemma that makes randomized benchmarking possible: averaging an arbitrary completely-positive trace-preserving map over a unitary $2$ -design produces a depolarizing channel described by a single parameter. We work in the space of operators under the adjoint (conjugation) action of the group, decompose that space into its irreducible pieces, apply Schur's lemma to force the twirled map to be a scalar on each piece, and let trace preservation fix one of the two scalars — leaving exactly the one free parameter $p$ that RB measures.

Step 1. Establish covariance. The twirl $\bar{\Lambda}(\rho)=\frac{1}{|\mathrm{Cl}|}\sum_U U^{\dagger}\Lambda(U\rho U^{\dagger})U$ satisfies $\bar{\Lambda}(V\rho V^{\dagger})=V\,\bar{\Lambda}(\rho)\,V^{\dagger}$ for every group element $V$ , by re-indexing the sum $U\to UV$ . Why: this says the averaged map commutes with conjugation by the whole group, so it "sees" no preferred basis — the structural fact that all of Schur's-lemma reasoning rests on.

Step 2. Decompose the operator space. Under conjugation the $d^{2}$ -dimensional space of operators splits into two invariant subspaces: the one-dimensional span of the identity $\mathbb{1}$ , and the $(d^{2}-1)$ -dimensional space of traceless operators. Both are irreducible for a $2$ -design because the design reproduces the second Haar moment that governs this action. Why: it is precisely the $2$ -design property — matching Haar up to second moments — that guarantees the traceless block stays irreducible, which is what corrals the answer down to one parameter.

Step 3. Apply Schur's lemma. A linear map that commutes with an irreducible representation is a scalar multiple of the identity on that block, so $\bar{\Lambda}=\alpha\,\Pi_{\mathbb{1}}+\beta\,\Pi_{\perp}$ , with $\Pi_{\mathbb{1}}$ and $\Pi_{\perp}$ the projectors onto the identity and traceless subspaces. Why: two irreducible blocks give at most two scalars $\alpha,\beta$ — the map cannot mix or reshape within a block, so a general channel of $d^{4}$ parameters is crushed to two.

Step 4. Fix $\alpha$ by trace preservation. Because $\Lambda$ is trace-preserving, so is $\bar\Lambda$ ; acting on $\mathbb{1}$ (the trivial block) must return $\mathbb{1}$ , forcing $\alpha=1$ . Writing $\beta\equiv p$ on the traceless block and reassembling gives $\bar\Lambda(\rho)=p\,\rho+(1-p)\,\mathbb{1}/d$ — the depolarizing channel. Why: trace preservation is not optional for a physical channel, and it spends one of the two scalars, leaving the single depolarizing parameter $p$ as the only survivor.

Step 5. Tie $p$ to the fidelity. Computing the average fidelity of $\mathcal{D}_p$ and inverting gives $p=(d\,F_{\mathrm{avg}}-1)/(d-1)$ , closing the loop between the abstract parameter and the RB observable. Why: this dictionary is what lets a measured decay rate be reported as a fidelity that a fault-tolerance threshold can be compared against. *Verified: inverting $F_{\mathrm{avg}}=p+(1-p)/d$ gives $p=(dF_{\mathrm{avg}}-1)/(d-1)$ ; for $d=2$ , $F_{\mathrm{avg}}=1\Rightarrow p=1$ and $F_{\mathrm{avg}}=1/2\Rightarrow p=0$ , matching the perfect and fully-depolarizing limits.*

Go deeper · Derivation B · 1 minThe single-exponential decay and why SPAM cannot bias it

Derivation BThe single-exponential decay and why SPAM cannot bias it

The aim here is to derive the fit model $F(m)=A\,p^{m}+B$ from the ground up and, in the same motion, to prove the property that makes RB worth doing at all — that state-preparation and measurement error enter only the prefactor $A$ and the offset $B$ , never the decay rate $p$ . We build the averaged sequence superoperator, use the twirling lemma to reduce it to a power of a depolarizing channel, and then read out with an imperfect measurement to see exactly where the SPAM error lands.

Step 1. Write the noisy sequence. With ideal Cliffords $\mathcal{C}_i$ and a fixed gate-independent error $\Lambda$ after each, one sequence is $S=\prod_{i=1}^{m+1}(\Lambda\circ\mathcal{C}_i)$ , where $\mathcal{C}_{m+1}$ is the recovery gate making the ideal product the identity. Why: attaching the same $\Lambda$ to every gate is the Markovian, gate-independent assumption in operator form — it is what will let the average factorize.

Step 2. Average over the random Cliffords. Uniformly averaging the interior Cliffords twirls each interior $\Lambda$ , and using the lemma the averaged sequence becomes $\bar{S}=\Lambda\circ(\mathcal{D}_p)^{m}$ , with the final error folded into an overall SPAM-like factor. Why: the twirl converts the intractable product of random unitaries and unknown errors into $m$ identical depolarizing channels — the whole point of randomizing.

Step 3. Collapse the depolarizing power. Depolarizing channels compose by multiplying their parameters, $(\mathcal{D}_p)^{m}=\mathcal{D}_{p^{m}}$ , so the averaged state is $p^{m}\hat\rho+(1-p^{m})\mathbb{1}/d$ acting on the post-preparation state $\hat\rho=\Lambda(\rho_0)$ . Why: this single line is where the exponential $p^{m}$ is born — it is the semigroup property of the depolarizing family.

Step 4. Read out with an imperfect effect $E$ . Taking $F(m)=\mathrm{Tr}[E\,\bar S(\rho_0)]$ gives $F(m)=p^{m}\,\mathrm{Tr}[E\hat\rho]+(1-p^{m})\tfrac{1}{d}\mathrm{Tr}[E]$ , so $A=\mathrm{Tr}[E\hat\rho]-\tfrac{1}{d}\mathrm{Tr}[E]$ and $B=\tfrac{1}{d}\mathrm{Tr}[E]$ . Why: every appearance of the imperfect $E$ (readout) and imperfect $\hat\rho$ (preparation) is confined to $A$ and $B$ — the exponent $p^{m}$ never meets them, which is the SPAM robustness in one equation. *Verified: for perfect SPAM ( $E=|0\rangle\langle0|$ , $\hat\rho=|0\rangle\langle0|$ , $d=2$ ): $A=1-\tfrac12=\tfrac12$ , $B=\tfrac12$ , so $F(0)=1$ and $F(\infty)=\tfrac12$ , the correct noiseless-prep endpoints seen in the decay figure.*

Go deeper · Derivation C · 1 minFrom the decay parameter to a physical gate error

Derivation CFrom the decay parameter to a physical gate error

This derivation turns the fitted number $p$ into the quantities an engineer needs — the average gate fidelity, the error per Clifford, and, with one more input, the error per physical pulse. The route is to evaluate the average fidelity of the depolarizing channel that the twirl produced, invert nothing, and then account for the fact that each Clifford is compiled from more than one native gate, which is the last mile between an abstract $r$ and a hardware error budget.

Step 1. Apply the depolarizing channel to a pure state: $\mathcal{D}_p(|\psi\rangle\langle\psi|)=p\,|\psi\rangle\langle\psi|+(1-p)\,\mathbb{1}/d$ . Why: the RB decay measures the action of this channel per step, so its fidelity to the identity is exactly what the protocol reports.

Step 2. Take the overlap with the input, $\langle\psi|\mathcal{D}_p(|\psi\rangle\langle\psi|)|\psi\rangle=p+(1-p)/d$ , using $\langle\psi|\mathbb{1}/d|\psi\rangle=1/d$ for any normalized $\psi$ . Why: the maximally mixed contribution is the same in every direction, which is why the state average is trivial and the fidelity is a clean function of $p$ and $d$ .

Step 3. Read off $F_{\mathrm{avg}}=p+(1-p)/d$ and $r=1-F_{\mathrm{avg}}=(1-p)(d-1)/d$ . Why: these are the two headline numbers; for a single qubit $r=(1-p)/2$ , so a decay $p=0.998$ is an error of $0.001$ per Clifford.

Step 4. Convert to per-gate error. Each Clifford is compiled from an average of $N_g$ native gates ( $N_g\approx1.875$ for the standard single-qubit generating set), and to leading order errors add, so the error per physical gate is $r_{\mathrm{gate}}\approx r/N_g$ . Why: RB benchmarks Cliffords, but datasheets quote gates — dividing by the average compilation depth is the standard, if approximate, bridge between the two. *Verified: $p=0.998,\ d=2\Rightarrow F_{\mathrm{avg}}=0.999,\ r=1.0\times10^{-3}$ , and $r/1.875=5.3\times10^{-4}$ per physical gate — consistent with the single-qubit worked example.*

Limiting cases

Case	Result	Meaning
Perfect gates	$p\to1,\ r\to0,\ F_{\mathrm{avg}}\to1$	no depolarization; the survival curve is flat at $A+B$ , the SPAM-limited maximum.
Fully depolarizing per gate	$p\to0,\ F_{\mathrm{avg}}\to1/d$	one gate randomizes the state; the curve drops immediately to the floor $B=1/d$ .
Weak incoherent noise	$r\approx\tfrac{d-1}{d}(1-p)$	for small errors $r$ is just the infidelity — the regime in which RB numbers are quoted.
Pure coherent over-rotation $\theta$	$r\sim\tfrac{d-1}{2d}\theta^{2},\ \lVert\mathcal{E}-\mathcal{I}\rVert_{\diamond}\sim\theta$	RB sees only $\theta^{2}$ , so it is quadratically optimistic versus worst-case error.
Two qubits	$d=4,\ r=\tfrac34(1-p)$	the same formula with the larger dimension factor; entangling-gate benchmarks live here.

Common trapRB measures the fidelity of one named gate, and its number is the worst-case error

Both readings are wrong, and both cause real mistakes. First, standard RB reports an average over the entire Clifford group, not the fidelity of any single gate — to certify a specific gate you must run interleaved RB, and even that carries systematic bounds because the interleaved and reference errors do not perfectly factor. Second, the RB error rate $r$ is an average infidelity, not the worst-case (diamond-norm) error that fault-tolerance thresholds are stated against; the two are related only by the loose bound $r\le\lVert\mathcal{E}-\mathcal{I}\rVert_{\diamond}\le\sqrt{d(d+1)\,r}$ . When the noise is coherent — a systematic over-rotation — RB is quadratically optimistic, because it sees $\theta^{2}$ while the worst-case error scales as $\theta$ . Two devices with identical RB numbers can therefore behave very differently under composition: a $1\%$ coherent error accumulates linearly while a $1\%$ stochastic error grows like a random walk. And all of it presumes gate-independent, time-independent (Markovian) noise; a decay that is not a clean single exponential is the data warning you that this assumption has failed.

Worked examples

1 · Single-qubit RB, fully worked

A single-qubit RB experiment fits the averaged survival data to $F(m)=A\,p^{m}+B$ and returns $p=0.998$ , with $A=0.49$ and $B=0.50$ reflecting a few-percent SPAM error. Find the average gate fidelity, the error per Clifford, the predicted survival at $m=100$ , and the approximate error per physical gate.

Step 1. Convert the decay to a fidelity. With $d=2$ , $F_{\mathrm{avg}}=p+(1-p)/d=0.998+0.002/2=\mathbf{0.999}$ . The gates are $99.9\%$ average-fidelity operations. Note that only $p$ entered — $A$ and $B$ played no role, which is the SPAM robustness in action.

Step 2. Error per Clifford. $r=(1-p)(d-1)/d=(0.002)(1)/2=\mathbf{1.0\times10^{-3}}$ . This is the average infidelity contributed by one random Clifford, and it is the number that would headline a device report.

Step 3. Predict a survival point. At $m=100$ , $p^{100}=0.998^{100}=0.8186$ , so $F(100)=0.49\times0.8186+0.50=0.4011+0.50=\mathbf{0.9011}$ . The prediction uses the fitted SPAM constants $A,B$ — those are needed to reproduce the raw curve even though they were irrelevant to the fidelity.

Step 4. Error per physical gate. Each single-qubit Clifford compiles to an average of $N_g\approx1.875$ native $\pi/2$ -type pulses, so $r_{\mathrm{gate}}\approx r/N_g=1.0\times10^{-3}/1.875=\mathbf{5.3\times10^{-4}}$ . The gate is $99.9\%$ fidelity per Clifford, about $5.3\times10^{-4}$ error per physical pulse — comfortably below the surface-code threshold near $10^{-2}$ .

2 · Interleaved RB for a two-qubit CZ gate

A two-qubit reference RB run returns $p=0.98$ ; interleaving a target CZ gate between every random Clifford drops the decay to $p_{\overline{\mathcal{G}}}=0.965$ . Estimate the CZ error rate and compare it to the average two-qubit Clifford error.

Step 1. Set the dimension. Two qubits give $d=2^{2}=4$ , so the dimension factor is $(d-1)/d=3/4$ .

Step 2. Reference Clifford error. $r_{\mathrm{ref}}=(1-p)(d-1)/d=(0.02)(3/4)=\mathbf{1.5\times10^{-2}}$ — the average two-qubit Clifford carries about $1.5\%$ error.

Step 3. Interleaved estimate. $r_{\overline{\mathcal{G}}}=\tfrac{d-1}{d}\big(1-p_{\overline{\mathcal{G}}}/p\big)=\tfrac34\big(1-0.965/0.98\big)=\tfrac34(1-0.98469)=\tfrac34(0.01531)=\mathbf{1.15\times10^{-2}}$ . The CZ gate contributes about $1.1\%$ error on its own — the dominant slice of the reference Clifford budget, which is why two-qubit gates, not single-qubit gates, are the fidelity bottleneck. In practice this point estimate is bracketed by systematic bounds of order $r_{\mathrm{ref}}$ arising because the reference and interleaved noise do not perfectly compose.

Physics of the portrait

Randomized benchmarking is a young idea with a clean lineage: a way to hide from SPAM error and from the exponential cost of tomography by measuring not a channel but the rate at which a random walk forgets where it started.

Origins · 1 minrandomized benchmarking and how this was discovered

randomized benchmarking

the twirl p = (d F_avg − 1)/(d − 1) turning arbitrary noise into one number · scalable, SPAM-robust gate characterization

Randomized benchmarking grew out of a simple frustration: process tomography, the textbook way to characterize a quantum operation, scales exponentially in the number of qubits and cannot separate gate error from the errors in preparing and measuring the qubits. The escape was proposed in 2005 by Joseph Emerson, Robert Alicki, and Karol Życzkowski, who showed that averaging — twirling — an unknown channel over random unitaries reduces it to a depolarizing channel whose single parameter can be read from an exponential decay, a "scalable noise estimation with random unitary operators." In 2008 Emanuel Knill and collaborators at NIST turned the idea into a concrete, practical protocol on trapped-ion qubits, using random Clifford sequences and a recovery gate. The decisive theoretical step came in 2011, when Easwar Magesan, Jay Gambetta, and Joseph Emerson proved that under gate-independent Markovian noise the averaged survival probability is exactly a single exponential $A\,p^{m}+B$ , and — crucially — that the SPAM error is confined to $A$ and $B$ , making $p$ a robust, self-calibrating figure of merit. The following year the same group introduced interleaved RB to certify individual gates, and by the mid-2010s the framework had branched into purity/unitarity benchmarking (separating coherent from incoherent error), simultaneous RB (crosstalk), and character/cycle benchmarking (relaxing the assumptions). Later work by Wallman, Merkel, and others closed the theoretical gap for gate-dependent noise, showing the exponential survives as the leading behavior. What began as a trick to dodge tomography is now the standard by which the whole field reports gate quality.

History

2005

— Emerson, Alicki, and Życzkowski propose scalable noise estimation by twirling over random unitaries

2008

— Knill and collaborators demonstrate randomized benchmarking of quantum gates on trapped ions

2011

— Magesan, Gambetta, and Emerson prove the single-exponential, SPAM-robust RB model

2012

— Magesan and collaborators introduce interleaved RB to measure individual gate errors

2015

— Wallman, Granade, Harper, and Flammia formulate unitarity benchmarking to isolate coherent error

Going further

Texts. Nielsen and Chuang, Quantum Computation and Quantum Information, Ch. 8–9 (quantum operations, fidelity) · Preskill, Lecture Notes for Physics 219, Ch. 3 (quantum channels and fidelity) · Watrous, The Theory of Quantum Information, Ch. 2 (channels, twirling) · Wilde, Quantum Information Theory, Ch. 4 · Kitaev, Shen, Vyalyi, Classical and Quantum Computation (Clifford group and fault tolerance).

Provenance. The decay model $F(m)=A\,p^{m}+B$ , the fidelity relation $F_{\mathrm{avg}}=p+(1-p)/d$ , and the error rate $r=(1-p)(d-1)/d$ are verifiable against Magesan, Gambetta, and Emerson, PRL 106, 180504 (2011) and PRA 85, 042311 (2012); the twirl-to-depolarizing lemma and the $2$ -design property against Emerson, Alicki, and Życzkowski, J. Opt. B 7, S347 (2005) and Nielsen and Chuang Ch. 8. The interleaved-RB formula is from Magesan et al., PRL 109, 080505 (2012); the unitarity/purity framework from Wallman, Granade, Harper, and Flammia, NJP 17, 113020 (2015); the diamond-norm bounds from Wallman and Flammia and from Kueng et al. A verifier should re-derive the depolarizing form via Schur's lemma on the conjugation representation, invert $F_{\mathrm{avg}}(p)$ to recover $p=(dF_{\mathrm{avg}}-1)/(d-1)$ , and confirm the worked numbers: single qubit $p=0.998\Rightarrow F_{\mathrm{avg}}=0.999,\ r=1.0\times10^{-3},\ F(100)=0.9011$ ; two-qubit interleaved $p=0.98,\ p_{\overline{\mathcal{G}}}=0.965\Rightarrow r_{\overline{\mathcal{G}}}=1.15\times10^{-2}$ .

Prerequisites. Quantum Operations and CPTP Maps · Kraus Representation of Quantum Channels · Depolarizing Channel · Pauli and Bit/Phase-Flip Channels. Leads to. Markovian vs Non-Markovian Dynamics · Decoherence · Relaxation and Dephasing: T1 and T2 Times.

Ask the tutor: Ask me to fit an RB decay to $A\,p^{m}+B$ and read off the fidelity, to set up an interleaved-RB estimate for a specific two-qubit gate, or to show how a coherent over-rotation hides from RB but not from the diamond norm.

Does randomized benchmarking tell me which gate in my set is the bad one?

No — not by itself. Standard RB reports a single number averaged over the entire Clifford group, so it is deliberately blind to the identity of any individual gate. If one gate in your compilation is much worse than the others, standard RB folds its error into the average and hands you back one aggregate $r$ . To localize the problem you run interleaved RB, which inserts a chosen target gate between every random Clifford and compares the interleaved decay $p_{\overline{\mathcal{G}}}$ to the reference decay $p$ ; the ratio isolates that gate's contribution. For a complete, self-consistent picture of what each gate's error looks like — coherent versus stochastic, and in which direction — you step up to gate-set tomography, trading RB's efficiency for far more measurements.

Why does SPAM error not bias the RB estimate when it ruins tomography?

Because of the recovery gate. Every RB sequence ends with the inverse of the random gates applied so far, so in the noiseless case the system returns exactly to its starting state. That means the only thing that can pull the survival probability down as sequences grow longer is accumulated gate error — the exponent $p^{m}$ . State-preparation and measurement errors do change the curve, but only by rescaling it (the prefactor $A$ ) and lifting its floor (the offset $B$ ); they cannot alter the rate of decay. Tomography has no such firewall: it estimates the channel from raw measurement statistics, so a biased readout or a mis-prepared state contaminates the reconstructed channel directly and inseparably. RB's whole design is built to make the gate quality the slope of a line that SPAM can only shift, not tilt.

Why must the Clifford group be a unitary 2-design for the argument to work?

The twirl that collapses an arbitrary error to a depolarizing channel is an average of $U^{\dagger}\Lambda(U\rho U^{\dagger})U$ over the group. That integrand contains two copies of the unitary — one $U$ and one $U^{\dagger}$ — so evaluating the average only requires the group to reproduce the Haar measure's second moments. A set of unitaries that matches Haar up to the $t$ -th moment is called a unitary $t$ -design; the Clifford group is a $2$ -design, which is exactly enough. Higher moments are irrelevant to the depolarizing reduction, so nothing is gained by using genuinely Haar-random unitaries — and much is lost, since Haar-random gates cannot be sampled or inverted efficiently, whereas Cliffords can be compiled and their inverse computed classically in polynomial time.

How do I turn the error per Clifford into an error per physical gate?

Divide by the average compilation depth. RB benchmarks Cliffords, but each Clifford is built from several native gates — for the standard single-qubit generating set the average is about $1.875$ physical $\pi/2$ -type pulses per Clifford. To leading order, small errors add, so the error per physical gate is approximately the error per Clifford divided by that number: $r_{\mathrm{gate}}\approx r/N_g$ . For example, a per-Clifford error of $1.0\times10^{-3}$ corresponds to roughly $5.3\times10^{-4}$ per pulse. This is an approximation — it assumes the errors of the constituent gates are similar and roughly independent — but it is the standard bridge between the RB headline number and a hardware error budget. For a specific native gate's error, use interleaved RB instead.

Can RB miss a coherent error, and why does that matter for fault tolerance?

Yes, and this is its most important blind spot. RB is sensitive to the depolarizing parameter, which for a coherent over-rotation by angle $\theta$ scales as $\theta^{2}$ . The worst-case error that fault-tolerance thresholds are actually stated against — the diamond-norm distance — scales as $\theta$ . So a systematic $1\%$ over-rotation might register as a tiny $r\sim10^{-4}$ in RB while contributing a worst-case error a hundred times larger, because RB sees the square of the angle and the diamond norm sees the angle itself. The general statement is the loose bound $r\le\lVert\mathcal{E}-\mathcal{I}\rVert_{\diamond}\le\sqrt{d(d+1)\,r}$ . To detect coherent error you use purity (unitarity) benchmarking, which compares the measured unitarity $u$ to $p^{2}$ : any excess flags coherent structure that could, in principle, be removed by recalibration rather than by improving coherence.

What is purity or unitarity benchmarking, and when do I need it?

It is the RB variant that separates coherent error (systematic, correctable by tuning) from incoherent error (stochastic, decoherence-limited). Standard RB gives you $r$ but cannot say which kind you have — and the two accumulate very differently under composition. Purity benchmarking measures the decay of the output state's purity rather than a survival probability, yielding a second parameter, the unitarity $u$ . For purely stochastic (Pauli) noise $u=p^{2}$ exactly; any measured $u$ exceeding $p^{2}$ is the signature of coherent error, and the size of the gap tells you how much of your error rate could be eliminated by better calibration instead of better hardware. You reach for it when your RB number has plateaued and you need to know whether to keep tuning pulses or to invest in longer coherence times.

Why does a non-exponential decay count as physics rather than bad data?

Because the single-exponential form is not an empirical fit chosen for convenience — it is a theorem. Under gate-independent, time-independent (Markovian) noise, the twirling argument forces the averaged survival probability to be exactly $A\,p^{m}+B$ . So if your carefully averaged data genuinely departs from a single exponential — showing oscillations, a second decay constant, or an initial transient — one of those founding assumptions must be false. Oscillations often mean a coherent, gate-dependent error; a slow second exponential can signal leakage out of the computational subspace; a drifting fit across runs points to non-Markovian environmental memory or calibration drift. The shape of the deviation is diagnostic, which is precisely why RB doubles as a probe of open-system dynamics and connects onward to the theory of non-Markovian noise.