Classical algorithms for quantum mean values
Open accessThe DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Quantum algorithms hold the promise of solving certain computational problems dramatically faster than their classical counterparts. The latest generation of quantum processors with ~50 qubits are expected to be at the brink of outperforming classical computers. However, due to the lack of fault tolerance, the qubits can be operated for only a few time steps, making the quantum circuits shallow in depth. Variational quantum algorithms are leading candidates in the effort to find shallow-depth quantum algorithms that outperform classical computers. Here we consider the task of computing the mean values of multi-qubit observables, which is a cornerstone of variational quantum algorithms for optimization, machine learning and the simulation of quantum many-body systems. We develop sub-exponential time classical algorithms for solving the quantum mean value problem for general classes of quantum observables and constant-depth quantum circuits. In the special case of geometrically local two-dimensional quantum circuits, the runtime of our algorithm scales linearly with the number of qubits. Our results demonstrate that appropriate choices of circuit parameters such as geometric locality and depth are essential to obtain quantum speed-ups based on variational quantum algorithms. Finding expectation values is a key step in variational quantum algorithms that are hoped to provide a near-term quantum advantage. Bravyi et al. show that a classical approximation is possible when the quantum circuits are limited to constant depth.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
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
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
Supervised learning with quantum-enhanced feature spaces
Havlíček, V., Córcoles, A. D., Temme, K., Harrow, A. W., Kandala, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-0980-2 · Cited by 2,572
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
The future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
Self-citationEfficient 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
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
Streif, M., Yarkoni, S., Skolik, A., Neukart, F., & Leib, M. (2021) · Physical Review A · doi:10.1103/physreva.104.012403 · Cited by 41
Metadata
- Authors
- Bravyi, S., Gosset, D., & Movassagh, R.
- Venue
- Nature Physics
- Published
- 2021-01-04
- Volume
- 17
- Issue
- 3
- Pages
- 337-341
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2977049528
- Cited by
- 56
- References
- 21
- FWCI
- 3.53
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Classical algorithms for quantum mean values. https://app.cochat.ai/papers/10.1038/s41567-020-01109-8
- The paper
- Bravyi, S., Gosset, D., & Movassagh, R. (2021). Classical algorithms for quantum mean values. Nature Physics. https://doi.org/10.1038/s41567-020-01109-8
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.