Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Using 4-dimensional arithmetic hyperbolic manifolds, we construct some new homological quantum error correcting codes. They are low density parity check codes with linear rate and distance nε. Their rate is evaluated via Euler characteristic arguments and their distance using \documentclass[12pt]{minimal}\begin{document}$\mathbb {Z}_2$\end{document}Z2-systolic geometry. This construction answers a question of Zémor [“On Cayley graphs, surface codes, and the limits of homological coding for quantum error correction,” in Proceedings of Second International Workshop on Coding and Cryptology (IWCC), Lecture Notes in Computer Science Vol. 5557 (2009), pp. 259–273], who asked whether homological codes with such parameters could exist at all.
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
A simple intrinsic proof of the Gauss-Bonnet formula for closed Riemannian manifolds
Chern, S.-S. (1944) · The Annals of Mathematics · doi:10.2307/1969302 · Cited by 471
Cited by
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
“[68] L.”
BackgroundAsymptotically good Quantum and locally testable classical LDPC codes
Panteleev, P., & Kalachev, G. (2022) · Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3519935.3520017 · Cited by 222
“Up until very recently [6, 26, 27, 44], the best provable lower bounds on the distances of qLDPC codes were, up to polylogarithmic factors, at most of the order √ n as the number of qubits n → ∞ [12, 18, 19, 23, 33, 48].”
BackgroundConstant 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
“Possible candidate families include surface codes [5], 4-dimensional topological codes [6] and hypergraph product codes [7].”
Background
Metadata
- Authors
- Guth, L., & Lubotzky, A.
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 2014-08-01
- Volume
- 55
- Issue
- 8
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W2272435756
- Cited by
- 53
- References
- 1
- FWCI
- 2.64
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds. https://app.cochat.ai/papers/10.1063/1.4891487
- The paper
- Guth, L., & Lubotzky, A. (2014). Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds. Journal of Mathematical Physics. https://doi.org/10.1063/1.4891487
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.