Logical Blocks for Fault-Tolerant Topological Quantum Computation
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Abstract
A comprehensive and platform-independent framework for universal fault-tolerant logic is presented, enabling mapping from an abstract description of the logical gate to a precise set of physical instructions.
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
Anyons in an exactly solved model and beyond
Kitaev, A. (2006) · Annals of Physics · doi:10.1016/j.aop.2005.10.005 · Cited by 5,245 · cited 2×
“The simplest example of a topological feature is a boundary, which terminates the bulk in a certain location [4, 5, 68, 69].”
BackgroundMethodSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“The auxiliary qubits are recycled between measurement and initialization, allowing a local realization through geometrically bound quantum information carriers such as superconducting qubits [13].”
BackgroundGood quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“…be used to measure the stabilizers of any stabilizer code, and in the following we show how networks of spiders alone are sufficient to measure the stabilizers of any Calderbank-Shor-Steane (CSS) code [96, 97], thus giving us a recipe to measure the stabilizers of the concatenated codes of interest.”
MethodUniversal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 2×
“The gates we design are based on fault-tolerant Clifford operations combined with noisy magic state preparation, which together are sufficient for universal fault-tolerant logic (via magic state distillation [54, 86, 87]).”
BackgroundMethodImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“Within this constrained subset, this structure allows for efficient classical simulation as well as exhaustive theoretical analysis [63, 118, 119].”
MethodQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Multiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
Pastawski, F., Yoshida, B., Harlow, D., & Preskill, J. (2015) · Journal of High Energy Physics · doi:10.1007/jhep06(2015)149 · Cited by 958
Self-citationFault-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 · cited 1×
“It is a natural physical model for many architectures, including photonic architectures where fusions are native operations [48, 102, 103].”
Background
Research works printed but not linked: 63
- 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
- 10.1063/1.1499754 · DOI · Paper page
- 10.1088/1367-2630/9/6/199 · DOI · Paper page
- 10.1103/PhysRevLett.117.070501 · DOI · Paper page
- 10.1103/PhysRevResearch.2.033305 · DOI
- 10.1016/S0003-4916(02)00019-2 · DOI · Paper page
- 10.1103/PhysRevLett.102.200501 · DOI · Paper page
- 10.1103/PhysRevLett.104.050504 · DOI · Paper page
- 10.1103/PhysRevX.2.021004 · DOI · Paper page
- 10.1088/1367-2630/16/9/093045 · DOI
- 10.1103/PhysRevLett.119.040502 · DOI · Paper page
- 10.1088/1751-8113/42/9/095302 · DOI · Paper page
- 10.1103/PhysRevLett.105.030403 · DOI · Paper page
- 10.1103/PhysRevB.88.241103 · DOI
- 10.1103/PhysRevB.87.045130 · DOI · Paper page
- 10.1103/PhysRevB.91.245131 · DOI
- 10.22331/q-2017-04-25-2 · DOI · Paper page
- 10.1103/PhysRevX.7.021029 · DOI · Paper page
- 10.1016/j.aop.2016.12.014 · DOI
- 10.1103/PhysRevA.96.022306 · DOI
- 10.1103/PhysRevA.98.052319 · DOI · Paper page
- 10.1103/PhysRevA.102.022403 · DOI
- 10.1103/PhysRevX.10.041030 · DOI
- 10.1103/PhysRevA.87.062320 · DOI
- 10.1088/1742-5468/ab25de · DOI
- 10.1126/science.abi8378 · DOI
- K. Fujii, 2015, Quantum Computation with Topological Codes: from Qubit to Topological Fault-Tolerance, 10.1007/978-981-287-996-7 · DOI
- 10.1016/j.aop.2008.11.002 · DOI · Paper page
- 10.22331/q-2019-03-05-128 · DOI · Paper page
- 10.1109/TIT.2013.2292061 · DOI · Paper page
- 10.1109/TIT.2021.3097347 · DOI · Paper page
- 10.1103/PhysRevLett.111.090505 · DOI · Paper page
- 10.22331/q-2020-07-13-295 · DOI
- 10.1103/PhysRevX.3.021009 · DOI · Paper page
- 10.1073/pnas.1621345114 · DOI
- 10.1103/PhysRevB.100.115147 · DOI · Paper page
- 10.1103/PhysRevA.73.062303 · DOI · Paper page
- 10.1103/PhysRevA.90.062320 · DOI · Paper page
- 10.1063/1.4939783 · DOI · Paper page
- 10.1007/s00220-012-1500-5 · DOI · Paper page
- 10.1103/PhysRevB.86.115109 · DOI · Paper page
- 10.1103/PhysRevLett.114.076402 · DOI
- 10.1007/s102080010013 · DOI · Paper page
- 10.1103/PhysRevA.86.052329 · DOI · Paper page
- 10.1088/1367-2630/17/8/083026 · DOI · Paper page
- 10.1103/PhysRevA.94.042316 · DOI · Paper page
- 10.1088/1751-8113/43/2/025301 · DOI · Paper page
- 10.1103/PhysRevLett.104.050503 · DOI · Paper page
- 10.1103/PhysRevX.11.011023 · DOI · Paper page
- 10.1103/PhysRevLett.115.020502 · DOI · Paper page
- 10.1103/PhysRevA.69.062311 · DOI · Paper page
- 10.1038/srep08975 · DOI
- 10.1007/s12532-009-0002-8 · DOI · Paper page
- 10.1016/0378-4371(94)90124-4 · doi:10.1016/0378-4371(94)90124-4
- 10.1103/PhysRevA.88.062308 · DOI · Paper page
- 10.22331/q-2020-07-16-296 · DOI · Paper page
- 10.1103/PhysRevResearch.2.023116 · DOI
- 10.1088/1367-2630/17/2/023037 · DOI · Paper page
- 10.1103/PhysRevLett.95.230504 · DOI · Paper page
- 10.1088/1367-2630/14/7/073048 · DOI · Paper page
- 10.22331/q-2020-04-06-251 · DOI
- 10.1007/JHEP02(2015)172 · DOI · Paper page
- 10.1103/PhysRevX.10.031041 · DOI
Cited by
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
“On the classical side, we must ensure that software elements including our calibration protocols, real-time decoders, and logical compilers can scale to the sizes and complexities needed to run multi-surface-code operations [60].”
Learning high-accuracy error decoding for quantum processors
Bausch, J., Senior, A. W., Heras, F. J. H., Edlich, T., Davies, A., Newman, M., Jones, C., Satzinger, K., Niu, M. Y., Blackwell, S., et al. (2024) · Nature · doi:10.1038/s41586-024-08148-8 · Cited by 106
Gidney, C., Newman, M., Brooks, P., & Jones, C. (2025) · Nature Communications · doi:10.1038/s41467-025-59714-1 · Cited by 85
Hierarchical memories: Simulating quantum LDPC codes with local gates
Pattison, C. A., Krishna, A., & Preskill, J. (2023) · arXiv · doi:10.48550/arxiv.2303.04798 · Cited by 20
How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates
Litinski, D. (2023) · arXiv · doi:10.48550/arxiv.2306.08585 · Cited by 5
Metadata
- Authors
- Bombín, H., Dawson, C., Mishmash, R. V., Nickerson, N., Pastawski, F., & Roberts, S.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2023-04-07
- Volume
- 4
- Issue
- 2
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W4362696683
- Cited by
- 59
- References
- 30
- FWCI
- 5.01
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.