Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be performed with the success probability of the two-qubit gate such as 0.5 (0.1) provided that the unheralded error probability of the two-qubit gate is less than 0.040% (0.016%). Furthermore, the resource usage is considerably suppressed compared to the conventional fault-tolerant schemes with probabilistic two-qubit gates.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
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
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790
Optical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614
Probabilistic quantum logic operations using polarizing beam splitters
Pittman, T. B., Jacobs, B. C., & Franson, J. D. (2001) · Physical Review A · doi:10.1103/physreva.64.062311 · Cited by 434
Cited by
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
“Hypercell Construction I is based on the snowflake design [59, 60], as shown in Fig.”
MethodFault-tolerant thresholds for quantum error correction with the surface code
Stephens, A. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022321 · Cited by 133
Robust and scalable scheme to generate large-scale entanglement webs
Fujii, K., Maeda, H., & Yamamoto, K. (2011) · Physical Review A · doi:10.1103/physreva.83.050303 · Cited by 17
Self-citation
Metadata
- Authors
- Fujii, K., & Tokunaga, Y.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2010-12-14
- Volume
- 105
- Issue
- 25
- Pages
- 250503-250503
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2152080752
- Cited by
- 47
- References
- 14
- FWCI
- 5.10
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates. https://app.cochat.ai/papers/10.1103/physrevlett.105.250503
- The paper
- Fujii, K., & Tokunaga, Y. (2010). Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates. Physical Review Letters. https://doi.org/10.1103/physrevlett.105.250503
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.