The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Towards Practical Classical Processing for the Surface Code
Open accessAbstract
The surface code is unarguably the leading quantum error correction code for 2D nearest neighbor architectures, featuring a high threshold error rate of approximately 1%, low overhead implementations of the entire Clifford group, and flexible, arbitrarily long-range logical gates. These highly desirable features come at the cost of significant classical processing complexity. We show how to perform the processing associated with an n×n lattice of qubits, each being manipulated in a realistic, fault-tolerant manner, in O(n2) average time per round of error correction. We also describe how to parallelize the algorithm to achieve O(1) average processing per round, using only constant computing resources per unit area and local communication. Both of these complexities are optimal.
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
High-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486
Self-citationQuantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Research works printed but not linked: 14
- P. W. Shor, 1994, Proc. 35th Annual Symposium on Foundations of Computer Science
- 10.1063/1.1499754 · DOI · Paper page
- 10.1103/PhysRevLett.98.190504 · DOI · Paper page
- 10.1088/1367-2630/9/6/199 · DOI · Paper page
- 10.1103/PhysRevA.83.020302 · DOI · Paper page
- 10.1103/PhysRevLett.104.050504 · DOI · Paper page
- 10.1103/PhysRevLett.105.200502 · DOI · Paper page
- D. S. Wang, 2010, Quantum Inf. Comput., 10, 456, 10.26421/QIC10.5-6-6 · DOI
- 10.1007/s12532-009-0002-8 · DOI · Paper page
- J. Edmonds, 1965, J. Res. Natl. Bur. Stand., Sect. B, 69, 125, 10.6028/jres.069B.013 · DOI · Paper page
- 10.1103/PhysRevE.79.021129 · DOI
- 10.1103/PhysRevB.79.174408 · DOI
- 10.1038/nphys1453 · DOI
- 10.1126/science.1208517 · DOI · Paper page
Cited by
Surface 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
Self-citationQuantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
Self-citationSurface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
Self-citationA Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2013.2244643 · Cited by 549
“With recent advances in quantum information processing technologies [5], [6], [8], [24], and improvements to faulttolerant thresholds [4], [12], [13], larger quantum devices are becoming increasingly attainable; as the complexity and size of these devices grow, hand optimizations will become less feasible, and instead…”
Background
Metadata
- Authors
- Fowler, A. G., Whiteside, A. C., & Hollenberg, L. C. L.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2012-05-01
- Volume
- 108
- Issue
- 18
- Pages
- 180501-180501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1991086270
- Cited by
- 204
- References
- 5
- FWCI
- 13.62
- 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
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.