Triorthogonal Codes and Self-dual Codes

• URL: http://arxiv.org/abs/2408.09685v1
• Date: Mon, 19 Aug 2024 03:47:09 GMT
• Title: Triorthogonal Codes and Self-dual Codes
• Authors: Minjia Shi, Haodong Lu, Jon-Lark Kim, Patrick Sole,
• Abstract summary: We give an algorithm to construct binary triorthogonal matrices from binary self-dual codes. We generalize to this setting the classical coding techniques of shortening and extending.
• Score: 16.728666221394857
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Triorthogonal matrices were introduced in Quantum Information Theory in connection with distillation of magic states (Bravyi and Haah (2012)). We give an algorithm to construct binary triorthogonal matrices from binary self-dual codes. Further, we generalize to this setting the classical coding techniques of shortening and extending. We also give some simple propagation rules.

Related papers

• 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)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• 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)
• Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
  We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-21T01:47:17Z)
• 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)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• Classification of Small Triorthogonal Codes [0.30458514384586394]
  Triorthogonal codes are a class of quantum error correcting codes used in magic state distillation protocols. We classify all triorthogonal codes with $n+kle 38$, where $n$ is the number of physical qubits and $k is the number of qubits of the code. In an appendix independent of the main text, we improve a magic state distillation protocol by reducing the time variance due to Clifford corrections.
  arXiv  Detail & Related papers  (2021-07-20T18:00:08Z)
• Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal and quasi-unitary matrices [18.763290930749235]
  Matrix-product codes over finite fields are an important class of long linear codes. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length.
  arXiv  Detail & Related papers  (2020-12-31T16:17:37Z)
• Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians [6.85316573653194]
  We give an algorithm that explicitly constructs quantum codes with linear distance and constant rate. Motivated by quantum LDPC codes and the use of physics to protect quantum information, we introduce a new 2-local frustration free quantum spin chain Hamiltonian.
  arXiv  Detail & Related papers  (2020-12-02T19:00:19Z)
• Quantum XYZ Product Codes [0.3222802562733786]
  We study a three-fold variant of the hypergraph product code construction, differing from the standard homological product of three classical codes. When instantiated with 3 classical LDPC codes, this "XYZ product" yields a non CSS quantum LDPC code which might display a large minimum distance.
  arXiv  Detail & Related papers  (2020-11-19T09:50:08Z)
• Auto-Encoding Twin-Bottleneck Hashing [141.5378966676885]
  This paper proposes an efficient and adaptive code-driven graph. It is updated by decoding in the context of an auto-encoder. Experiments on benchmarked datasets clearly show the superiority of our framework over the state-of-the-art hashing methods.
  arXiv  Detail & Related papers  (2020-02-27T05:58:12Z)

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.