Fault-tolerant gates via homological product codes
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
A method for the implementation of a universal set of fault-tolerant logical gates is presented using homological product codes. In particular, it is shown that one can fault-tolerantly map between different encoded representations of a given logical state, enabling the application of different classes of transversal gates belonging to the underlying quantum codes. This allows for the circumvention of no-go results pertaining to universal sets of transversal gates and provides a general scheme for fault-tolerant computation while keeping the stabilizer generators of the code sparse.
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
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×
“n single sector theory1 in Z 2, that is a chain complex dened by a linear space Cand a linear boundary operator δ: C→C, such that δ2 = 0. We can then use such a boundary operator to dene a CSS code [39,40], that is a stabilizer code whose generators can be expressed as either X-type or Z-type. Let Cbe a n-dimensional…”
BackgroundSuperconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
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×
“They rely on the preparation of special ancillary states and gate teleportation [26–28], or tailored fault-tolerant constructions for certain classes of codes [8, 29–36].”
BackgroundMultiple-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
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700 · cited 2×
“Let the code C 1 be the 2D color code with distance d 1 encoding a single logical qubit. The code has parameters [[c 1 d2,1,d 1]], for a constant c 1, and can implement any Cliord gate transversally [9,37]. The code C 2 will be composed of the gauge-xed 3D color code. That is, a particular choice of the 3D color code…”
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457 · cited 1×
“Obtaining a universal set of fault-tolerant gates is complicated by the existence of no-go results for such constructions using only transversal gates [24, 25].”
BackgroundQuantum computations on a topologically encoded qubit
Nigg, D., Müller, M., Martinez, E. A., Schindler, P., Hennrich, M., Monz, T., Martin-Delgado, M. A., & Blatt, R. (2014) · Science · doi:10.1126/science.1253742 · Cited by 400
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Bombín, H. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083002 · Cited by 217
Constant overhead quantum fault tolerance with quantum expander codes
Fawzi, O., Grospellier, A., & Leverrier, A. (2021) · Communications of the ACM · doi:10.1145/3434163 · Cited by 111
Cited by
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Constant-Overhead Quantum Error Correction with Thin Planar Connectivity
Tremblay, M. A., Delfosse, N., & Beverland, M. E. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.050504 · Cited by 83
Transversal Clifford and T -Gate Codes of Short Length and High Distance
Jain, S. P., & Albert, V. V. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3570832 · Cited by 8
“We separate the non-trivial logical gate generators C 1 , (1) from the stabilizers C 2 as In order to exclude codes with k = 0, we impose the condition that C 2 ⊊ C 1 implying that C 1 , (1) is non-empty.”
Code conversion with the quantum Golay code for a universal transversal gate set
Sullivan, M. (2024) · Physical Review A · doi:10.1103/physreva.109.042416 · Cited by 7
Metadata
- Authors
- Jochym-O'Connor, T.
- Venue
- Quantum
- Published
- 2019-02-04
- Volume
- 3
- Pages
- 120
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2883393968
- Cited by
- 16
- References
- 11
- FWCI
- 1.04
- Type
- journal article
- Language
- en
- Open access
- gold
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: Fault-tolerant gates via homological product codes. https://app.cochat.ai/papers/10.22331/q-2019-02-04-120
- The paper
- Jochym-O'Connor, T. (2019). Fault-tolerant gates via homological product codes. Quantum. https://doi.org/10.22331/q-2019-02-04-120
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.