English
Related papers

Related papers: The geometry of non-additive stabiliser codes

200 papers

The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum…

Quantum Physics · Physics 2013-10-14 Yun-Jiang Wang , Bei Zeng , Markus Grassl , Barry C. Sanders

We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is…

Information Theory · Computer Science 2025-06-05 Simeon Ball , Tabriz Popatia

We review the main features of a mathematical framework encompassing some of the salient quantum mechanical and geometrical aspects of Hall systems with finite size and general boundary conditions. Geometrical as well as algebraic…

Mesoscale and Nanoscale Physics · Physics 2008-09-18 J. C. Wallet

Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…

Information Theory · Computer Science 2023-05-10 W. Lu , X. Wu , X. W. Cao , G. J. Luo , X. P. Qin

Zipper codes are a framework for describing spatially-coupled product-like codes. Many well-known codes, such as staircase codes and braided block codes, are subsumed into this framework. New types of codes such as tiled diagonal and…

Information Theory · Computer Science 2024-10-31 Alvin Y. Sukmadji , Umberto Martínez-Peñas , Frank R. Kschischang

General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and…

Information Theory · Computer Science 2016-10-05 Yun Fan , Liang Zhang

In this paper, we construct additively graceful signed graphs S from a given graph G that may be additively graceful or not be additively graceful. We also show the construction of additively graceful signed graphs from additively graceful…

Combinatorics · Mathematics 2026-04-01 Mukti Acharya

We introduce the first geometric construction of codes in the sum-rank metric, which we called linearized Algebraic Geometry codes, using quotients of the ring of Ore polynomials with coefficients in the function field of an algebraic…

Algebraic Geometry · Mathematics 2024-05-30 Elena Berardini , Xavier Caruso

We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem…

Quantum Physics · Physics 2007-07-13 Salah A. Aly , Andreas Klappenecker , Pradeep Kiran Sarvepalli

We construct a family of two-dimensional topological stabilizer codes on continuous variable (CV) degrees of freedom, which generalize homological rotor codes and the toric-GKP code. Our topological codes are built using the concept of…

We present a general construction of asymmetric quantum codes based on additive codes under the trace Hermitian inner product. Various families of additive codes over $\F_{4}$ are used in the construction of many asymmetric quantum codes…

Information Theory · Computer Science 2013-07-04 Martianus Frederic Ezerman , San Ling , Patrick Sole

This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…

Optimization and Control · Mathematics 2026-02-17 Patrick L. Combettes , Javier I. Madariaga

In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…

Information Theory · Computer Science 2025-06-03 Puyin Wang , Jinquan Luo

A method to combine two quantum error-correcting codes is presented. Even when starting with additive codes, the resulting code might be non-additive. Furthermore, the notion of the erasure space is introduced which gives a full…

Quantum Physics · Physics 2007-05-23 Markus Grassl , Thomas Beth

Quantum error-correcting codes can be used to protect qubits involved in quantum computation. This requires that logical operators acting on protected qubits be translated to physical operators (circuits) acting on physical quantum states.…

Information Theory · Computer Science 2021-08-20 Narayanan Rengaswamy , Robert Calderbank , Swanand Kadhe , Henry D. Pfister

We construct a series of examples of non--flat non--homogeneous parabolic geometries that carry a symmetry of the parabolic geometry at each point.

Differential Geometry · Mathematics 2016-03-22 Jan Gregorovič , Lenka Zalabová

The compass model on a square lattice provides a natural template for building subsystem stabilizer codes. The surface code and the Bacon-Shor code represent two extremes of possible codes depending on how many gauge qubits are fixed. We…

Quantum Physics · Physics 2019-06-05 Muyuan Li , Daniel Miller , Michael Newman , Yukai Wu , Kenneth R. Brown

We introduce a new primitive, called welding, for combining two stabilizer codes to produce a new stabilizer code. We apply welding to construct surface codes and then use the surface codes to construct solid codes, a variant of a 3-d toric…

Quantum Physics · Physics 2012-08-20 Kamil Michnicki

The geometry of the moduli space of stable spin curves is studied, with emphasis on its combinatorial properties. In this context, the standard graph theoretic framework is not just a book-keeping device: some purely combinatorial results…

Algebraic Geometry · Mathematics 2007-05-23 Lucia Caporaso , Cinzia Casagrande

Here it is shown how to combine two generically globally rigid bar frameworks in $d$-space to get another generically globally rigid framework. The construction is to identify $d+1$ vertices from each of the frameworks and erase one of the…

Metric Geometry · Mathematics 2011-03-31 Robert Connelly