Quantum Anticodes

• URL: http://arxiv.org/abs/2512.13891v1
• Date: Mon, 15 Dec 2025 20:49:03 GMT
• Title: Quantum Anticodes
• Authors: ChunJun Cao, Giuseppe Cotardo, Brad Lackey,
• Abstract summary: This work introduces a symplectic framework for quantum error correcting codes in which local structure is analyzed through an anticode perspective.<n>Anticodes arise as maximal symplectic subspaces whose elements vanish on a prescribed set of components, providing a quantum analogue of their classical counterparts.
• Score: 6.88204255655161
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work introduces a symplectic framework for quantum error correcting codes in which local structure is analyzed through an anticode perspective. In this setting, a code is treated as a symplectic space, and anticodes arise as maximal symplectic subspaces whose elements vanish on a prescribed set of components, providing a natural quantum analogue of their classical counterparts. This framework encompasses several families of quantum codes, including stabilizer and subsystem codes, provides a natural extension of generalized distances in quantum codes, and yields new invariants that capture local algebraic and combinatorial features. The notion of anticodes also naturally leads to operations such as puncturing and shortening for symplectic codes, which in turn provide algebraic interpretations of key phenomena in quantum error correction, such as the cleaning lemma and complementary recovery and yield new descriptions of weight enumerators.

Related papers

• Symmetry-Based Quantum Codes Beyond the Pauli Group [0.0]
  stabilizer codes aim to solve the general problem of fault-tolerance without regard for the structure of a specific system.<n>We provide a generalized framework that allows the code designer to take this structure into account.<n>We show that all stabilizer codes are a special case of this construction, including qudit stabilizer codes.
  arXiv  Detail & Related papers  (2025-12-08T01:34:11Z)
• Denotational semantics for stabiliser quantum programs [0.0]
  We develop a sound, universal and complete denotational semantics for stabiliser operations.<n>We demonstrate the power of the resulting semantics by describing a small, proof-of-concept assembly language for stabiliser programs.
  arXiv  Detail & Related papers  (2025-11-27T19:51:43Z)
• Structure Theorem for Quantum Replacer Codes [5.5807436820313345]
  Quantum replacer codes are codes that can be protected from errors induced by a given set of quantum replacer channels.<n>We prove a structure theorem for such codes that synthesizes a variety of special cases with earlier theoretical work in quantum error correction.
  arXiv  Detail & Related papers  (2025-05-10T14:22:31Z)
• Avoided-crossings, degeneracies and Berry phases in the spectrum of quantum noise through analytic Bloch-Messiah decomposition [49.1574468325115]
  "analytic Bloch-Messiah decomposition" provides approach for characterizing dynamics of quantum optical systems.<n>We show that avoided crossings arise naturally when a single parameter is varied, leading to hypersensitivity of the singular vectors.<n>We highlight the possibility of programming the spectral response of photonic systems through the deliberate design of avoided crossings.
  arXiv  Detail & Related papers  (2025-04-29T13:14:15Z)
• Quantum Lifting for Invertible Permutations and Ideal Ciphers [47.33103206862089]
  We derive the first lifting theorems for establishing security in the quantum random permutation and ideal cipher models.<n>These theorems relate the success probability of an arbitrary quantum adversary to that of a classical algorithm making only a small number of classical queries.
  arXiv  Detail & Related papers  (2025-04-25T09:07:55Z)
• Beyond Integral-Domain Stabilizer Codes [0.0]
  Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations.<n>This work lays out central methods for working with composite dimensional systems, enabling full use of the computational space of some systems.
  arXiv  Detail & Related papers  (2025-01-08T23:58:13Z)
• Khovanov homology and quantum error-correcting codes [0.0]
  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 $mathfraksl_3$ homology, to generate new families of quantum codes.
  arXiv  Detail & Related papers  (2024-10-15T04:18:53Z)
• 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)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• On reconstruction of states from evolution induced by quantum dynamical semigroups perturbed by covariant measures [50.24983453990065]
  We show the ability to restore states of quantum systems from evolution induced by quantum dynamical semigroups perturbed by covariant measures. Our procedure describes reconstruction of quantum states transmitted via quantum channels and as a particular example can be applied to reconstruction of photonic states transmitted via optical fibers.
  arXiv  Detail & Related papers  (2023-12-02T09:56:00Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)

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.