The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Universal Resources for Measurement-Based Quantum Computation
Open accessAbstract
We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess the universality of graph states by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal nongraph state.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Thus, a universal measurement-based quantum computer is then identified as a device which allows for universal state preparation by local operations only 79,80 .”
From Measurement-based quantum computation (2009) · cites this paper as [80]
In the citing paper
“Using this intuition, it can be shown that every such universal resource must be maximally entangled with respect to all types of entanglement 79,80 .”
From Measurement-based quantum computation (2009) · cites this paper as [80]
Citations
Cites
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Self-citationEfficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Persistent Entanglement in Arrays of Interacting Particles
Briegel, H. J., & Raussendorf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.910 · Cited by 1,950
Self-citationGottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Quantum Teleportation is a Universal Computational PrimitivePreprint
Gottesman, D., & Chuang, I. L. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9908010 · Cited by 846
On the role of entanglement in quantum-computational speed-up
Jozsa, R., & Linden, N. (2003) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2002.1097 · Cited by 839
Upper bounds to the clique width of graphs
Courcelle, B., & Olariu, S. (2000) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(99)00184-5 · Cited by 628
Entanglement versus Correlations in Spin Systems
Verstraete, F., Popp, M., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.027901 · Cited by 470
Valence-bond states for quantum computation
Verstraete, F., & Cirac, J. I. (2004) · Physical Review A · doi:10.1103/physreva.70.060302 · Cited by 333
Stability of Macroscopic Entanglement under Decoherence
Dür, W., & Briegel, H. J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.180403 · Cited by 319
Self-citationON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
Golumbic, M. C., & Rotics, U. (2000) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054100000260 · Cited by 231
Bell Inequalities for Graph States
Gühne, O., Tóth, G., Hyllus, P., & Briegel, H. J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.120405 · Cited by 221
Self-citationQuantum computation by measurement and quantum memory
Nielsen, M. A. (2003) · Physics Letters A · doi:10.1016/s0375-9601(02)01803-0 · Cited by 150
Unified derivations of measurement-based schemes for quantum computation
Childs, A. M., Leung, D., & Nielsen, M. A. (2005) · Physical Review A · doi:10.1103/physreva.71.032318 · Cited by 142
Deterministic entanglement of assistance and monogamy constraints
Gour, G., MEYER, D. A., & Sanders, B. C. (2005) · Physical Review A · doi:10.1103/physreva.72.042329 · Cited by 108
QUANTUM COMPUTATION BY MEASUREMENTS
LEUNG, D. W. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749904000055 · Cited by 85
Computational model underlying the one-way quantum computer
Raussendorf, R., & Briegel, H. J. (2002) · doi:10.5555/2011492.2011495 · Cited by 82
Self-citationComputation by measurements: A unifying picture
Aliferis, P., & Leung, D. W. (2004) · Physical Review A · doi:10.1103/physreva.70.062314 · Cited by 75
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
Self-citationNatural three-qubit interactions in one-way quantum computing
Tame, M., Paternostro, M., Kim, M. S., & Vedral, V. (2006) · Physical Review A · doi:10.1103/physreva.73.022309 · Cited by 29
Cited by
Sorted by citations
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090
Self-citationSimulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
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 457
Towards the fast scrambling conjecture
Lashkari, N., Stanford, D., Hastings, M. B., Osborne, T. J., & Hayden, P. M. (2013) · Journal of High Energy Physics · doi:10.1007/jhep04(2013)022 · Cited by 474
Metadata
- Authors
- Van den Nest, M., Miyake, A., Dür, W., & Briegel, H. J.
- Affiliations
- Universität Innsbruck (AT)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2006-10-13
- Volume
- 97
- Issue
- 15
- Pages
- 150504-150504
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2125945272
- Cited by
- 238
- References
- 20
- Citations by year
- 2026: 6 · 2025: 15 · 2024: 9 · 2023: 10 · 2022: 8 · 2021: 12 · 2020: 6 · 2019: 8 · 2018: 5 · 2017: 5 · 2016: 8 · 2015: 7 · 2014: 14 · 2013: 16 · 2012: 15
- FWCI
- 23.98
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review Letters (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- measurement-based quantum computation, universal quantum computation, entanglement resource, cluster states, graph states, entanglement measures, single-qubit operations, hexagonal lattice, triangular lattice
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
