Computation by measurements: A unifying picture
Open accessAbstract
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a striking viewpoint for thinking about quantum computation and its powers. We consider the two major models for doing quantum computation by measurements that have hitherto appeared in the literature and show that they are conceptually closely related by demonstrating a systematic local mapping between them. This way we effectively unify the two models, showing that they make use of interchangeable primitives. With the tools developed for this mapping, we then construct more resource-effective methods for performing computation within both models and propose schemes for the construction of arbitrary graph states employing two-qubit measurements alone.
Integrity signals
Registry
Cites
Statistics
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?
The existence of a non-zero threshold for the one-way quantum computer was first proven by reduction to the circuit model.
“The existence of a non-zero threshold was first proven by reduction to the circuit model 65-67 .”
From Measurement-based quantum computation (2009) · cites this paper as [67]
The citation lists haven’t been fetched yet
References 24 · Cited by 75
- Authors
- Aliferis, P., & Leung, D. W.
- Affiliations
- California Institute of Technology (US)
- ORCID
- Leung, Debbie W.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2004-12-14
- Volume
- 70
- Issue
- 6
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2006997120
- Cited by
- 75
- References
- 24
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 4 · 2023: 2 · 2022: 1 · 2021: 4 · 2019: 2 · 2018: 2 · 2017: 3 · 2016: 4 · 2015: 3 · 2014: 1 · 2012: 5
- FWCI
- 9.81
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum measurement, universal quantum computation, local equivalence, graph states
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
