The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Most Quantum States Are Too Entangled To Be Useful As Computational Resources
Open accessAbstract
It is often argued that entanglement is at the root of the speedup for quantum compared to classical computation, and that one needs a sufficient amount of entanglement for this speedup to be manifest. In measurement-based quantum computing, the need for a highly entangled initial state is particularly obvious. Defying this intuition, we show that quantum states can be too entangled to be useful for the purpose of computation, in that high values of the geometric measure of entanglement preclude states from offering a universal quantum computational speedup. We prove that this phenomenon occurs for a dramatic majority of all states: the fraction of useful n-qubit pure states is less than exp(-n;{2}). This work highlights a new aspect of the role entanglement plays for quantum computational speedups.
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. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
Average entropy of a subsystem
Page, D. N. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.1291 · Cited by 1,578
Average Entropy of a Subsystem
Page, D. N. (1993) · arXiv · doi:10.48550/arxiv.gr-qc/9305007 · Cited by 1,578
Finitely correlated states on quantum spin chains
Fannes, M., Nachtergaele, B., & Werner, R. F. (1992) · Communications in Mathematical Physics · doi:10.1007/bf02099178 · Cited by 1,422
Experimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273
Alon, N., & Spencer, J. H. (2000) · Wiley eBooks · doi:10.1002/0471722154 · Cited by 949
Cited by
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
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
The classical-quantum boundary for correlations: Discord and related measures
Modi, K., Brodutch, A., Cable, H., Paterek, T., & Vedral, V. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.1655 · Cited by 1,600
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Nonlocality and communication complexity
Buhrman, H., Cleve, R., Massar, S., & de Wolf, R. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.665 · Cited by 622
Positive Wigner Functions Render Classical Simulation of Quantum Computation Efficient
Mari, A., & Eisert, J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.230503 · Cited by 451
Self-citationLocal Random Quantum Circuits are Approximate Polynomial-Designs
Brandão, F. G. S. L., Harrow, A. W., & Horodecki, M. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2706-8 · Cited by 404
“A folklore result in quantum information theory says that the overwhelming majority of quantum states on n qubits cannot be distinguished (with a non-negligible bias) from the maximally mixed state by any measurement which can be implemented by subexponential-sized quantum circuits [34,35].”
BackgroundEntanglement certification from theory to experiment
Friis, N., Vitagliano, G., Malik, M., & Huber, M. (2018) · Nature Reviews Physics · doi:10.1038/s42254-018-0003-5 · Cited by 360
Barren plateaus in variational quantum computing
Larocca, M., Thanasilp, S., Wang, S., Sharma, K., Biamonte, J., Coles, P. J., Cincio, L., McClean, J. R., Holmes, Z., & Cerezo, M. (2025) · Nature Reviews Physics · doi:10.1038/s42254-025-00813-9 · Cited by 257
Contextuality in measurement-based quantum computation
Raussendorf, R. (2013) · Physical Review A · doi:10.1103/physreva.88.022322 · Cited by 252
Variational quantum eigensolver with fewer qubits
Liu, J.-G., Zhang, Y.-H., Wan, Y., & Wang, L. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.023025 · Cited by 166
The Schmidt number as a universal entanglement measure
Sperling, J., & Vogel, W. (2011) · Physica Scripta · doi:10.1088/0031-8949/83/04/045002 · Cited by 96
Entanglement-Induced Barren Plateaus
Ortiz Marrero, C., Kieferová, M., & Wiebe, N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040316 · Cited by 39
Browne, D., & Briegel, H. (2016) · Quantum Information · doi:10.1002/9783527805785.ch21 · Cited by 29
Quantifying entanglement from the geometric perspective
(2025) · doi:10.1209/0295-5075/adffb5 · Cited by 4
Metadata
- Authors
- Gross, D., Flammia, S. T., & Eisert, J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2009-05-11
- Volume
- 102
- Issue
- 19
- Pages
- 190501-190501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2005144372
- Cited by
- 284
- References
- 42
- FWCI
- 26.75
- 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
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.