Quantum Volume, XEB & Holistic Benchmarks
Single numbers for whole machines, and their caveats.
How do you summarize a whole quantum computer in one number? Quantum volume and cross-entropy benchmarking both run random circuits and compare the output with a classical simulation. Both rest on a striking fact about random quantum states, the Porter–Thomas distribution, and both stop working exactly where quantum computers become interesting: when the circuits can no longer be simulated.
What you’ll learn
- Define quantum volume precisely: model circuits, heavy outputs, and the criterion with its confidence requirement.
- Derive the ideal heavy-output probability from Porter–Thomas statistics, and the fidelity threshold .
- Define linear cross-entropy fidelity, show that it estimates circuit fidelity under depolarizing noise, and connect it to random-circuit-sampling experiments.
- Explain layer fidelity and volumetric benchmarks, and articulate the caveats of single-number benchmarks.
Quantum volume
Quantum volume (Cross, Bishop, Sheldon, Nation & Gambetta 2019) asks: what is the largest square random circuit, with as many layers as qubits, that a device runs well? It probes gates, connectivity, crosstalk and the compiler all at once.
Porter–Thomas statistics: for Haar-random (or sufficiently deep random) circuits, the rescaled output probabilities are exponentially distributed.
The median output has probability .
Weight each output by its own probability: the heavy half of the strings carries most of the mass.
A perfect device approaches ; a completely depolarized one, sampling uniformly, gets exactly .
What it takes to pass
Model the noise crudely as global depolarization: the device outputs the ideal distribution with probability , the circuit fidelity, and uniformly random strings otherwise.
Heavy-output probability under global depolarization.
The circuit fidelity must exceed about 48%.
If two-qubit gate errors dominate: each block compiles into three CNOTs (or CZs), and there are blocks, before counting any routing SWAPs.
Assume all-to-all connectivity, perfect single-qubit gates and readout, and two-qubit error . Using with and the threshold (so ), what is the largest width that passes?
Show the answer
15 qubits
gives , so and in this idealized model. With exact counts, has and , while has and . Sparse connectivity, crosstalk and the confidence requirement all push the real number down.
The model explains several features of reported quantum volumes. Because grows like , each extra qubit of width demands a lower error rate, roughly . All-to-all connectivity avoids routing overhead, which is one reason trapped-ion machines have reported the largest quantum volumes. And because the heavy set must be computed classically for each circuit, quantum volume can only be certified at widths that can be simulated, a few tens of qubits.
Cross-entropy benchmarking
Cross-entropy benchmarking (XEB) scores samples from a random circuit by how probable they are under the ideal distribution (Boixo et al. 2018; Arute et al. 2019).
Expected score of a globally depolarized device.
Using .
For Haar-random each has second moment ; random circuits of sufficient depth approximate this.
A random circuit contains 400 two-qubit gates, each with error ; everything else is perfect. Under the digital error model , what XEB fidelity do you expect, in percent?
Show the answer
13.5 %
. Fidelity decays exponentially with the number of gates, which is why XEB values for large experiments are tiny, though still statistically resolvable with millions of samples.
Layer fidelity, volumetric benchmarks, and their limits
Quantum volume and XEB stop scaling when simulation does. Benchmarks for hundreds of qubits avoid simulating the full circuit.
A 100-qubit chain has 99 two-qubit gates in its layers and a measured layer fidelity of . What is the error per layered gate?
- about
Show the answer
C. about
. Equivalently, a product of 99 factors of about is about .
| Benchmark | Scales to | Needs classical simulation? | Main blind spot |
|---|---|---|---|
| Quantum volume | tens of qubits | yes | one circuit shape; saturates at simulable sizes |
| Linear XEB | tens of qubits (directly) | yes | assumes depolarizing-like noise |
| Layer fidelity / EPLG | hundreds of qubits | no | specific layers; a Pauli-twirled average |
| Mirror-circuit and volumetric benchmarks | hundreds of qubits | no | the choice of circuit family |
| Application benchmarks | varies | sometimes | depend on compiler and problem instance |
Key takeaways
- Quantum volume is for the largest width at which depth- random model circuits produce heavy outputs more than of the time, with confidence.
- Porter–Thomas statistics give an ideal heavy-output probability ; under global depolarization, passing requires circuit fidelity above .
- Linear XEB, , estimates circuit fidelity when noise is depolarizing-like; Sycamore's 2019 experiment reported about at 53 qubits.
- Layer fidelity and mirror-circuit benchmarks scale to hundreds of qubits without simulation; every single number hides structure and can be optimized for.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
For an ideal device running large random model circuits, the heavy-output probability approaches
Show the answer
D.
Porter–Thomas statistics give . The bar sits between this and the uniform value .
A sampler ignores the circuit and outputs uniformly random -bit strings. Its expected linear XEB fidelity is
Show the answer
A.
For uniform , , so .
Why can quantum volume not be measured with 100-qubit, depth-100 model circuits?
- Because Haar-random gates cannot be compiled on hardware
- Because deciding which outputs are heavy requires classically computing the ideal output distribution
- Because the threshold becomes unreachable at large even for an ideal device
- Because quantum volume is only defined up to 64 qubits
Show the answer
B. Because deciding which outputs are heavy requires classically computing the ideal output distribution
The heavy set is defined by the median of , which must be computed classically for every circuit; that is infeasible far beyond a few tens of qubits.
Under a global-depolarizing model, what circuit fidelity is needed to pass the heavy-output test at large width?
Show the answer
C.
Solve : .
Further reading
- A. W. Cross, L. S. Bishop, S. Sheldon, P. D. Nation & J. M. Gambetta, "Validating quantum computers using randomized model circuits", Physical Review A 100, 032328 (2019).
- S. Aaronson & L. Chen, "Complexity-theoretic foundations of quantum supremacy experiments", Proceedings of the Computational Complexity Conference (CCC) (2017).
- S. Boixo et al., "Characterizing quantum supremacy in near-term devices", Nature Physics 14, 595 (2018); F. Arute et al., "Quantum supremacy using a programmable superconducting processor", Nature 574, 505 (2019).
- D. C. McKay et al., "Benchmarking quantum processor performance at scale", preprint (2023).
- R. Blume-Kohout & K. C. Young, "A volumetric framework for quantum computer benchmarks", Quantum 4, 362 (2020).