Student or educator? Sign up with your school email and get 6 months of Pro free.

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

Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code

Open access
Goto, Hayato · 2016 · Scientific Reports

Abstract

The seven-qubit quantum error-correcting code originally proposed by Steane is one of the best known quantum codes. The Steane code has a desirable property that most basic operations can be performed easily in a fault-tolerant manner. A major obstacle to fault-tolerant quantum computation with the Steane code is fault-tolerant preparation of encoded states, which requires large computational resources. Here we propose efficient state preparation methods for zero and magic states encoded with the Steane code, where the zero state is one of the computational basis states and the magic state allows us to achieve universality in fault-tolerant quantum computation. The methods minimize resource overheads for the fault-tolerant state preparation and therefore reduce necessary resources for quantum computation with the Steane code. Thus, the present results will open a new possibility for efficient fault-tolerant quantum computation.

Overview

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.

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

Integrity signals

Registry

Crossref · 10.1038/srep19578

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Quantum circuits for fault-tolerant preparation of encoded with the Steane code. (a) Conventional method with four physical ancilla qubits for verification. (b) Conventional method with a logical ancilla qubit in for verification. (c) Proposed method with one physical ancilla qubit for verification. Here is defined as and M0/1 denotes the computational basis measurement of a physical qubit.
Figure 1 Quantum circuits for fault-tolerant preparation of encoded with the Steane code. (a) Conventional method with four physical ancilla qubits for verification. (b) Conventional method with a logical ancilla qubit in for verification. (c) Proposed method with one physical ancilla qubit for verification. Here is defined as and M0/1 denotes the computational basis measurement of a physical qubit.CC BY · PubMed Central
Figure 2 Simulation results of a logical CNOT gate. (a) Log-log plot of error probabilities of a logical CNOT gate. The straight lines are the fits of to the plots, where α is a fitting parameter. (b) Linear plot of resources of a logical CNOT gate, where the resource is defined as the total number of physical qubits. In both (a) and (b), the crosses, the circles, and the triangles correspond to the cases where logical zero states are prepared by the methods shown in Fig. 1a–c, respectively. pe denotes the error probability per physical two-qubit gate.
Figure 2 Simulation results of a logical CNOT gate. (a) Log-log plot of error probabilities of a logical CNOT gate. The straight lines are the fits of to the plots, where α is a fitting parameter. (b) Linear plot of resources of a logical CNOT gate, where the resource is defined as the total number of physical qubits. In both (a) and (b), the crosses, the circles, and the triangles correspond to the cases where logical zero states are prepared by the methods shown in Fig. 1a–c, respectively. pe denotes the error probability per physical two-qubit gate.CC BY · PubMed Central
Figure 3 Quantum circuits for fault-tolerant preparation of encoded with the Steane code. (a) Conventional method. The whole procedure without the preparation of the logical zero state is repeated twice. (b) Proposed method. In both (a) and (b), the error detection with the Steane code is implemented by, e.g., error-detecting teleportation716.
Figure 3 Quantum circuits for fault-tolerant preparation of encoded with the Steane code. (a) Conventional method. The whole procedure without the preparation of the logical zero state is repeated twice. (b) Proposed method. In both (a) and (b), the error detection with the Steane code is implemented by, e.g., error-detecting teleportation716.CC BY · PubMed Central
Figure 4 Quantum circuit for a non-Clifford gate RY(π/4) with a magic state . M+/− denotes the {, } basis measurement and m denotes the measurement result, where m equals 0 and 1 for the results and , respectively.
Figure 4 Quantum circuit for a non-Clifford gate RY(π/4) with a magic state . M+/− denotes the {, } basis measurement and m denotes the measurement result, where m equals 0 and 1 for the results and , respectively.CC BY · PubMed Central
Figure 5 Simulation results of a logical RY(π/4) with . (a) Log-log plot of error probabilities of a logical . The straight lines are the fits of to the plots, where α is a fitting parameter. (b) Linear plot of resources of a logical , where the resource is defined as the total number of physical qubits. In both (a) and (b), the crosses and the triangles correspond to the cases where is prepared by the methods shown in Fig. 3a,b, respectively. pe denotes the error probability per physical two-qubit gate.
Figure 5 Simulation results of a logical RY(π/4) with . (a) Log-log plot of error probabilities of a logical . The straight lines are the fits of to the plots, where α is a fitting parameter. (b) Linear plot of resources of a logical , where the resource is defined as the total number of physical qubits. In both (a) and (b), the crosses and the triangles correspond to the cases where is prepared by the methods shown in Fig. 3a,b, respectively. pe denotes the error probability per physical two-qubit gate.CC BY · PubMed Central

Verification

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.

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

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?

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 24 references

Research works printed but not linked: 1

  1. Meier, A. M., Eastin, B. & Knill, E. Magic-state distillation with the four-qubit code. Quant. Inf. Comput. 13, 195–209 (2013).

Cited by

See all 61

Metadata

Authors
Goto, H.
Affiliations
Toshiba (Japan) (JP)
Corresponding author
Goto, Hayato
Venue
Scientific Reports
Published
2016-01-27
Volume
6
Issue
1
Pages
19578-19578
ISSN
2045-2322 (ISSN-L)
OpenAlex
W2254580066
Cited by
61
References
24
Citations by year
2026: 6 · 2025: 20 · 2024: 11 · 2023: 5 · 2022: 1 · 2021: 3 · 2020: 6 · 2019: 2 · 2018: 3 · 2017: 3 · 2016: 1
FWCI
2.44
Type
journal article
Language
en
Open access
Licence
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
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
Steane code, resource overhead, fault-tolerant quantum computing, universality

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code. https://app.cochat.ai/papers/10.1038/srep19578
The paper
Goto, H. (2016). Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code. Scientific Reports. https://doi.org/10.1038/srep19578

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.