Computational model underlying the one-way quantum computer
Abstract
In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. {\bf{86}}, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step.
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 one-way quantum computer achieves universal quantum computation using only single-qubit measurements.
“in the one-way quantum computer-which will be the focus of this article-universal quantum computation can be achieved with single-qubit measurements only”
From Measurement-based quantum computation (2009) · cites this paper as [11]
Cites
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitanyi, P. M. B. (2019) · Texts in computer science · doi:10.1007/978-3-030-11298-1 · Cited by 3,752 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
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 · see citing works
Self-citationCriticality, the Area Law, and the Computational Power of Projected Entangled Pair States
Verstraete, F., Wolf, M. M., Perez-Garcia, D., & Cirac, J. I. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.220601 · Cited by 580 · see citing works
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 · see citing works
Self-citationDanos, V., Kashefi, E., & Panangaden, P. (2007) · Journal of the ACM · doi:10.1145/1219092.1219096 · Cited by 195 · see citing works
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 · see citing works
Self-citationFundamentals 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 · see citing works
Self-citation
- Authors
- Raussendorf, R., & Briegel, H.
- Venue
- Quantum Information and Computation
- Publisher
- Rinton Press
- Published
- 2002-10
- Volume
- 2
- Issue
- 6
- Pages
- 443-486
- ISSN
- 1533-7146 (ISSN-L)
- OpenAlex
- W2949153315
- Cited by
- 56
- References
- 1
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 3 · 2023: 3 · 2022: 4 · 2021: 3 · 2020: 1 · 2018: 2 · 2017: 1 · 2015: 1 · 2014: 2 · 2012: 3
- FWCI
- 1.04
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Quantum Information and Computation (publishedVersion)
- 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 many-body systems
- Keywords
- logical depth, quantum circuit simulation, Clifford group, quantum information processing, computational model
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
