Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1108.2886

Homological Error Correcting Codes and Systolic Geometry

Ethan Fetaya

Published Aug 14, 2011• 10 citations
arXivHTMLPDF

Abstract

In my masters thesis I prove a square root bound on the distance of homological codes that come from two dimensional surfaces, as a result of the systolic inequality. I also give a detailed version of M.H. Freedman's proof that due to systolic freedom, this bound does not hold in higher dimensions.
DOI
10.48550/arxiv.1108.2886

Related papers

QUANTUM ERROR CORRECTING CODES AND 4-DIMENSIONAL ARITHMETIC HYPERBOLIC MANIFOLDS

Larry Guth, Alexander Lubotzky

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 [superscript ε]. Their rate is evaluated via Euler characteristic arguments and their distance using Z[subscript 2] -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.

•Oct 1, 2013•77 citations

PhD thesis: Homological Quantum Codes Beyond the Toric Code

Nikolas P. Breuckmann

PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10.000 physical qubits. For codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold. Furthermore, we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnitude. We also show how to read and write the encoded qubits while keeping their connectivity low. In the second part we consider codes in which qubits are layed-out according to a four- dimensional geometry. Such codes allow for much simpler decoding schemes compared to codes which are two-dimensional. In particular, measurements do not necessarily have to be repeated to obtain reliable information about the error and the classical hardware performing the error correction is greatly simplified. We perform numerical simulations to analyze the performance of these codes using decoders based on local updates. We also introduce a novel decoder based on techniques from machine learning and image recognition to decode four-dimensional codes.

arXiv:1802.01520•Feb 5, 2018•21 citations

Homological error correction: Classical and quantum codes

Héctor Bombín, M. A. Martin-Delgado

We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for nonorientable surfaces it is impossible to construct homological codes based on qudits of dimension D>2, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension D. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor’s 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.

arXiv:quant-ph/0605094•Journal of Mathematical Physics•May 1, 2007•146 citations

Hypermap-Homology Quantum Codes (Ph.D. thesis)

Martin P. Leslie

We introduce a new type of sparse CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the possibility of developing fast decoders for them. Codes based on the homology of embeddings of graphs, such as Kitaev's toric code, have been discussed widely in the literature and our class of codes generalize these. We use embedded hypergraphs, which are a generalization of graphs that can have edges connected to more than two vertices. We develop theorems and examples of our hypermap-homology codes, especially in the case that we choose a special type of basis in our homology chain complex. In particular the most straightforward generalization of the $m \times m$ toric code to hypermap-homology codes gives us a $[(3/2)m^2,2,m]$ code as compared to the toric code which is a $[2m^2,2,m]$ code. Thus we can protect the same amount of quantum information, with the same error-correcting capability, using less physical qubits.

arXiv:1310.5376•Oct 20, 2013•1 citation

Z2-systolic freedom and quantum codes

Michael Hartley Freedman, David Meyer, Feng Luo

Abstract A closely coupled pair of conjectures/questions-one in differential geometry (by M. Gromov), the other in quantum information theory-are both answered in the negative. The answer derives from a certain metrical flexibility of manifolds and a corresponding improvement to the theoretical efficiency of existing local quantum codes. We exhibit this effect by constructing a family of metrics on S2 × S1, and other three and four dimensional manifolds. Quantitatively, the explicit “freedom” exhibited is too weak (a log1/2 factor in the natural scaling) to yield practical codes but we cannot rule out the possibility of other families of geometries with more dramatic freedom.

Chapman & Hall/CRC eBooks•Feb 14, 2002•95 citations

On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction

Gilles Zémor

Lecture notes in computer science•Jan 1, 2009•56 citations
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 [superscript ε]. Their rate is evaluated via Euler characteristic arguments and their distance using Z[subscript 2] -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.
PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10.000 physical qubits. For codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold. Furthermore, we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnitude. We also show how to read and write the encoded qubits while keeping their connectivity low. In the second part we consider codes in which qubits are layed-out according to a four- dimensional geometry. Such codes allow for much simpler decoding schemes compared to codes which are two-dimensional. In particular, measurements do not necessarily have to be repeated to obtain reliable information about the error and the classical hardware performing the error correction is greatly simplified. We perform numerical simulations to analyze the performance of these codes using decoders based on local updates. We also introduce a novel decoder based on techniques from machine learning and image recognition to decode four-dimensional codes.
We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for nonorientable surfaces it is impossible to construct homological codes based on qudits of dimension D>2, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension D. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor’s 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.
We introduce a new type of sparse CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the possibility of developing fast decoders for them. Codes based on the homology of embeddings of graphs, such as Kitaev's toric code, have been discussed widely in the literature and our class of codes generalize these. We use embedded hypergraphs, which are a generalization of graphs that can have edges connected to more than two vertices. We develop theorems and examples of our hypermap-homology codes, especially in the case that we choose a special type of basis in our homology chain complex. In particular the most straightforward generalization of the m×mm \times mm×m toric code to hypermap-homology codes gives us a [(3/2)m2,2,m][(3/2)m^2,2,m][(3/2)m2,2,m] code as compared to the toric code which is a [2m2,2,m][2m^2,2,m][2m2,2,m] code. Thus we can protect the same amount of quantum information, with the same error-correcting capability, using less physical qubits.
Abstract A closely coupled pair of conjectures/questions-one in differential geometry (by M. Gromov), the other in quantum information theory-are both answered in the negative. The answer derives from a certain metrical flexibility of manifolds and a corresponding improvement to the theoretical efficiency of existing local quantum codes. We exhibit this effect by constructing a family of metrics on S2 × S1, and other three and four dimensional manifolds. Quantitatively, the explicit “freedom” exhibited is too weak (a log1/2 factor in the natural scaling) to yield practical codes but we cannot rule out the possibility of other families of geometries with more dramatic freedom.