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:1307.4677 · Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions

An application of Khovanov homology to quantum codes

Benjamin Audoux

Published Jul 3, 2014• 9 citations
arXivHTMLPDF

Abstract

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} .

DOI
10.4171/aihpd/6

Related papers

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

Homological quantum error correcting codes and real projective space

Vivien Londe

Homological quantum error correcting codes and real projective space

•Apr 23, 2017•0 citations

Khovanov Homology and Quantum Error-Correcting Codes

Rostislav Akhmechet, Milena Harned, Pranav Venkata Konda +4 more

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.

arXiv:2410.11252•Experimental Mathematics•Apr 14, 2026•1 citation

Khánh Mathematica Institutum Paper 12: Homotopy Theory of Quantum Error Correcting Codes and Topological Quantum Computation

Nguyễn Kim Khánh

•Jul 6, 2026•0 citations

A quantum algorithm for Khovanov homology

Alexander Schmidhuber, Reilly, Michele, Paolo Zanardi +2 more

Khovanov homology is a topological knot invariant that categorifies the Jones polynomial, recognizes the unknot, and is conjectured to appear as an observable in $4D$ supersymmetric Yang--Mills theory. Despite its rich mathematical and physical significance, the computational complexity of Khovanov homology remains largely unknown. To address this challenge, this work initiates the study of efficient quantum algorithms for Khovanov homology. We provide simple proofs that increasingly accurate additive approximations to the ranks of Khovanov homology are DQC1-hard, BQP-hard, and #P-hard, respectively. For the first two approximation regimes, we propose a novel quantum algorithm. Our algorithm is efficient provided the corresponding Hodge Laplacian thermalizes in polynomial time and has a sufficiently large spectral gap, for which we give numerical and analytical evidence. Our approach introduces a pre-thermalization procedure that allows our quantum algorithm to succeed even if the Betti numbers of Khovanov homology are much smaller than the dimensions of the corresponding chain spaces, overcoming a limitation of prior quantum homology algorithms. We introduce novel connections between Khovanov homology and graph theory to derive analytic lower bounds on the spectral gap.

arXiv:2501.12378•Jan 21, 2025•16 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
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} .
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.
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.
Khovanov homology is a topological knot invariant that categorifies the Jones polynomial, recognizes the unknot, and is conjectured to appear as an observable in 4D4D4D supersymmetric Yang--Mills theory. Despite its rich mathematical and physical significance, the computational complexity of Khovanov homology remains largely unknown. To address this challenge, this work initiates the study of efficient quantum algorithms for Khovanov homology. We provide simple proofs that increasingly accurate additive approximations to the ranks of Khovanov homology are DQC1-hard, BQP-hard, and #P-hard, respectively. For the first two approximation regimes, we propose a novel quantum algorithm. Our algorithm is efficient provided the corresponding Hodge Laplacian thermalizes in polynomial time and has a sufficiently large spectral gap, for which we give numerical and analytical evidence. Our approach introduces a pre-thermalization procedure that allows our quantum algorithm to succeed even if the Betti numbers of Khovanov homology are much smaller than the dimensions of the corresponding chain spaces, overcoming a limitation of prior quantum homology algorithms. We introduce novel connections between Khovanov homology and graph theory to derive analytic lower bounds on the spectral gap.