Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
Open accessThe DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Abstract
Today's experimental noisy quantum processors can compete with and surpass all known algorithms on state-of-the-art supercomputers for the computational benchmark task of Random Circuit Sampling [1-5]. Additionally, a circuit-based quantum simulation of quantum information scrambling [6], which measures a local observable, has already outperformed standard full wave function simulation algorithms, e.g., exact Schrodinger evolution and Matrix Product States (MPS). However, this experiment has not yet surpassed tensor network contraction for computing the value of the observable. Based on those studies, we provide a unified framework that utilizes the underlying effective circuit volume to explain the tradeoff between the experimentally achievable signal-to-noise ratio for a specific observable, and the corresponding computational cost. We apply this framework to recent quantum processor experiments of Random Circuit Sampling [5], quantum information scrambling [6], and a Floquet circuit unitary [7]. This allows us to reproduce the results of Ref. [7] in less than one second per data point using one GPU.
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
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“…quantum computers [8–19] have the potential to solve problems that are intractable for classical computers, including applications in factoring [20, 21], quantum simulation [22] of quantum chemistry [23– 26] and materials [27], quantum machine learning [28] and topological data analysis [29, 30].”
BackgroundSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Self-citationSuppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
Self-citationEvidence for the utility of quantum computing before fault tolerance
Kim, Y., Eddins, A., Anand, S., Wei, K. X., van den Berg, E., Rosenblatt, S., Nayfeh, H., Wu, Y., Zaletel, M., Temme, K., et al. (2023) · Nature · doi:10.1038/s41586-023-06096-3 · Cited by 1,050
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Realizing repeated quantum error correction in a distance-three surface code
Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., et al. (2022) · Nature · doi:10.1038/s41586-022-04566-8 · Cited by 686
Quantum advantage in learning from experiments
Huang, H.-Y., Broughton, M., Cotler, J., Chen, S., Li, J., Mohseni, M., Neven, H., Babbush, R., Kueng, R., Preskill, J., et al. (2022) · Science · doi:10.1126/science.abn7293 · Cited by 519
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Realization of an Error-Correcting Surface Code with Superconducting Qubits
Zhao, Y., Ye, Y., Huang, H.-L., Zhang, Y., Wu, D., Guan, H., Zhu, Q., Wei, Z., He, T., Cao, S., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.030501 · Cited by 321
On the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019) · Nature Physics · doi:10.1038/s41567-018-0318-2 · Cited by 287
Information scrambling in quantum circuits
Mi, X., Roushan, P., Quintana, C., Mandrà, S., Marshall, J., Neill, C., Arute, F., Arya, K., Atalaya, J., Babbush, R., et al. (2021) · Science · doi:10.1126/science.abg5029 · Cited by 283
Self-citationQuantum computational advantage via 60-qubit 24-cycle random circuit sampling
Zhu, Q., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., Gong, M., et al. (2022) · Science Bulletin · doi:10.1016/j.scib.2021.10.017 · Cited by 263
Quantum algorithms for topological and geometric analysis of data
Lloyd, S., Garnerone, S., & Zanardi, P. (2016) · Nature Communications · doi:10.1038/ncomms10138 · Cited by 241
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
Aaronson, S., & Chen, L. (2016) · arXiv · doi:10.48550/arxiv.1612.05903 · Cited by 218
Efficient Tensor Network Simulation of IBM’s Eagle Kicked Ising Experiment
Tindall, J., Fishman, M., Stoudenmire, E. M., & Sels, D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010308 · Cited by 152
Phase transition in Random Circuit Sampling
Morvan, A., Villalonga, B., Mi, X., Mandrà, S., Bengtsson, A., Klimov, P. V., Chen, Z., Hong, S., Erickson, C., Drozdov, I. K., et al. (2023) · arXiv · doi:10.48550/arxiv.2304.11119 · Cited by 138
Self-citationGoings, J. J., White, A., Lee, J., Tautermann, C. S., Degroote, M., Gidney, C., Shiozaki, T., Babbush, R., & Rubin, N. C. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2203533119 · Cited by 127
Non-Abelian braiding of graph vertices in a superconducting processor
Collaborators, G. Q. A. A., Andersen, T. I., Lensky, Y. D., Kechedzhi, K., Drozdov, I. K., Bengtsson, A., Hong, S., Morvan, A., Mi, X., Opremcak, A., et al. (2023) · Nature · doi:10.1038/s41586-023-05954-4 · Cited by 108
Self-citationEfficient tensor network simulation of IBM's largest quantum processors
Patra, S., Jahromi, S. S., Singh, S., & Orús, R. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013326 · Cited by 63
Boundaries of quantum supremacy via random circuit sampling
Zlokapa, A., Boixo, S., & Lidar, D. (2020) · arXiv · doi:10.48550/arxiv.2005.02464 · Cited by 55
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
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., Draeger, E. W., Holland, E. T., & Wisnieff, R. (2017) · arXiv · doi:10.48550/arxiv.1710.05867 · Cited by 48
Efficient approximation of experimental Gaussian boson sampling
Villalonga, B., Niu, M. Y., Li, L., Neven, H., Platt, J. C., Smelyanskiy, V. N., & Boixo, S. (2021) · arXiv · doi:10.48550/arxiv.2109.11525 · Cited by 16
Self-citationSimulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator
Liao, H.-J., Wang, K., Zhou, Z.-S., Zhang, P., & Xiang, T. (2023) · arXiv · doi:10.48550/arxiv.2308.03082 · Cited by 4
Cited by
Phase transition in Random Circuit Sampling
Morvan, A., Villalonga, B., Mi, X., Mandrà, S., Bengtsson, A., Klimov, P. V., Chen, Z., Hong, S., Erickson, C., Drozdov, I. K., et al. (2023) · arXiv · doi:10.48550/arxiv.2304.11119 · Cited by 138
Self-citationBeyond-classical computation in quantum simulation
King, A. D., Nocera, A., Rams, M. M., Dziarmaga, J., Wiersema, R., Bernoudy, W., Raymond, J., Kaushal, N., Heinsdorf, N., Harris, R., et al. (2025) · Science · doi:10.1126/science.ado6285 · Cited by 138
Early Fault-Tolerant Quantum Computing
Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103
“The flurry of work [42–44] immediately arose pushing classical methods of simulation and claiming to reproduce IBM’s results.”
BackgroundBegušić, T., Gray, J., & Chan, G. K.-L. (2024) · Science Advances · doi:10.1126/sciadv.adk4321 · Cited by 89
Benchmarking highly entangled states on a 60-atom analogue quantum simulator
Shaw, A. L., Chen, Z., Choi, J., Mark, D. K., Scholl, P., Finkelstein, R., Elben, A., Choi, S., & Endres, M. (2024) · Nature · doi:10.1038/s41586-024-07173-x · Cited by 64
Metadata
- Authors
- Kechedzhi, K., Isakov, S. V., Mandrà, S., Villalonga, B., Mi, X., Boixo, S., & Smelyanskiy, V.
- Venue
- Future Generation Computer Systems
- Publisher
- Elsevier BV
- Published
- 2024-04
- Volume
- 153
- Pages
- 431-441
- ISSN
- 0167-739X (ISSN-L)
- OpenAlex
- W4389304858
- Cited by
- 42
- References
- 28
- FWCI
- 3.69
- 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.