Algebraic Methods for Quantum Codes on Lattices
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
This is a note from a series of lectures at Encuentro Colombiano de Computacion Cuantica, Universidad de los Andes, Bogota, Colombia, 2015. The purpose is to introduce additive quantum error correcting codes, with emphasis on the use of binary representation of Pauli matrices and modules over a translation group algebra. The topics include symplectic vector spaces, Clifford group, cleaning lemma, an error correcting criterion, entanglement spectrum, implications of the locality of stabilizer group generators, and the classification of translation-invariant one-dimensional additive codes and two-dimensional CSS codes with large code distances. In particular, we describe an algorithm to find a Clifford quantum circuit (CNOTs) to transform any two-dimensional translation-invariant CSS code on qudits of a prime dimension with code distance being the linear system size, into a tensor product of finitely many copies of the qudit toric code and a product state. Thus, the number of embedded toric codes is the complete invariant of these CSS codes under local Clifford circuits.
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
Anyons in an exactly solved model and beyond
Kitaev, A. (2006) · Annals of Physics · doi:10.1016/j.aop.2005.10.005 · Cited by 5,245
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
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 5×
“Recall that a CSS code [10, 38] is a code where stabilizer generators can be chosen to be either X- or Z-type.”
BackgroundMethodInfluentialDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Multiple-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
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227 · cited 3×
“An additive code [9, 8] or stabilizer code [15] is a subspace of n-qubit Hilbert space(1) that is defined as the common eigenspace of a set of commuting Pauli operators of eigenvalue +1.”
BackgroundMethodQuantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.405 · Cited by 811 · cited 3×
“An additive code [9, 8] or stabilizer code [15] is a subspace of n-qubit Hilbert space(1) that is defined as the common eigenspace of a set of commuting Pauli operators of eigenvalue +1.”
BackgroundMethodUnitarity plus causality implies localizability
Arrighi, P., Nesme, V., & Werner, R. (2011) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2010.05.004 · Cited by 99
Cited by
High-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
A review of Quantum Cellular Automata
Farrelly, T. (2020) · Quantum · doi:10.22331/q-2020-11-30-368 · Cited by 138
“And Clifford QCAs play a role in understanding the properties of stabilizer codes in more general systems [73].”
Background
Metadata
- Authors
- Haah, J.
- Venue
- Revista Colombiana de Matemáticas
- Publisher
- Universidad Nacional de Colombia
- Published
- 2017-01-26
- Volume
- 50
- Issue
- 2
- Pages
- 299
- ISSN
- 0034-7426 (ISSN-L)
- 2357-4100
- OpenAlex
- W2467626191
- Cited by
- 52
- References
- 9
- FWCI
- 2.95
- Type
- journal article
- Language
- es
- Open access
- diamond
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: Algebraic Methods for Quantum Codes on Lattices. https://app.cochat.ai/papers/10.15446/recolma.v50n2.62214
- The paper
- Haah, J. (2017). Algebraic Methods for Quantum Codes on Lattices. Revista Colombiana de Matemáticas. https://doi.org/10.15446/recolma.v50n2.62214
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.