Component-level benchmarks
Characterize individual gates, qubits, and operations in isolation: error rates, coherence, and calibration quality. Home of the randomized benchmarking family.
-
Streamlined, fully scalable RB that drops motion reversal entirely: circuits of i.i.d. random layers act on a random Pauli eigenstate, and each shot returns a simple pass/fail outcome.
-
Uses group character theory to isolate clean exponential decays, extending randomized benchmarking to gate sets that form groups beyond the multi-qubit Cliffords.
-
Pauli-twirled decay protocol that measures the process fidelity of an entire cycle of parallel gates at once, scaling to whole devices where interleaved benchmarking cannot.
-
Deterministic single-qubit protocol that separates coherent from incoherent gate errors with a handful of fixed two-pulse sequences instead of the random circuits of RB.
-
Benchmarks random layers of native gates directly instead of compiled multi-qubit Cliffords, measuring gates as they are actually used and scaling well beyond standard RB.
-
Estimates the error of one specific quantum gate by interleaving it between random Cliffords and comparing the resulting decay against a reference randomized benchmarking curve.
-
Modified randomized benchmarking that tracks population escaping the computational subspace, separating per-gate leakage and seepage rates from ordinary computational error.
-
Scalable RB-style protocol that scores the continuous family of matchgate (XY-type, fermionic-simulation) gates by fitting decays of correlation functions over random matchgate circuits.
-
IBM's randomized-benchmarking suite that quantifies the error a mid-circuit measurement adds to the measured qubit and the dephasing and crosstalk it inflicts on unmeasured spectator qubits.
-
Scalable RB variant built from mirror circuits (motion-reversal sequences with random Pauli layers) that avoids compiling expensive inversion gates and extends layer-error estimates to many-qubit widths.
-
Estimates average gate error from the exponential decay of survival probability over increasingly long random Clifford sequences, robust to state-preparation and measurement errors.
-
Runs randomized benchmarking on several subsystems at once and compares with isolated runs, turning the difference in decay rates into a direct measure of crosstalk and addressability.
-
Reads the decoherence-limited fidelity of a gate straight out of cross-entropy benchmarking data by estimating state purity from the speckle contrast of measured bitstring probabilities.
-
Randomized-benchmarking variant that fits the decay of output-state purity to measure how coherent a gate set's noise is, splitting error budgets into miscalibration and decoherence.