相关论文: An application of Khovanov homology to quantum cod…
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…
Using 4-dimensional arithmetic hyperbolic manifolds, we construct some new homological quantum error correcting codes. They are LDPC codes with linear rate and distance $n^\epsilon$. Their rate is evaluated via Euler characteristic…
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…
Knot, link, and tangle theory is crucial in both mathematical theory and practical application, including quantum physics, molecular biology, and structural chemistry. Unlike knots and links, tangles impose more relaxed constraints,…
Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their simple syndrome readout circuits and potential applications in fault-tolerant quantum computing. However, all families of quantum…
M. Khovanov and L. Rozansky gave a categorification of the HOMFLY-PT polynomial. This study is a generalization of the Khovanov-Rozansky homology. We define a homology associated to the quantum $(sl_n,\land V_n)$ link invariant, where…
The quantum error correction theory is as a rule formulated in a rather convoluted way, in comparison to classical algebraic theory. This work revisits the error correction in a noisy quantum channel so as to make it intelligible to…
A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not…
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…
We propose fault-tolerant encoders for quantum low-density parity check (LDPC) codes. By grouping qubits within a quantum code over contiguous blocks and applying preshared entanglement across these blocks, we show how transversal…
We compute the triply graded Khovanov-Rozansky homology of a family of links, including positive torus links and $\operatorname{Sym}^l$-colored torus knots.
We investigate properties of the odd Khovanov homology, compare and contrast them with those of the original (even) Khovanov homology, and discuss applications of the odd Khovanov homology to other areas of knot theory and low-dimensional…
We adapt Bar-Natan's scanning algorithm for fast computations in (even) Khovanov homology to odd Khovanov homology. We use a mapping cone construction instead of a tensor product, which allows us to deal efficiently with the more…
Khovanov homology is a recently introduced invariant of oriented links in $\mathbb{R}^3$. It categorifies the Jones polynomial in the sense that the (graded) Euler characteristic of the Khovanov homology is a version of the Jones polynomial…
This paper begins with a survey of some applications of Khovanov homology to low-dimensional topology, with an eye toward extending these results to $\mathfrak{sl}(n)$ homologies. We extend Levine and Zemke's ribbon concordance obstruction…
We derive two families of EA-QC quantum LDPC (EA-QC-QLDPC) codes by tiling permutation matrices of prime and composite orders. The unassisted portion of the Tanner graphs corresponding to these codes, constructed from two distinct classical…
Two link diagrams on compact surfaces are strongly equivalent if they are related by Reidemeister moves and orientation preserving homeomorphisms of the surfaces. They are stably equivalent if they are related by the two previous operations…
In these notes, I will sketch a new approach to Khovanov homology of knots and links based on counting the solutions of certain elliptic partial differential equations in four and five dimensions. The equations are formulated on four and…
We compute explicitly the Khovanov polynomials (using the computer program from katlas.org) for the two simplest families of the satellite knots, which are the twisted Whitehead doubles and the two-strand cables. We find that a quantum…
Quantum LDPC codes may provide a path to build low-overhead fault-tolerant quantum computers. However, as general LDPC codes lack geometric constraints, na\"ive layouts couple many distant qubits with crossing connections which could be…