Multiqubit randomized benchmarking using few samples
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
Randomized benchmarking (RB) is an efficient and robust method to characterize gate errors in quantum circuits. Averaging over random sequences of gates leads to estimates of gate errors in terms of the average fidelity. These estimates are isolated from the state preparation and measurement errors that plague other methods such as channel tomography and direct fidelity estimation. A decisive factor in the feasibility of randomized benchmarking is the number of sampled sequences required to obtain rigorous confidence intervals. Previous bounds were either prohibitively loose or required the number of sampled sequences to scale exponentially with the number of qubits in order to obtain a fixed confidence interval at a fixed error rate. Here, we show that, with a small adaptation to the randomized benchmarking procedure, the number of sampled sequences required for a fixed confidence interval is dramatically smaller than could previously be justified. In particular, we show that the number of sampled sequences required is essentially independent of the number of qubits and scales favorably with the average error rate of the system under investigation. We also investigate the fitting procedure inherent to randomized benchmarking in light of our results and find that standard methods such as ordinary least squares optimization can give misleading results. We therefore recommend moving to more sophisticated fitting methods such as iteratively reweighted least squares optimization. Our results bring rigorous randomized benchmarking on systems with many qubits into the realm of experimental feasibility.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
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
Randomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019 · cited 1×
“It is important to note that this optimality result also holds when RB is performed using a different set of gates than the Clifford group and also when one considers the standard protocol [8,9] as opposed to the protocol involving differences of quantum states which we presented in this paper.”
MethodPrescription for experimental determination of the dynamics of a quantum black box
Chuang, I. L., & Nielsen, M. A. (1997) · Journal of Modern Optics · doi:10.1080/09500349708231894 · Cited by 949
A simple formula for the average gate fidelity of a quantum dynamical operation
Nielsen, M. A. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01272-0 · Cited by 725
Complete Characterization of a Quantum Process: The Two-Bit Quantum Gate
Poyatos, J. F., Cirac, J. I., & Zoller, P. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.390 · Cited by 694 · cited 6×
“with Z = {tr, 1, 2, [1], [2], [3], {1}, {2}} and Pi the projector onto the spaces Vi ⊂ M⊗2 d .”
BackgroundMethodInfluentialScalable 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 · cited 1×
“[7] Joseph Emerson, Robert Alicki, and Karol Życzkowski, “Scalable noise estimation with random unitary operators,” J.”
BackgroundCharacterizing 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 · cited 3×
“Early treatments of this problem demanded numbers of sequences that were orders of magnitude larger than were feasible in experiments [23].”
BackgroundMethodDirect 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 · cited 7×
“with Z = {tr, 1, 2, [1], [2], [3], {1}, {2}} and Pi the projector onto the spaces Vi ⊂ M⊗2 d .”
MethodInfluentialSelf-citationEvenly distributed unitaries: On the structure of unitary designs
Gross, D., Audenaert, K., & Eisert, J. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2716992 · Cited by 358 · cited 1×
“If these 2designs are assumed to be groups, similar techniques from representation theory might be used [51], but how this would be done is currently unknown.”
MethodThree-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 · cited 2×
“One can in principle gauge the behavior of these circuit by characterizing their component gates, but such a characterization will typically give only loose bounds [13] on the behavior of the full circuit (even disregarding the possibility of correlated errors inside the circuit [14]).”
BackgroundRandomized Benchmarking of Multiqubit Gates
Gaebler, J. P., Meier, A. M., Tan, T. R., Bowler, R., Lin, Y., Hanneke, D., Jost, J. D., Home, J. P., Knill, E., Leibfried, D., et al. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.260503 · Cited by 127
Gate fidelity fluctuations and quantum process invariants
Magesan, E., Blume-Kohout, R., & Emerson, J. (2011) · Physical Review A · doi:10.1103/physreva.84.012309 · Cited by 60
Bounding the average gate fidelity of composite channels using the unitarity
Carignan-Dugas, A., Wallman, J. J., & Emerson, J. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab1800 · Cited by 44
Self-citation
Cited by
Quantum certification and benchmarking
Eisert, J., Hangleiter, D., Walk, N., Roth, I., Markham, D., Parekh, R., Chabaud, U., & Kashefi, E. (2020) · Nature Reviews Physics · doi:10.1038/s42254-020-0186-4 · Cited by 342
Direct 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
“both the number of experiments [30] and the complexity of the data analysis [25] are independent of n – but introduce a new scaling problem in the form of gate compilation.”
BackgroundSuppression of midcircuit measurement crosstalk errors with micromotion
Gaebler, J. P., Baldwin, C. H., Moses, S. A., Dreiling, J. M., Figgatt, C., Foss-Feig, M., Hayes, D., & Pino, J. M. (2021) · Physical Review A · doi:10.1103/physreva.104.062440 · Cited by 34
“For standard RB, the number of sequences required is reasonable for most experiments [28].”
Background
Metadata
- Authors
- Helsen, J., Wallman, J. J., Flammia, S. T., & Wehner, S.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2019-09-03
- Volume
- 100
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2574995024
- Cited by
- 49
- References
- 13
- FWCI
- 2.65
- Type
- journal article
- Language
- en
- Open access
- bronze
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.