CoChat

Low-overhead fault-tolerant quantum computing using long-range connectivity

Open access

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

Abstract

Vast numbers of qubits will be needed for large-scale quantum computing because of the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check (LDPC) codes, where long-range interactions enable many logical qubits to be encoded with a modest number of physical qubits. In our approach, logic gates operate via logical Pauli measurements that preserve both the protection of the LDPC codes and the low overheads in terms of the required number of additional qubits. Compared with surface codes with the same code distance, we estimate order-of-magnitude improvements in the overheads for processing around 100 logical qubits using this approach. Given the high thresholds demonstrated by LDPC codes, our estimates suggest that fault-tolerant quantum computation at this scale may be achievable with a few thousand physical qubits at comparable error rates to what is needed for current approaches.

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.1126/sciadv.abn1717

Cites

93 of 93 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1. Parallelism. An example circuit consisting of Pauli measurements on an architecture with a parallelism of six. This circuit contains four rounds of error-corrected logical measurements. In each round, at most, six logical qubits in total can be involved in logical measurements.
Fig. 1. Parallelism. An example circuit consisting of Pauli measurements on an architecture with a parallelism of six. This circuit contains four rounds of error-corrected logical measurements. In each round, at most, six logical qubits in total can be involved in logical measurements.CC BY · PubMed Central
Fig. 2. Measurement of a logical X~ operator of the code C. (A) Bipartite subgraph GX~ of the Tanner graph of 𝒞 on the support of X~. Black nodes are the variable nodes corresponding to qubits in the support of X~. Red nodes are the check nodes corresponding to Z-type stabilizers in 𝒞 that act on qubits in the support of X~. (B) Dual graph G^T=(VX~^T,CX~^T,EX~^T) of the logical X~ in (A). There is a one-to-one mapping between the X-type generators and the qubits in (A), and the qubits and the Z-type generators in (A). (C) Measurement of X~ using the ancilla system 𝒢anc = 𝒢merged\𝒢. The Tanner graph 𝒢anc is constructed by taking alternating layers of the subgraph GX~^T in (B) and the subgraph GX~ in (A). The vertical edges are the set Eextra, which connect adjacent layers. The product of the X generators gives the logical X~, and hence, the product of the measurement results for each X generator gives the measurement result of the logical X~. After merging the codes and measuring X~, we then split the codes by measuring the stabilizers for 𝒞 and measuring the qubits in 𝒞anc in the Z basis, returning us to the original code space.
Fig. 2. Measurement of a logical X~ operator of the code C. (A) Bipartite subgraph GX~ of the Tanner graph of 𝒞 on the support of X~. Black nodes are the variable nodes corresponding to qubits in the support of X~. Red nodes are the check nodes corresponding to Z-type stabilizers in 𝒞 that act on qubits in the support of X~. (B) Dual graph G^T=(VX~^T,CX~^T,EX~^T) of the logical X~ in (A). There is a one-to-one mapping between the X-type generators and the qubits in (A), and the qubits and the Z-type generators in (A). (C) Measurement of X~ using the ancilla system 𝒢anc = 𝒢merged\𝒢. The Tanner graph 𝒢anc is constructed by taking alternating layers of the subgraph GX~^T in (B) and the subgraph GX~ in (A). The vertical edges are the set Eextra, which connect adjacent layers. The product of the X generators gives the logical X~, and hence, the product of the measurement results for each X generator gives the measurement result of the logical X~. After merging the codes and measuring X~, we then split the codes by measuring the stabilizers for 𝒞 and measuring the qubits in 𝒞anc in the Z basis, returning us to the original code space.CC BY · PubMed Central
Fig. 3. Measurement of the logical operator X~1X~2. First, ancilla systems for the logical operators X~1 and X~2 are constructed as in Fig. 2. These ancilla systems are connected together as highlighted (green box). This ancilla system is then connected to the logical X~1X~2 as described previously. Observe that the product of the X stabilizer generators in the ancilla system gives the logical X1X2. Furthermore, if we take the product of the X stabilizers on the left ancilla system, we do not obtain X1, since this product will include qubits in the highlighted (green) region. The same holds for the stabilizers in the right ancilla system. Hence, the product of the measurement results for these generators gives the measurement result for X1X2. After obtaining the measurement result, we can again measure the original stabilizers to return to the code space.
Fig. 3. Measurement of the logical operator X~1X~2. First, ancilla systems for the logical operators X~1 and X~2 are constructed as in Fig. 2. These ancilla systems are connected together as highlighted (green box). This ancilla system is then connected to the logical X~1X~2 as described previously. Observe that the product of the X stabilizer generators in the ancilla system gives the logical X1X2. Furthermore, if we take the product of the X stabilizers on the left ancilla system, we do not obtain X1, since this product will include qubits in the highlighted (green) region. The same holds for the stabilizers in the right ancilla system. Hence, the product of the measurement results for these generators gives the measurement result for X1X2. After obtaining the measurement result, we can again measure the original stabilizers to return to the code space.CC BY · PubMed Central
Fig. 4. Measurement of a logical Y~=iX~Z~ operator. This measurement closely follows that of logical X~1X~2 shown in Fig. 3, with the key difference being that ancilla systems for the logical operators X1 and Z2 are connected using non-CSS generators. Observe that the product of the X stabilizer generators on the left, the Z stabilizer generators on the right, and the mixed stabilizer generators in the dual layers gives the logical Y~.
Fig. 4. Measurement of a logical Y~=iX~Z~ operator. This measurement closely follows that of logical X~1X~2 shown in Fig. 3, with the key difference being that ancilla systems for the logical operators X1 and Z2 are connected using non-CSS generators. Observe that the product of the X stabilizer generators on the left, the Z stabilizer generators on the right, and the mixed stabilizer generators in the dual layers gives the logical Y~.CC BY · PubMed Central
Fig. 5. Measurement of the logical operator X~1Z~2. This measurement closely follows that of logical X~1X~2 shown in Fig. 3, with the key difference being that ancilla systems for the logical operators X1 and Z2 are connected using non-CSS generators (highlighted green box). Observe that the product of the X stabilizer generators on the left, the Z stabilizer generators on the right, and the mixed stabilizer generators in the highlighted region gives the logical X~1Z~2.
Fig. 5. Measurement of the logical operator X~1Z~2. This measurement closely follows that of logical X~1X~2 shown in Fig. 3, with the key difference being that ancilla systems for the logical operators X1 and Z2 are connected using non-CSS generators (highlighted green box). Observe that the product of the X stabilizer generators on the left, the Z stabilizer generators on the right, and the mixed stabilizer generators in the highlighted region gives the logical X~1Z~2.CC BY · PubMed Central
Fig. 6. Distance of Cmerged. (A) Suppose we have a code created by adjoining two surface code patches at the corner and we wish to measure the logical operator X1X2 along the top boundary. In (B), the ancilla system used for the measurement only has one layer, creating a low-weight logical between the top and bottom smooth boundaries. To mitigate this, we must use an ancilla with d layers, as in (C). This ensures that the distance of the code is preserved during the merge. It is worth noting that it may not always be the case that d layers are needed to preserve the distance, and for certain codes, it may suffice to only use one layer.
Fig. 6. Distance of Cmerged. (A) Suppose we have a code created by adjoining two surface code patches at the corner and we wish to measure the logical operator X1X2 along the top boundary. In (B), the ancilla system used for the measurement only has one layer, creating a low-weight logical between the top and bottom smooth boundaries. To mitigate this, we must use an ancilla with d layers, as in (C). This ensures that the distance of the code is preserved during the merge. It is worth noting that it may not always be the case that d layers are needed to preserve the distance, and for certain codes, it may suffice to only use one layer.CC BY · PubMed Central
Fig. 7. Gauge operators of Cmerged. The red and orange cycles in the first layer of the ancilla system give a canonical set for the Z gauge operators. All red cycles correspond to the same gauge operator up to stabilizers. We can see that the Z gauge operators can be deformed so that they lie entirely in 𝒞 and are equivalent to the product of the original Z stabilizers that are in GX~. The blue string is the X gauge operator corresponding to the red cycles. It must anti-commute with any representation of the conjugate Z gauge operator, and so, it must intersect with every red gauge operator in the graph. Since the red gauge operator can be cleaned to any dual layer of the ancilla system, the blue X logical must have support at least on every dual layer of the ancilla system. Since we use an ancilla system with d dual layers, this means that an X gauge operator must have weight at least d.
Fig. 7. Gauge operators of Cmerged. The red and orange cycles in the first layer of the ancilla system give a canonical set for the Z gauge operators. All red cycles correspond to the same gauge operator up to stabilizers. We can see that the Z gauge operators can be deformed so that they lie entirely in 𝒞 and are equivalent to the product of the original Z stabilizers that are in GX~. The blue string is the X gauge operator corresponding to the red cycles. It must anti-commute with any representation of the conjugate Z gauge operator, and so, it must intersect with every red gauge operator in the graph. Since the red gauge operator can be cleaned to any dual layer of the ancilla system, the blue X logical must have support at least on every dual layer of the ancilla system. Since we use an ancilla system with d dual layers, this means that an X gauge operator must have weight at least d.CC BY · PubMed Central
Fig. 8. Equivalent logical operators. The three curves here all represent equivalent X logical operators. The dark curve is an X logical operator on the original code 𝒞. The other two logical operators are obtained by successive application of X stabilizer generators in the dual layers of the ancilla system. In particular, after each application of X stabilizer generators in a dual layer, the logical operator has support on the same dual layer since any subset of X stabilizer generators in a dual layer is independent.
Fig. 8. Equivalent logical operators. The three curves here all represent equivalent X logical operators. The dark curve is an X logical operator on the original code 𝒞. The other two logical operators are obtained by successive application of X stabilizer generators in the dual layers of the ancilla system. In particular, after each application of X stabilizer generators in a dual layer, the logical operator has support on the same dual layer since any subset of X stabilizer generators in a dual layer is independent.CC BY · 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

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

Research works printed but not linked: 1

  1. B. J. Brown, K. Laubscher, M. S. Kesselring, J. R. Wootton, Poking holes and cutting corners to achieve clifford gates with the surface code. Phys. Rev. X 7, 021029 (2017).

Cited by

See all 98

Metadata

Authors
Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J.
Affiliations
The University of Sydney (AU)
Corresponding author
Brown, Benjamin J.
Venue
Science Advances
Published
2022-05-20
Volume
8
Issue
20
Pages
eabn1717-eabn1717
ISSN
2375-2548 (ISSN-L)
OpenAlex
W3205637696
Cited by
98
References
93
Citations by year
2026: 16 · 2025: 39 · 2024: 27 · 2023: 11 · 2022: 5
FWCI
6.72
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • Science Advances (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • eScholarship (California Digital Library) (submittedVersion)
  • arXiv (Cornell University) (public-domain)
Funders
  • Australian Research Council (CE170100009)
  • Army Research Office (W911NF-21-1-, W911NF-21-1-0007, 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
fault-tolerant quantum computing, quantum LDPC codes, long-range interactions, logical qubit encoding, surface code, error correction overhead, fault-tolerant threshold

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.