Foliated Quantum Error-Correcting Codes
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
We show how to construct a large class of quantum error-correcting codes, known as Calderbank-Steane-Shor codes, from highly entangled cluster states. This becomes a primitive in a protocol that foliates a series of such cluster states into a much larger cluster state, implementing foliated quantum error correction. We exemplify this construction with several familiar quantum error-correction codes and propose a generic method for decoding foliated codes. We numerically evaluate the error-correction performance of a family of finite-rate Calderbank-Steane-Shor codes known as turbo codes, finding that they perform well over moderate depth foliations. Foliated codes have applications for quantum repeaters and fault-tolerant measurement-based quantum computation.
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
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 · cited 1×
“1(b) for Shor ’ s nine-qubit code [27,28], for which The examples in Fig.”
BackgroundRaussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“1(b) for Shor ’ s nine-qubit code [27,28], for which The examples in Fig.”
BackgroundDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655 · cited 2×
“A cluster state is defined on a collection of qubits located at the vertices of a graph [16,17,21].”
BackgroundMethodUniversal 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
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090 · cited 1×
“A cluster state is defined on a collection of qubits located at the vertices of a graph [16,17,21].”
BackgroundFault-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
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397 · cited 1×
“[1,2] to use other underlying codes that could achieve a higher encoding rate.”
BackgroundFault-tolerant renormalization group decoder for Abelian topological codes
Duclos-Cianci, G., & Poulin, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.9-10-1 · Cited by 52
Self-citation
Cited by
K S, U. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.18067974 · Cited by 733
Photonic quantum information processing: a concise review
Slussarenko, S., & Pryde, G. J. (2019) · Applied Physics Reviews · doi:10.1063/1.5115814 · Cited by 644
Fusion-based quantum computation
Bartolucci, S., Birchall, P., Bombín, H., Cable, H., Dawson, C., Gimeno-Segovia, M., Johnston, E., Kieling, K., Nickerson, N., Pant, M., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-36493-1 · Cited by 371
Why I am optimistic about the silicon-photonic route to quantum computing
Rudolph, T. (2017) · APL Photonics · doi:10.1063/1.4976737 · Cited by 350
Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., et al. (2021) · Quantum · doi:10.22331/q-2021-02-04-392 · Cited by 302
Measurement as a Shortcut to Long-Range Entangled Quantum Matter
Lu, T.-C., Lessa, L. A., Kim, I. H., & Hsieh, T. H. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040337 · Cited by 115
“Specifically, the effective parton Hamiltonian derived from perturbation theory reads Heff = i 4 ∑ jk Ajkcjck (10) with Ajk including both nearest-neighbor and nextnearest-neighbor hopping amplitudes (see Ref.”
BackgroundInfluentialA fault-tolerant non-Clifford gate for the surface code in two dimensions
Brown, B. J. (2020) · Science Advances · doi:10.1126/sciadv.aay4929 · Cited by 77
“Much research has sought to map quantum error–correcting codes into measurement-based schemes ( 29 , 39 ) through a system called “foliation” to access favorable properties of exotic quantum error–correcting codes.”
Decoder for the Triangular Color Code by Matching on a Möbius Strip
Sahay, K., & Brown, B. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010310 · Cited by 38
A quantum processor based on coherent transport of entangled atom arrays
Bluvstein, D., Levine, H., Semeghini, G., Wang, T. T., Ebadi, S., Kalinowski, M., Keesling, A., Maskara, N., Pichler, H., Greiner, M., et al. (2022) · Nature · doi:10.1038/s41586-022-04592-6 · Cited by 14
“The graph state stabilizers now transform into the X-plaquettes, the Z-stars (with value ±1 for a measurement outcome of ±1 of the central ancilla), and the logical XL operator [36, 40].”
Metadata
- Authors
- Bolt, A., Duclos-Cianci, G., Poulin, D., & Stace, T. M.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2016-08-10
- Volume
- 117
- Issue
- 7
- Pages
- 070501-070501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2479964607
- Cited by
- 93
- References
- 10
- FWCI
- 2.21
- 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.