Quick Navigation

Topics

Quantum Error Correction Fault Tolerance Open Quantum Systems Decoherence

Khovanov homology and quantum error-correcting codes

arXiv
Authors: Rostislav Akhmechet, Milena Harned, Pranav Venkata Konda, Felix Shanglin Liu, Nikhil Mudumbi, Eric Yuang Shao, Zheheng Xiao

Year

2024

Paper ID

38104

Status

Preprint

Abstract Read

~2 min

Abstract Words

82

Citations

N/A

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 mathfrak{sl}3 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.

Why This Paper Matters

  • This paper contributes to the Quantum Error Correction & Fault Tolerance research area in the Quantum Articles archive.
  • It adds a 2024 reference point for readers tracking recent quantum research.
  • Error-correcting codes for quantum computing are crucial to address the fundamental problem of communication in the presence of noise and imperfections.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #38104

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.