CoChat

Surface code implementation of block code state distillation

Open access
Fowler, Austin G., Devitt, Simon J., Jones, Cody · 2013 · Scientific Reports

The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/srep01939

Cites

38 of 38 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Extendable quantum circuit for block code state distillation. This circuit takes 3k + 8 copies of |A〉, each with probability p of error, and producing k copies, each with approximate probability (3k + 1)p2 of error. In the figure, k = 4. The repeating unit cell is highlighted. Note that k must be even. A box encircles output numbers. Each T gate consumes one |A〉 state as shown in Figure 2.
Figure 1 Extendable quantum circuit for block code state distillation. This circuit takes 3k + 8 copies of |A〉, each with probability p of error, and producing k copies, each with approximate probability (3k + 1)p2 of error. In the figure, k = 4. The repeating unit cell is highlighted. Note that k must be even. A box encircles output numbers. Each T gate consumes one |A〉 state as shown in Figure 2.CC BY-NC-ND · PubMed Central
Figure 2 Circuit identities for application of T gates. (a) Circuit useful for delaying the application of T and eliminating X errors. (b) Circuit implementing a T gate using an ancilla state .
Figure 2 Circuit identities for application of T gates. (a) Circuit useful for delaying the application of T and eliminating X errors. (b) Circuit implementing a T gate using an ancilla state .CC BY-NC-ND · PubMed Central
Figure 3 Constant depth extendable circuit implementing block code state distillation. This example takes (3k + 8)-to-k state distillation for k = 4. Boxes encircle output numbers. Using the surface code, bent CNOTs can be implemented exactly as shown (see Figure 5). The repeating unit cell is highlighted.
Figure 3 Constant depth extendable circuit implementing block code state distillation. This example takes (3k + 8)-to-k state distillation for k = 4. Boxes encircle output numbers. Using the surface code, bent CNOTs can be implemented exactly as shown (see Figure 5). The repeating unit cell is highlighted.CC BY-NC-ND · PubMed Central
Figure 4 CNOT circuits in the surface code. (a) CNOT quantum circuit example. (b) Equivalent surface code CNOT121319. Time runs from left to right. The scale of the figure is set by the code distance d. Small cubes are d/4 a side. Longer blocks have length d. Each unit of d in the temporal direction represents a round of error detection. Each unit of d in the two spatial directions represents two qubits. The structures are called defects, and represent space-time regions in which error detection has been turned off.
Figure 4 CNOT circuits in the surface code. (a) CNOT quantum circuit example. (b) Equivalent surface code CNOT121319. Time runs from left to right. The scale of the figure is set by the code distance d. Small cubes are d/4 a side. Longer blocks have length d. Each unit of d in the temporal direction represents a round of error detection. Each unit of d in the two spatial directions represents two qubits. The structures are called defects, and represent space-time regions in which error detection has been turned off.CC BY-NC-ND · PubMed Central
Figure 5 Depth 31 canonical surface code implementation of block code state distillation. This structure is a direct mapping of Figure 3. A larger version of this figure can be found in the supplementary material.
Figure 5 Depth 31 canonical surface code implementation of block code state distillation. This structure is a direct mapping of Figure 3. A larger version of this figure can be found in the supplementary material.CC BY-NC-ND · PubMed Central
Figure 6 Depth 12 compressed surface code implementation block code state distillation. A compressed version of of Figure 3. A larger version of this figure can be found in the supplementary material, along with step-by-step images explaining how it was obtained.
Figure 6 Depth 12 compressed surface code implementation block code state distillation. A compressed version of of Figure 3. A larger version of this figure can be found in the supplementary material, along with step-by-step images explaining how it was obtained.CC BY-NC-ND · PubMed Central
Figure 7 Failure rates for the surface code. Shown here is the probability pL of logical X error per round of surface code error correction for various code distances d and physical gate error rates pg. The asymptotic curves (dashed lines) are quadratic, cubic, quartic for distances d = 3, 5, 7 respectively.
Figure 7 Failure rates for the surface code. Shown here is the probability pL of logical X error per round of surface code error correction for various code distances d and physical gate error rates pg. The asymptotic curves (dashed lines) are quadratic, cubic, quartic for distances d = 3, 5, 7 respectively.CC BY-NC-ND · PubMed Central
Figure 8 Standard 15-1 state distillation in the surface code. State distillation method taking 15 input |A〉 states, each with error p, and producing with probability 1 − 15p a single output |A〉 state with error 35p3 129. Each unit of d in the temporal direction (up in this figure) corresponds to a round of surface code error detection, each unit of d in the two spatial directions corresponds to two qubits.
Figure 8 Standard 15-1 state distillation in the surface code. State distillation method taking 15 input |A〉 states, each with error p, and producing with probability 1 − 15p a single output |A〉 state with error 35p3 129. Each unit of d in the temporal direction (up in this figure) corresponds to a round of surface code error detection, each unit of d in the two spatial directions corresponds to two qubits.CC BY-NC-ND · PubMed Central
Figure 9 Defect arrangement for the surface code. A forest of d separated straight defects of circumference d. Two square surfaces of dimension d × d have been included. The logical error rate of these surfaces upper bounds the probability of a logical error connecting neighboring defects and encircling a single defect. Time runs vertically. In the temporal direction, each unit of d represents a round of error detection. In the spatial directions, each unit of d represents two qubits.
Figure 9 Defect arrangement for the surface code. A forest of d separated straight defects of circumference d. Two square surfaces of dimension d × d have been included. The logical error rate of these surfaces upper bounds the probability of a logical error connecting neighboring defects and encircling a single defect. Time runs vertically. In the temporal direction, each unit of d represents a round of error detection. In the spatial directions, each unit of d represents two qubits.CC BY-NC-ND · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 38 references

Cited by

Items 101–109 of 109

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)
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
Licence
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.