Cited by 617Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Topological fault-tolerance in cluster state quantum computation

Open access
Raussendorf, R, Harrington, J, Goyal, K·2007·New Journal of Physics

Abstract

We describe a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions. Topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster. We provide equivalence transformations for these boundary conditions that can be used to simplify fault-tolerant circuits and to derive circuit identities in a topological manner. The spatial dimensionality of the scheme can be reduced to two by converting one spatial axis of the cluster into time. The error threshold is 0.75% for each source in an error model with preparation, gate, storage and measurement errors. The operational overhead is poly-logarithmic in the circuit size.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/1367-2630/9/6/199

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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”
  • Error-correction is directly built into the 3D cluster lattice and yields a threshold of 6.7 × 10^-3 for a model with probabilistic gate errors, including imperfect preparation of the cluster state.

    “Error-correction is directly built into the cluster lattice and yields a threshold of 6 . 7 × 10 -3 75 , for a model with probabilistic gate errors, including imperfect preparation of the cluster state.”

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

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 9

  1. Knill E, Laflamme R and Zurek W H 1998 Proc. R. Soc. Lond. A 454 365
  2. Aharonov D and Ben-Or M 1997 Proc. 29th Annual ACM Symp. on Theory of Computing p 176
  3. Raussendorf R and Harrington J 2006 Preprint quant-ph/0610082 · arXiv
  4. Varnava M, Browne D E and Rudolph T 2005 Preprint quant-ph/0507036 · arXiv
  5. Nielsen M A 2004 Preprint quant-ph/0402005 · arXiv
  6. Nielsen M A and Dawson C 2004 Preprint quant-ph/0405134 · arXiv
  7. Bombin H and Martin-Delgado M A 2006 Preprint quant-ph/0610024 · arXiv
  8. Pachos J K 2006 Ann. Phys. at press (Preprint quant-ph/0605068) · arXiv
  9. Abramsky S and Coecke B 2004 Proc. 19th Annu. IEEE Symp. on Logic in Computer Science p 415

Cited by

Sorted by citations

Authors
Raussendorf, R., Harrington, J., & Goyal, K.
Affiliations
  • Perimeter Institute (CA)
  • California Institute of Technology (US)
Venue
New Journal of Physics
Published
2007-06-29
Volume
9
Issue
6
Pages
199-199
ISSN
1367-2630 (ISSN-L)
OpenAlex
W2119388976
Cited by
617
References
37
Citations by year
2026: 28 · 2025: 35 · 2024: 43 · 2023: 38 · 2022: 29 · 2021: 31 · 2020: 33 · 2019: 28 · 2018: 36 · 2017: 35 · 2016: 32 · 2015: 33 · 2014: 35 · 2013: 37 · 2012: 37
FWCI
29.03
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • New Journal of Physics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • U.S. Department of Energy (FG0392ER40701)
  • Government of Canada
  • Natural Sciences and Engineering Research Council of Canada
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
cluster states, one-way quantum computation, boundary conditions, equivalence transformations, error threshold, time-to-space conversion

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