The DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.
Measurement-based quantum computation beyond the one-way model
Open accessAbstract
We introduce schemes for quantum computing based on local measurements on entangled resource states. This work elaborates on the framework established in Gross and Eisert [Phys. Rev. Lett. 98, 220503 (2007); quant-ph/0609149]. Our method makes use of tools from many-body physics---matrix product states, finitely correlated states, or projected entangled pairs states---to show how measurements on entangled states can be viewed as processing quantum information. This work hence constitutes an instance where a quantum information problem---how to realize quantum computation---was approached using tools from many-body theory and not vice versa. We give a more detailed description of the setting and present a large number of examples. We find computational schemes, which differ from the original one-way computer, for example, in the way the randomness of measurement outcomes is handled. Also, schemes are presented where the logical qubits are no longer strictly localized on the resource state. Notably, we find a great flexibility in the properties of the universal resource states: They may, for example, exhibit nonvanishing long-range correlation functions or be locally arbitrarily close to a pure state. We discuss variants of Kitaev's toric code states as universal resources, and contrast this with situations where they can be efficiently classically simulated. This framework opens up a way of thinking of tailoring resource states to specific physical systems, such as cold atoms in optical lattices or linear optical systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
“BQC uses the concept of one-way quantum computing [33-37], a measurement-based model of computation [38, 39] which represents a paradigm shift in the understanding of complex data processing by clearly separating the classical and quantum parts of a computation.”
From Demonstration of Blind Quantum Computing (2012) · cites this paper as [36]
In the citing paper
“in 19,85 it is shown how such universal resources for MQC-beyond the 2D-cluster states-can systematically be constructed.”
From Measurement-based quantum computation (2009) · cites this paper as [85]
In the citing paper
“The main conclusion of this investigation is that a number of extremal entanglement features (such as e.g. maximal localizable entanglement) exhibited by 2D-cluster states no longer have to be present in universal resources if only classical outputs are considered 19,85 .”
From Measurement-based quantum computation (2009) · cites this paper as [85]
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 Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,450
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
The density-matrix renormalization group
Schollwöck, U. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.259 · Cited by 3,323
Efficient 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
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
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
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
Research works printed but not linked: 6
- R. Raussendorf, 2002, Quantum Inf. Comput., 6, 433
- 2005, Proceedings of the International School of Physics “Enrico Fermi” on “Quantum Computers, Algorithms and Chaos,”
- R. Jozsa, 2006, Quantum Information Proceedings
- I. Affleck, 1987, Commun. Math. Phys., 59, 799
- 10.1103/PhysRevLett.96.220601 · DOI · Paper page
- D. Gottesman, 1999, Proceedings of the XXII International Coll. Group Theor. Meth. Phys.
Cited by
Sorted by citations
Colloquium : Area laws for the entanglement entropy
Eisert, J., Cramer, M., & Plenio, M. B. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.277 · Cited by 2,873
Self-citationMeasurement-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
Topological phases of fermions in one dimension
Fidkowski, L., & Kitaev, A. (2011) · Physical Review B · doi:10.1103/physrevb.83.075103 · Cited by 861
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
Quantum coherence and entanglement with ultracold atoms in optical lattices
Bloch, I. (2008) · Nature · doi:10.1038/nature07126 · Cited by 389
Metadata
- Authors
- Gross, D., Eisert, J., Schuch, N., & Perez-Garcia, D.
- Affiliations
- London Institute for Mathematical Sciences (GB)
- Max Planck Society (DE)
- ORCID
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2007-11-19
- Volume
- 76
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2077225059
- Cited by
- 236
- References
- 61
- Citations by year
- 2026: 9 · 2025: 10 · 2024: 6 · 2023: 49 · 2022: 3 · 2021: 11 · 2020: 8 · 2019: 6 · 2018: 11 · 2017: 8 · 2016: 9 · 2015: 8 · 2014: 12 · 2013: 10 · 2012: 17
- FWCI
- 18.15
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) (submittedVersion, other-oa)
- Library Open Repository (Universidad Complutense Madrid) (submittedVersion, other-oa)
- Max Planck Institute for Plasma Physics (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Microsoft Research
- Engineering and Physical Sciences Research Council
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- measurement-based quantum computation, one-way quantum computation, local measurements, matrix product states, projected entangled pair states, toric code, long-range correlations, classical simulation, ultracold atoms in optical lattices, linear optical systems
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
