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
Multiparty entanglement in graph states
Hein, M., Eisert, J., & Briegel, H. J. (2004) · Physical Review A · doi:10.1103/physreva.69.062311 · Cited by 915
Self-citationClassical Simulation of Infinite-Size Quantum Lattice Systems in One Spatial Dimension
Vidal, G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.070201 · Cited by 907
Asymptotic Theory of Finite Dimensional Normed Spaces
(1986) · Lecture Notes in Mathematics · doi:10.1007/bfb0075912 · Cited by 778
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Geometric measure of entanglement and applications to bipartite and multipartite quantum states
Wei, T.-C., & Goldbart, P. M. (2003) · Physical Review A · doi:10.1103/physreva.68.042307 · Cited by 742
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Quantum error-correcting codes associated with graphs
Schlingemann, D., & Werner, R. F. (2001) · Physical Review A · doi:10.1103/physreva.65.012308 · Cited by 406
Aspects of Generic Entanglement
Hayden, P., Leung, D. W., & Winter, A. (2006) · Communications in Mathematical Physics · doi:10.1007/s00220-006-1535-6 · Cited by 359
Randomizing Quantum States: Constructions and Applications
Hayden, P., Leung, D., Shor, P. W., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1087-6 · Cited by 345
Quantum computing, postselection, and probabilistic polynomial-time
Aaronson, S. (2005) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2005.1546 · Cited by 311
SHIMONY, A. (1995) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1995.tb39008.x · Cited by 309
Asymptotic Theory of Finite Dimensional Normed Spaces
(1986) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-38822-7 · Cited by 301
Dawson, C. M., & Nielsen, M. A. (2006) · Quantum Information and Computation · doi:10.26421/qic6.1-6 · Cited by 288
Entropy of an n-system from its correlation with a k-reservoir
Lubkin, E. (1978) · Journal of Mathematical Physics · doi:10.1063/1.523763 · Cited by 273
Novel Schemes for Measurement-Based Quantum Computation
Gross, D., & Eisert, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220503 · Cited by 255
Self-citationDawson, C. M., & Nielsen, M. A. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 254
Monotones and invariants for multi-particle quantum states
Barnum, H., & Linden, N. (2001) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/34/35/305 · Cited by 243
Universal Resources for Measurement-Based Quantum Computation
Van den Nest, M., Miyake, A., Dür, W., & Briegel, H. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.150504 · Cited by 238
Measurement-based quantum computation beyond the one-way model
Gross, D., Eisert, J., Schuch, N., & Perez-Garcia, D. (2007) · Physical Review A · doi:10.1103/physreva.76.052315 · Cited by 236
Self-citationAspects of generic entanglement
Hayden, P. M., Leung, D., & Winter, A. (2004) · Explore Bristol Research · Cited by 236
Matchgates and classical simulation of quantum circuits
Jozsa, R., & Miyake, A. (2008) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2008.0189 · Cited by 204
Computational Power of Correlations
Anders, J., & Browne, D. E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.050502 · Cited by 184
Proof of Page’s conjecture on the average entropy of a subsystem
Foong, S. K., & Kanno, S. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.1148 · Cited by 174
Measurement-Based Quantum Computer in the Gapped Ground State of a Two-Body Hamiltonian
Brennen, G. K., & Miyake, A. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.010502 · Cited by 162
Are Random Pure States Useful for Quantum Computation?
Bremner, M. J., Mora, C. E., & Winter, A. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.190502 · Cited by 146
Monotones and Invariants for Multi-particle Quantum States
Barnum, H., & Linden, N. (2001) · Explore Bristol Research · Cited by 140
Matchgates and classical simulation of quantum circuits
Jozsa, R., Miyake, A., et al. (2008) · Cambridge University Engineering Department Publications Database · Cited by 115
Fundamentals of universality in one-way quantum computation
Nest, M. V. D., Dür, W., Miyake, A., & Briegel, H. J. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/204 · Cited by 97
Classical simulation versus universality in measurement-based quantum computation
Van den Nest, M., Dür, W., Vidal, G., & Briegel, H. J. (2007) · Physical Review A · doi:10.1103/physreva.75.012337 · Cited by 95
Goldreich, O. (2008) · ACM SIGACT News · doi:10.1145/1412700.1412710 · Cited by 61
Computational model underlying the one-way quantum computer
Raussendorf, R., & Briegel, H. (2002) · Quantum Information and Computation · doi:10.26421/qic2.6-3 · Cited by 56
Knill-Laflamme-Milburn Linear Optics Quantum Computation as a Measurement-Based Computation
Popescu, S. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.250501 · Cited by 19
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
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.