Fully Scalable Randomized Benchmarking Without Motion Reversal
Open accessPublished version of a preprint
Abstract
We introduce , a protocol that streamlines traditional RB by using circuits consisting almost entirely of independent identically distributed (IID) layers of gates. BiRB reliably and efficiently extracts the average error rate of a Clifford gate set by sending tensor-product eigenstates of random Pauli operators through random circuits with IID layers. Unlike existing RB methods, BiRB does not use motion reversal circuits—i.e., circuits that implement the identity (or a Pauli) operator—which simplifies both the method and the theory proving its reliability. Furthermore, this simplicity enables scaling BiRB to many more qubits than the most widely used RB methods. Published by the American Physical Society 2024
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Reference 98 introduced circuits with random Clifford layers as a scalable system-level benchmark called binary randomized benchmarking.
“Reference 98 introduced circuits with random Clifford layers as a scalable system-level benchmark called binary randomized benchmarking.”
From A 98-qubit trapped-ion quantum computer with all-to-all connectivity (2026) · cites this paper as [98]
Cites
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733 · see citing works
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704 · see citing works
Scalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502 · see citing works
Characterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M., & Emerson, J. (2012) · Physical Review A · doi:10.1103/physreva.85.042311 · Cited by 464 · see citing works
Direct Fidelity Estimation from Few Pauli Measurements
Flammia, S. T., & Liu, Y.-K. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.230501 · Cited by 449 · see citing works
Three-Qubit Randomized Benchmarking
McKay, D. C., Sheldon, S., Smolin, J. A., Chow, J. M., & Gambetta, J. M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.200502 · Cited by 156 · see citing works
Measuring the capabilities of quantum computers
Proctor, T., Rudinger, K., Young, K., Nielsen, E., & Blume-Kohout, R. (2022) · Nature Physics · doi:10.1038/s41567-021-01409-7 · Cited by 146 · see citing works
Self-citationDirect Randomized Benchmarking for Multiqubit Devices
Proctor, T. J., Carignan-Dugas, A., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.030503 · Cited by 118 · see citing works
Self-citationScalable Randomized Benchmarking of Quantum Computers Using Mirror Circuits
Proctor, T., Seritan, S., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.150502 · Cited by 68 · see citing works
Self-citationLimitations of Linear Cross-Entropy as a Measure for Quantum Advantage
Gao, X., Kalinowski, M., Chou, C.-N., Lukin, M. D., Barak, B., & Choi, S. (2021) · arXiv · doi:10.48550/arxiv.2112.01657 · Cited by 54 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
A 98-qubit trapped-ion quantum computer with all-to-all connectivity
Ransford, A., Allman, M. S., Arkinstall, J., Campora, J. P., Cooper, S. F., Delaney, R. D., Dreiling, J. M., Estey, B., Figgatt, C., Hall, A., et al. (2026) · Nature · doi:10.1038/s41586-026-10676-4 · Cited by 16 · see citing works
“Reference 98 introduced circuits with random Clifford layers as a scalable system-level benchmark called binary randomized benchmarking.”
Self-citation
- Authors
- Hines, J., Hothem, D., Blume-Kohout, R., Whaley, B., & Proctor, T.
- Affiliations
- Sandia National Laboratories California (US)
- University of California
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2024-08-15
- Volume
- 5
- Issue
- 3
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W4401611924
- Cited by
- 12
- References
- 10
- Citations by year
- 2026: 3 · 2025: 7 · 2024: 2
- FWCI
- 1.77
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- PRX Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy
- Office of Science
- Office of Advanced Scientific Computing Research
- Laboratory Directed Research and Development
- Sandia National Laboratories
- Office of the Director of National Intelligence
- Intelligence Advanced Research Projects Activity
- Quantum Testbed Pathfinder
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- randomized benchmarking, Clifford gates, average gate fidelity, motion reversal, qubit scalability
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
