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:2410.11252 · Experimental Mathematics

Khovanov Homology and Quantum Error-Correcting Codes

Rostislav Akhmechet, Milena Harned, Pranav Venkata Konda, Fugui Liu, Nikhil Mudumbi, Eric Yuang Shao, Zheheng Xiao

Published Apr 14, 2026• 1 citation
arXivHTMLPDF

Abstract

Error-correcting codes for quantum computing are crucial to address the fundamental problem of communication in the presence of noise and imperfections. Audoux used Khovanov homology to define families of quantum error-correcting codes with desirable properties. We explore Khovanov homology and some of its many extensions, namely reduced, annular, and sl3 homology, to generate new families of quantum codes and to establish several properties about codes that arise in this way, such as behavior of distance under Reidemeister moves or connected sums.

DOI
10.1080/10586458.2026.2615947

Related papers

An application of Khovanov homology to quantum codes

Benjamin Audoux

We use Khovanov homology to define families of LDPC quantum error-correcting codes: unknot codes with asymptotical parameters [[ \frac{3^{2 \ell+1}}{\sqrt{8\pi\ell}};1;2^\ell]] ; unlink codes with asymptotical parameters [[\sqrt{\frac{3}{2\pi \ell}}6^\ell;2^\ell;2^\ell ]] and (2,\ell) -torus link codes with asymptotical parameters [[n;1;d_n]] where d_n>\frac{\sqrt{n}}{1.62} .

arXiv:1307.4677•Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions•Jul 3, 2014•9 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

Hypermap-homology quantum codes

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 × m toric code to hypermap-homology codes gives us a [(3/2)m2, 2, m] code as compared to the toric code which is a [2m2, 2, m] code. Thus we can protect the same amount of quantum information, with the same error-correcting capability, using less physical qubits.

International Journal of Quantum Information•Jan 27, 2014•16 citations

Possible quantum algorithm for the Lipshitz-Sarkar-Steenrod square for Khovanov homology

Juan Ospina

Recently the celebrated Khovanov Homology was introduced as a target for Topological Quantum Computation given that the Khovanov Homology provides a generalization of the Jones polynomal and then it is possible to think about of a generalization of the Aharonov.-Jones-Landau algorithm. Recently, Lipshitz and Sarkar introduced a space-level refinement of Khovanov homology. which is called Khovanov Homotopy. This refinement induces a Steenrod square operation Sq2 on Khovanov homology which they describe explicitly and then some computations of Sq2 were presented. Particularly, examples of links with identical integral Khovanov homology but with distinct Khovanov homotopy types were showed. In the presente work we will introduce possible quantum algorithms for the Lipshitz- Sarkar-Steenrod square for Khovanov Homolog and their possible simulations using computer algebra.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 28, 2013•2 citations

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
Error-correcting codes for quantum computing are crucial to address the fundamental problem of communication in the presence of noise and imperfections. Audoux used Khovanov homology to define families of quantum error-correcting codes with desirable properties. We explore Khovanov homology and some of its many extensions, namely reduced, annular, and sl3 homology, to generate new families of quantum codes and to establish several properties about codes that arise in this way, such as behavior of distance under Reidemeister moves or connected sums.
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.
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 × m toric code to hypermap-homology codes gives us a [(3/2)m2, 2, m] code as compared to the toric code which is a [2m2, 2, m] code. Thus we can protect the same amount of quantum information, with the same error-correcting capability, using less physical qubits.
Recently the celebrated Khovanov Homology was introduced as a target for Topological Quantum Computation given that the Khovanov Homology provides a generalization of the Jones polynomal and then it is possible to think about of a generalization of the Aharonov.-Jones-Landau algorithm. Recently, Lipshitz and Sarkar introduced a space-level refinement of Khovanov homology. which is called Khovanov Homotopy. This refinement induces a Steenrod square operation Sq2 on Khovanov homology which they describe explicitly and then some computations of Sq2 were presented. Particularly, examples of links with identical integral Khovanov homology but with distinct Khovanov homotopy types were showed. In the presente work we will introduce possible quantum algorithms for the Lipshitz- Sarkar-Steenrod square for Khovanov Homolog and their possible simulations using computer algebra.
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.