CoChat
Sign Up
Cited by 397Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

A fault-tolerant one-way quantum computer

Open access
Raussendorf, R., Harrington, J., Goyal, K.·2006·Annals of Physics
DOI 10.1016/j.aop.2006.01.012
Open this paper in CoChat — free accountOpen PDF

Integrity signals

Registry

Crossref · 10.1016/j.aop.2006.01.012

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Three-dimensional cluster states are sufficient for measurement-based fault-tolerant quantum computing.

    “three-dimensional cluster states are sufficient for measurement-based fault-tolerant quantum computing28,29”

    From Quantum computational advantage with a programmable photonic processor (2022) · cites this paper as [28]

  • A second line of research kept the geometric constraint of nearest-neighbor interaction, which is a realistic scenario for stationary qubits.

    “A second line of research 73 kept the geometric constraint of nearest-neighbor interaction, which is a realistic scenario for stationary qubits.”

    From Measurement-based quantum computation (2009) · cites this paper as [73]

The citation lists haven’t been fetched yet

References 22 · Cited by 397

Authors
Raussendorf, R., Harrington, J., & Goyal, K.
Affiliations
  • California Institute of Technology (US)
  • Los Alamos National Laboratory (US)
Corresponding author
Raussendorf, R.
ORCID
Raussendorf, R.
Venue
Annals of Physics
Publisher
Elsevier BV
Published
2006-09
Volume
321
Issue
9
Pages
2242-2270
ISSN
0003-4916 (ISSN-L)
DOI
10.1016/j.aop.2006.01.012
OpenAlex
W2000415061
Cited by
397
References
22
Citations by year
2026: 18 · 2025: 24 · 2024: 37 · 2023: 35 · 2022: 31 · 2021: 24 · 2020: 24 · 2019: 18 · 2018: 22 · 2017: 13 · 2016: 15 · 2015: 16 · 2014: 25 · 2013: 9 · 2012: 19
FWCI
12.93
Type
journal article
Language
en
Open access
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)
Locations
  • Annals of Physics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
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
fault-tolerant quantum computing, one-way quantum computation, cluster states, topological error correction, surface code, error threshold, depolarizing noise

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