Methodology for quantum logic gate construction
Open accessAbstract
We present a general method to construct fault-tolerant quantum logic gates with a simple primitive, which is an analog of quantum teleportation. The technique extends previous results based on traditional quantum teleportation [Gottesman and Chuang, Nature (London) 402, 390 (1999)] and leads to straightforward and systematic construction of many fault-tolerant encoded operations, including the $\ensuremath{\pi}/8$ and Toffoli gates. The technique can also be applied to the construction of remote quantum operations that cannot be directly performed.
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.
Integrity signals
Registry
Cites
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.
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?
For the C4/C6 architecture, memory is an issue only when waiting for measurement outcomes that determine whether prepared states are good, or that are needed after teleportation, particularly when implementing non-Clifford gates.
“For the C 4 /C 6 architecture, memory is an issue only when waiting for measurement outcomes that determine whether prepared states are good, or that are needed after teleportation, particularly when implementing non-Clifford gates. 18,19”
From Quantum computing with realistically noisy devices (2005) · cites this paper as [18]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 18 · Cited by 355
Research works printed but not linked: 1
- [23]R. Cleve, W. van Dam, M. Nielsen, and A. Tapp, Proc. of the 1st NASA International Conference on Quantum Computing and Quantum Communications , 61 (1999); LANL E-print quant-ph/9708019. · arXiv
- Authors
- Zhou, X., Leung, D. W., & Chuang, I. L.
- Affiliations
- IBM Research - Almaden (US)
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2000-10-18
- Volume
- 62
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1984436207
- Cited by
- 355
- References
- 18
- Citations by year
- 2026: 20 · 2025: 32 · 2024: 34 · 2023: 20 · 2022: 25 · 2021: 19 · 2020: 19 · 2019: 16 · 2018: 19 · 2017: 16 · 2016: 7 · 2015: 13 · 2014: 12 · 2013: 11 · 2012: 10
- FWCI
- 5.38
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Defense Advanced Research Projects Agency
- Army Research Office
- 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
- quantum teleportation, Toffoli gate, quantum error correction
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
