相关论文: An application of Khovanov homology to quantum cod…
We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum…
We use a special kind of 2-dimensional extended Topological Quantum Field Theories (TQFTs), so-called open-closed TQFTs, in order to extend Khovanov homology from links to arbitrary tangles, not necessarily even. For every plane diagram of…
In this work, we introduce a new family of [[6k, 2k, 2]] codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight-two logical operators and are…
Quantum error correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a…
In this paper we show that there is a cut-off in the Khovanov homology of $(2k,2kn)$-torus links, namely that the maximal homological degree of non-zero homology group of $(2k,2kn)$-torus link is $2k^2n$. Furthermore, we calculate…
Khovanov homology is an invariant for links in the three sphere that categorizes the Jones polynomial. We extend Khovanov's construction to links in 3-manifolds that are connected sums of orientable interval bundles over surfaces. Cutting…
We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear…
By considering a version of Khovanov homology incorporating both the Lee and $E(-1)$ differentials, we construct a $1$-parameter family of concordance homomorphisms similar to the Upsilon invariant from knot Floer homology. This invariant…
Qudits offer significant advantages over qubit-based architectures, including more efficient gate compilation, reduced resource requirements, improved error-correction primitives, and enhanced capabilities for quantum communication and…
Quantum computers hold the potential to surpass classical computers in solving complex computational problems. However, the fragility of quantum information and the error-prone nature of quantum operations make building large-scale,…
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear encoding rate, polynomial scaling distance and efficient decoding schemes. The code family is based on tessellations of closed,…
In this paper, we discuss a proof of the isotopy invariance of a parametrized Khovanov link homology including categorifications of the Jones polynomial and the Kauffman bracket polynomial though it is a known fact. In order to present a…
We present an efficient decoding algorithm for constant rate quantum hypergraph-product LDPC codes which provably corrects adversarial errors of weight $\Omega(\sqrt{n})$ for codes of length $n$. The algorithm runs in time linear in the…
In the cabling procedure for HOMFLY polynomials colored HOMFLY polynomials of a knot are obtained from ordinary HOMFLY of the cabled knot with extra twists added. Thus colored polynomials can be seen as relation between HOMFLYs of cabled…
Quantum low-density parity-check (qLDPC) codes are an important component in the quest for quantum fault tolerance. Dramatic recent progress on qLDPC codes has led to constructions which are asymptotically good, and which admit linear-time…
We adapt a construction of Guth and Lubotzky [arXiv:1310.5555] to obtain a family of quantum LDPC codes with non-vanishing rate and minimum distance scaling like $n^{0.1}$ where $n$ is the number of physical qubits. Similarly as in…
We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with $O(n \log^2 n)$ gates can be used to encode $k$ qubits in $n$ qubits with a distance $d$ provided…
A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…
We study approximate quantum low-density parity-check (QLDPC) codes, which are approximate quantum error-correcting codes specified as the ground space of a frustration-free local Hamiltonian, whose terms do not necessarily commute. Such…
A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudo-random nature, and the new…