AI & ML
Quantum Anticodes
arXiv math.IT0 views
arXiv:2512.13891v2 Announce Type: replace-cross 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. It also yields new descriptions of weight enumerators, including a quantum analogue of Greene's theorem relating weight enumerators to polymatroid invariants.
Source:https://arxiv.org/abs/2512.13891PreviousSolomonoff induction of selected bits and online classificationNextThe Post-Training Dilemma: Why We Should Rethink the Sequential SFT-RL Paradigm
Related posts
Hydra · Coeziune OM–IA — the complete DOI registry (2026-11-20): 8 published works
0dev.to OpenSource
Stop Renting Cloud GPUs & VPS: 4 Legitimate Free Compute Tiers in 2026 (Plus Billing Pitfalls)
0dev.to OpenSource
How to Decode a Wall of Wingdings Without a Key
0dev.to Programming
Beyond the Hype: How Modern Businesses Can Actually Benefit from AI Today
0dev.to Programming
How to Free Up Space on Android Without Deleting Anything
0dev.to Programming

All my git repos in one file: manage them day to day, rebuild them on a new machine
0dev.to Git