Maximally Extendable Sheaf Codes

• URL: http://arxiv.org/abs/2403.03651v1
• Date: Wed, 6 Mar 2024 12:20:49 GMT
• Title: Maximally Extendable Sheaf Codes
• Authors: Pavel Panteleev and Gleb Kalachev
• Abstract summary: We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes. We introduce a new property of a sheaf code, called maximalibility, which ensures that within class of codes on the same coded space, we encounter as few obstructions as possible.
• Score: 5.439020425819001
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes, Sipser-Spielman codes, and their more recent high-dimensional analogs, can be naturally represented as sheaf codes on simplicial and cubical complexes, considered as coded spaces. We introduce a new property of a sheaf code, called maximal extendibility, which ensures that within a class of codes on the same coded space, we encounter as few obstructions as possible when extending local sections globally. We show that in every class of sheaf codes defined on the same space and parameterized by parity-check matrices with polynomial entries, there always exists a maximally extendable sheaf code. Such codes are very interesting since it is possible to show that maximally extendable tensor product codes are good coboundary expanders, which potentially could be used to attack the qLTC conjecture.

Related papers

• Decoding Quasi-Cyclic Quantum LDPC Codes [23.22566380210149]
  Quantum low-density parity-check (qLDPC) codes are an important component in the quest for fault tolerance. Recent progress on qLDPC codes has led to constructions which are quantumally good, and which admit linear-time decoders to correct errors affecting a constant fraction of codeword qubits. In practice, the surface/toric codes, which are the product of two repetition codes, are still often the qLDPC codes of choice.
  arXiv  Detail & Related papers  (2024-11-07T06:25:27Z)
• Class of codes correcting absorptions and emissions [59.90381090395222]
  We construct a family of quantum codes that protect against all emission, absorption, dephasing, and raising/lowering errors up to an arbitrary fixed order. We derive simplified error correction conditions for a general AE code and show that any permutation-invariant code that corrects $le t$ errors can be mapped to an AE code.
  arXiv  Detail & Related papers  (2024-10-04T16:14:03Z)
• 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)
• CSS code surgery as a universal construction [51.63482609748332]
  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes. We describe code surgery between such codes using a specific colimit in the category of chain complexes.
  arXiv  Detail & Related papers  (2023-01-31T16:17:25Z)
• Grand Unification of continuous-variable codes [0.0]
  Quantum error correction codes in continuous variables (also called CV codes, or single-mode bosonic codes) have been identified to be a technologically viable option for building fault-tolerant quantum computers. Best-known examples are the GKP code and the cat-code, both of which were shown to have some advantageous properties over any discrete-variable, or qubit codes. It was recently shown that the cat-code, as well as other kinds of CV codes, belong to a set of codes with common properties called rotation-symmetric codes.
  arXiv  Detail & Related papers  (2022-06-03T18:00:01Z)
• 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)
• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks [0.0]
  We represent complex code constructions as tensor networks built from the tensors of simple codes or states. The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes. We lay out some examples where we glue together simple stabilizer codes to construct non-trivial codes.
  arXiv  Detail & Related papers  (2021-09-16T18:00:00Z)
• KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning [76.5589486928387]
  Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes. In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs. KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
  arXiv  Detail & Related papers  (2021-08-29T21:08:30Z)
• 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)
• Approximate Bacon-Shor Code and Holography [0.0]
  We explicitly construct a class of holographic quantum error correction codes with non-algebra centers. We use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing) We then construct approximate versions of the holographic hybrid codes by "skewing" the code subspace.
  arXiv  Detail & Related papers  (2020-10-12T18:39:09Z)

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.