Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes

• URL: http://arxiv.org/abs/2405.15057v2
• Date: Fri, 6 Sep 2024 17:27:22 GMT
• Title: Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes
• Authors: Martianus Frederic Ezerman, Markus Grassl, San Ling, Ferruh Özbudak, Buket Özkaya,
• Abstract summary: The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. A refined lower bound on the minimum distance of the resulting quantum codes is established. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.
• Score: 16.55015892533456
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. We expand the choices of the inner product to also cover the symplectic and trace-symplectic inner products, in addition to the original Hermitian one. A refined lower bound on the minimum distance of the resulting quantum codes is established and illustrated. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.

Related papers

• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes [4.299840769087443]
  Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance. We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
  arXiv  Detail & Related papers  (2024-01-15T10:38:13Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Decoding quantum Tanner codes [0.38073142980732994]
  We introduce sequential and parallel decoders for quantum Tanner codes. Our decoders provably correct arbitrary errors of weight linear in the code length. The same decoders are easily adapted to the expander lifted product codes of Panteleev and Kalachev.
  arXiv  Detail & Related papers  (2022-08-10T19:50:18Z)
• New Binary Quantum Codes Constructed from Quasi-Cyclic Codes [6.718184400443239]
  It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be symplectic dual-containing. As an application, we construct 8 binary quantum codes that exceed the best-known results.
  arXiv  Detail & Related papers  (2021-12-14T03:22:16Z)
• Dissipative Encoding of Quantum Information [0.45880283710344055]
  We explore the advantages of using Markovian evolution to prepare a quantum code in the desired logical space. We show that for stabilizer quantum codes on qubits, a finite-time dissipative encoder may always be constructed.
  arXiv  Detail & Related papers  (2021-02-08T21:07:08Z)
• Modifying method of constructing quantum codes from highly entangled states [0.0]
  We provide explicit constructions for codewords, encoding procedure and stabilizer formalism of the QECCs. We modify the method to produce another set of stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states.
  arXiv  Detail & Related papers  (2020-05-04T12:28:58Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.