Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quantum Processor
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error which has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors, and therefore do not reliably predict the global performance of quantum algorithms, leaving us unprepared to validate the accuracy of future large-scale quantum computations. Randomized compiling is a protocol designed to overcome these performance limitations by converting coherent errors into stochastic noise, dramatically reducing unpredictable errors in quantum algorithms and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking. In this work, we demonstrate significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor. Additionally, we accurately predict algorithm performance using experimentally-measured error rates. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors, paving the way forward for scalable quantum computing.
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics
Wallraff, A., Schuster, D. I., Blais, A., Frunzio, L., Huang, R. S., Majer, J., Kumar, S., Girvin, S. M., & Schoelkopf, R. J. (2004) · Nature · doi:10.1038/nature02851 · Cited by 3,796
Charge-insensitive qubit design derived from the Cooper pair box
Koch, J., Yu, T. M., Gambetta, J., Houck, A. A., Schuster, D. I., Majer, J., Blais, A., Devoret, M. H., Girvin, S. M., & Schoelkopf, R. J. (2007) · Physical Review A · doi:10.1103/physreva.76.042319 · Cited by 3,351
Quantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405
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 2×
“10 Knill, E. Fault-tolerant postselected quantum computation: Threshold analysis. arXiv preprint quant-ph/0404104 (2004).”
BackgroundNoise tailoring for scalable quantum computation via randomized compiling
Wallman, J. J., & Emerson, J. (2016) · Physical Review A · doi:10.1103/physreva.94.052325 · Cited by 535
Self-citationFault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
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
Self-citationCharacterizing 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
Self-citationAn approximate Fourier transform useful in quantum factoring
Coppersmith, D. (2002) · arXiv · doi:10.48550/arxiv.quant-ph/0201067 · Cited by 343
Random Quantum Circuits are Approximate 2-designs
Harrow, A. W., & Low, R. A. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0873-6 · Cited by 324
Subsystem Fault Tolerance with the Bacon-Shor Code
Aliferis, P., & Cross, A. W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220502 · Cited by 203
Quantum computation with universal error mitigation on a superconducting quantum processor
Song, C., Cui, J., Wang, H., Hao, J., Feng, H., & Li, Y. (2019) · Science Advances · doi:10.1126/sciadv.aaw5686 · Cited by 131 · cited 1×
“18 Song, C. et al. Quantum computation with universal error mitigation on a superconducting quantum processor. Science advances 5, eaaw5686 (2019).”
BackgroundEfficient unitarity randomized benchmarking of few-qubit Clifford gates
Dirkse, B., Helsen, J., & Wehner, S. (2019) · Physical Review A · doi:10.1103/physreva.99.012315 · Cited by 20
Cited by
Realization of Real-Time Fault-Tolerant Quantum Error Correction
Ryan-Anderson, C., Bohnet, J. G., Lee, K., Gresh, D., Hankin, A., Gaebler, J. P., Francois, D., Chernoguzov, A., Lucchetti, D., Brown, N. C., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.041058 · Cited by 306
SupermarQ: A Scalable Quantum Benchmark Suite
Tomesh, T., Gokhale, P., Omole, V., Ravi, G. S., Smith, K. N., Viszlai, J., Wu, X.-C., Hardavellas, N., Martonosi, M. R., & Chong, F. T. (2022) · arXiv · doi:10.48550/arxiv.2202.11045 · Cited by 143
Dynamics of superconducting qubit relaxation times
Carroll, M., Rosenblatt, S., Jurcevic, P., Lauer, I., & Kandala, A. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00643-y · Cited by 136
“k1⁄40 ðhXiT ;Qk hXiT Þ 2 P d 1 k1⁄40 ðhXiω;t;Qi hXiω;tÞ 2 s (6)”
Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers
Zhao, L., Goings, J., Shin, K., Kyoung, W., Fuks, J. I., Kevin Rhee, J.-K., Rhee, Y. M., Wright, K., Nguyen, J., Kim, J., et al. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00730-8 · Cited by 73
“Over the past few years, various error mitigation methods have been developed, such as noise extrapolation [24], density matrix purification [14, 18], symmetry verification [54], randomized compiling [55], and noise-estimation.”
BackgroundScalable 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
“For example, cycle benchmarking [32, 54] and Pauli noise estimation [55, 56] can characterize a Pauli-dressed n-qubit layer.”
Background
Metadata
- Authors
- Hashim, A., Naik, R. K., Morvan, A., Ville, J.-L., Mitchell, B., Kreikebaum, J. M., Davis, M., Smith, E., Iancu, C., O’Brien, K. P., Hincks, I., Wallman, J. J., Emerson, J., & Siddiqi, I.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2021-11-24
- Volume
- 11
- Issue
- 4
- ISSN
- 2331-8422 (ISSN-L)
- 2160-3308
- OpenAlex
- W3216902878
- Cited by
- 128
- References
- 14
- Type
- posted content
- Language
- en
- Open access
- green
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.