The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Surface code implementation of block code state distillation
Open accessAbstract
State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states produced a single improved [formula: see text] state given 15 input copies. New block code state distillation methods can produce k improved [formula: see text] states given 3k + 8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three.
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
Figures









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
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-citationDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Universal 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 1×
“SCIENTIFIC REPORTS, 3 (1), https://doi.”
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
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
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Perfect Quantum Error Correcting Code
Laflamme, R., Miquel, C., Paz, J. P., & Zurek, W. H. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.198 · Cited by 963
Multiple particle interference and quantum error correction
Steane, A. M. (1996) · Cited by 871
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
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Topological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
Operator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Magic-state distillation with low overhead
Bravyi, S., & Haah, J. (2012) · Physical Review A · doi:10.1103/physreva.86.052329 · Cited by 341
Layered architecture for quantum computing
Jones, N. C., Van Meter, R., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2012) · Physical Review X · doi:10.1103/physrevx.2.031007 · Cited by 332
Self-citationTopological Computation without Braiding
Bombin, H., & Martin-Delgado, M. A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.160502 · Cited by 196
Toward scalable ion traps for quantum information processing
Amini, J. M., Uys, H., Wesenberg, J. H., Seidelin, S., Britton, J., Bollinger, J. J., Leibfried, D., Ospelkaus, C., VanDevender, A. P., & Wineland, D. J. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/3/033031 · Cited by 183
Multilevel distillation of magic states for quantum computing
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.042305 · Cited by 181
Self-citationQuantum Universality from Magic States Distillation Applied to CSS Codes
Reichardt, B. W. (2005) · Quantum Information Processing · doi:10.1007/s11128-005-7654-8 · Cited by 143
Magic-state distillation with the four-qubit code
Meier, A. M., Eastin, B., & Knill, E. H. (2013) · Quantum Information and Computation · doi:10.26421/qic13.3-4-2 · Cited by 140
Architectural design for a topological cluster state quantum computer
Devitt, S. J., Fowler, A. G., Stephens, A. M., Greentree, A. D., Hollenberg, L. C. L., Munro, W. J., & Nemoto, K. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/8/083032 · Cited by 133
Self-citationBombín, H. (2010) · Physical Review A · doi:10.1103/physreva.81.032301 · Cited by 123
A bridge to lower overhead quantum computationPreprint
Fowler, A. G., & Devitt, S. J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.0510 · Cited by 96
Self-citationClifford gates by code deformation
Bombín, H. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/4/043005 · Cited by 78
Two-dimensional arrays of radio-frequency ion traps with addressable interactions
Kumph, M., Brownnutt, M., & Blatt, R. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/7/073043 · Cited by 77
Architectural design for a topological cluster state quantum computer
Devitt, S. J., Fowler, A. G., Stephens, A. M., Greentree, A. D., Hollenberg, L. C. L., Munro, W. J., & Nemoto, K. (2024) · Figshare · Cited by 70
Self-citationFowler, A. G., Whiteside, A. C., McInnes, A. L., & Rabbani, A. (2012) · Physical Review X · doi:10.1103/physrevx.2.041003 · Cited by 70
Self-citationTwo-dimensional color-code quantum computation
Fowler, A. G. (2011) · Physical Review A · doi:10.1103/physreva.83.042310 · Cited by 66
Self-citationTime-optimal quantum computation
Fowler, A. G. (2012) · arXiv · doi:10.48550/arxiv.1210.4626 · Cited by 45
Self-citationQuantum circuits for measuring Levin-Wen operators
Bonesteel, N. E., & Divincenzo, D. P. (2012) · Physical Review B · doi:10.1103/physrevb.86.165113 · Cited by 42
Accuracy thresholds of topological color codes on the hexagonal and square-octagonal lattices
Ohzeki, M. (2009) · Physical Review E · doi:10.1103/physreve.80.011141 · Cited by 41
Perfect Quantum Error Correction CodePreprint
Laflamme, R., Miquel, C., Paz, J. P., & Zurek, W. H. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9602019 · Cited by 34
Topological color codes on Union Jack lattices: a stable implementation of the whole Clifford group
Katzgraber, H. G., Bombín, H., Andrist, R. S., & Martin-Delgado, M. A. (2010) · Physical Review A · doi:10.1103/physreva.81.012319 · Cited by 33
Topological one-way quantum computation on verified logical cluster states
Fujii, K., & Yamamoto, K. (2010) · Physical Review A · doi:10.1103/physreva.82.060301 · Cited by 20
Quantum Computing with Very Noisy Devices
Knill, E. (2004) · CERN Document Server (European Organization for Nuclear Research) · doi:10.48550/arxiv.quant-ph/0410199 · Cited by 3
Magic-state distillation with the four-qubit code
Meier, A. M., Eastin, B., & Knill, E. (2012) · arXiv · doi:10.48550/arxiv.1204.4221 · Cited by 2
Quantum Circuits for Measuring Levin-Wen Operators
Bonesteel, N. E., & Divincenzo, D. P. (2012) · JuSER (Forschungszentrum Jülich) · doi:10.48550/arxiv.1206.6048
Cited by
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-03-05-128 · Cited by 408
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
Bravyi, S., & Gosset, D. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.250501 · Cited by 320
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302
“This regime may be important for verification of first fault-tolerant quantum circuits where logical nonClifford gates are expected to be scarce due to their high implementation cost [23, 34].”
Background
Metadata
- Authors
- Fowler, A. G., Devitt, S. J., & Jones, C.
- Affiliations
- The University of Melbourne (AU)
- National Institute of Informatics (JP)
- Stanford University (US)
- Corresponding author
- Fowler, Austin G.
- Venue
- Scientific Reports
- Published
- 2013-06-05
- Volume
- 3
- Issue
- 1
- Pages
- 1939-1939
- ISSN
- 2045-2322 (ISSN-L)
- PMC
- PMC3672884
- OpenAlex
- W1977033953
- Cited by
- 99
- References
- 36
- Citations by year
- 2026: 5 · 2025: 8 · 2024: 5 · 2023: 5 · 2022: 7 · 2021: 9 · 2020: 10 · 2019: 11 · 2018: 4 · 2017: 11 · 2016: 5 · 2015: 6 · 2014: 6 · 2013: 7
- FWCI
- 8.85
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by-nc-nd
- creativecommons.org/licenses/by-nc-nd/3.0/ (tdm)
- creativecommons.org/licenses/by-nc-nd/3.0/ (vor)
- Locations
- Scientific Reports (publishedVersion, cc-by-nc-nd)
- Europe PMC (PubMed Central) (publishedVersion, cc-by-nc-nd)
- PubMed Central (publishedVersion, cc-by-nc-nd)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Minerva Access (University of Melbourne) (submittedVersion, cc-by-nc-nd)
- arXiv (Cornell University)
- Funders
- National Security Agency (W911NF-08-1-0527)
- Ministry of Education, Culture, Sports, Science and Technology
- Intelligence Advanced Research Projects Activity
- Australian Research Council (CE110001027)
- Japan Society for the Promotion of Science
- Centre of Excellence for Quantum Computation and Communication Technology, Australian Research Council (CE110001027)
- Army Research Office (W911NF-08-1, W911NF-08-1- 0527, W911NF)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- surface code, quantum error correction, fault-tolerant quantum computing
- MeSH terms
- Computer Simulation, Electrons, Models, Chemical, Quantum Theory, Surface Properties
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.