Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.16346

Algebraic Phase Theory III: Structural Quantum Codes over Frobenius Rings

Joe Gildea

Published Jan 22, 2026• 2 citations
arXivHTMLPDF

Abstract

We develop the quantum component of Algebraic Phase Theory by showing that quantum phase, Weyl noncommutativity, and stabiliser codes arise as unavoidable algebraic consequences of Frobenius duality. Working over finite commutative Frobenius rings, we extract nondegenerate phase pairings, Weyl operator algebras, and quantum stabiliser codes directly from admissible phase data, without assuming Hilbert spaces, analytic inner products, or an externally imposed symplectic structure. Within this framework, quantum state spaces appear as minimal carriers of faithful phase action, and stabiliser codes are identified canonically with self-orthogonal submodules under the Frobenius phase pairing. CSS-type constructions arise only as a special splitting case, while general Frobenius rings admit intrinsically non-CSS stabilisers. Nilpotent and torsion structure in the base ring give rise to algebraically protected quantum layers that are invisible to admissible Weyl-type errors. These results place quantum stabiliser theory within Algebraic Phase Theory: quantisation emerges as algebraic phase induction rather than analytic completion, and quantum structure is information-complete at the level of algebraic phase relations alone. Throughout, we work over finite Frobenius rings, which are precisely the base rings for which admissible phase data become strongly admissible, and in this regime the full quantum formalism is forced by Frobenius duality.

DOI
10.48550/arxiv.2601.16346

Related papers

Quantum codes over Finite Frobenius Rings

Anurupa Sarma

It is believed that quantum computers would be able to solve complex problems more quickly than any other deterministic or probabilistic computer. Quantum computers basically exploit the rules of quantum mechanics for speeding up computations. However, building a quantum computer remains a daunting task. A quantum computer, as in any quantum mechanical system, is susceptible to decohorence of quantum bits resulting from interaction of the stored information with the environment. Error correction is then required to restore a quantum bit, which has changed due to interaction with external state, to a previous non-erroneous state in the coding subspace. Until now the methods for quantum error correction were mostly based on stabilizer codes over finite fields. The aim of this thesis is to construct quantum error correcting codes over finite Frobenius rings. We introduce stabilizer codes over quadratic algebra, which allows one to use the hamming distance rather than some less known notion of distance. We also develop propagation rules to build new codes from existing codes. Non binary codes have been realized as a gray image of linear Z4 code, hence the most natural class of ring that is suitable for coding theory is given by finite Frobenius rings as it allow to formulate the dual code similar to finite fields. At the end we show some examples of code construction along with various results of quantum codes over finite Frobenius rings, especially codes over Zm.

•Oct 19, 2012•0 citations

Quantum codes over rings

Kenza Guenda, Thomas Aaron Gulliver

This paper considers the construction of quantum error correcting codes from linear codes over finite commutative Frobenius rings. We extend the Calderbank–Shor–Steane (CSS) construction to these rings. Further, quantum codes are extended to matrix product codes. Quantum codes over 𝔽pk are also obtained from linear codes over rings using the generalized Gray map.

International Journal of Quantum Information•Jun 1, 2014•17 citations

Quantum Error Correcting Codes and Fault-Tolerant Quantum Computation over Nice Rings

Sang-Jun Lee

Quantum error correcting codes play an essential role in protecting quantum information from the noise and the decoherence. Most quantum codes have been constructed based on the Pauli basis indexed by a finite field. With a newly introduced algebraic class called a nice ring, it is possible to construct the quantum codes such that their alphabet sizes are not restricted to powers of a prime.\n\nSubsystem codes are quantum error correcting schemes unifying stabilizer codes, decoherence free subspaces and noiseless subsystems. We show a generalization of subsystem codes over nice rings. Furthermore, we prove that free subsystem codes over a finite chain ring cannot outperform those over a finite field. We also generalize entanglement-assisted quantum error correcting codes to nice rings. With the help of the entanglement, any classical code can be used to derive the corresponding quantum codes, even if such codes are not self-orthogonal. We prove that an R-module with antisymmetric bicharacter can be decomposed as an orthogonal direct sum of hyperbolic pairs using symplectic geometry over rings. So, we can find hyperbolic pairs and commuting generators generating the check matrix of the entanglement-assisted quantum code.\n\nFault-tolerant quantum computation has been also studied over a finite field. Transversal operations are the simplest way to implement fault-tolerant quantum gates. We derive transversal Clifford operations for CSS codes over nice rings, including Fourier transforms, SUM gates, and phase gates. Since transversal operations alone cannot provide a computationally universal set of gates, we add fault-tolerant implementations of doubly-controlled Z gates for triorthogonal stabilizer codes over nice rings.\n\nFinally, we investigate optimal key exchange protocols for unconditionally secure key distribution schemes. We prove how many rounds are needed for the key exchange between any pair of the group on star networks, linear-chain networks, and general networks.

•Jun 29, 2017•0 citations

Equivalence of Classical and Quantum Codes

Tefjol Pllaha

Abstract: In classical and quantum information theory there are different types of error-correcting codes being used. We study the equivalence of codes via a classification of their isometries. The isometries of various codes over Frobenius alphabets endowed with various weights typically have a rich and predictable structure. On the other hand, when the alphabet is not Frobenius the isometry group behaves unpredictably. We use character theory to develop a duality theory of partitions over Frobenius bimodules, which is then used to study the equivalence of codes. We also consider instances of codes over non-Frobenius alphabets and establish their isometry groups. Secondly, we focus on quantum stabilizer codes over local Frobenius rings. We estimate their minimum distance and conjecture that they do not underperform quantum stabilizer codes over fields. We introduce symplectic isometries. Isometry groups of binary quantum stabilizer codes are established and then applied to the LU-LC conjecture. Copyright: © Tefjol Pllaha 2019

•Jan 1, 2019•0 citations

Geometry of Quantum Information Beyond Complex Numbers: A Review from Clifford Algebras, Division Algebras and Hopf Fibrations

Johan H. Rúa Muñoz, Santiago Pineda Montoya

We develop a comparative synthesis of quantum-information geometry beyond complex numbers, with emphasis on what different algebraic frameworks contribute to information-processing structure rather than on their formal novelty alone. The organizing idea is a layer-by-layer test of the standard complex Hilbert-space formalism: each non-complex or deformed framework modifies the scalar field, phase group, projective state space, Born-probability semantics, composition rule, measurement geometry, symmetry algebra or representation category. The central thesis is that such frameworks are physically meaningful when they identify which assumptions make complex quantum mechanics operationally stable: positive probabilities, associative multipartite composition, reversible dynamics, experimentally testable phases, locality constraints, informationally complete measurements, error bases and clear operational semantics. Real quantum theory probes the necessity of complex phases and local tomography; quaternionic quantum mechanics probes non-Abelian phase while retaining associativity and admitting complex embeddings; octonionic proposals probe the boundary where exceptional geometry survives but generic circuit composition is obstructed by non-associativity; Jordan algebras test ordered probabilistic state spaces; Clifford algebras and Bott periodicity provide the spinorial and topological grammar connecting gates, Hopf maps and periodic dimensions; and quantum-group or q-deformed constructions probe coproducts, braiding and representation categories rather than scalar amplitudes. We distinguish three roles that are often conflated: genuine hypercomplex kinematics, Hopf-fibration coordinates for ordinary complex multipartite entanglement, and deformed algebraic or categorical structures. The resulting map separates established equivalence and experimental-constraint results from useful representation tools and speculative programs, while identifying concrete open problems for non-complex quantum information.

Symmetry•Jun 14, 2026•2 citations

Algebraic Collapse, Modular Rigidity, and Sector Exclusion in Contractive Quantum Markov Semigroups: Structural Closure of the Canonical QMS Program

Rodgers Jeremy

This paper establishes the structural closure layer of the canonical QMS–spectral program. Working entirely within the framework of uniformly continuous quantum Markov semigroups (QMS) on von Neumann algebras, the paper proves that strict contractivity, faithful invariant states, and complementary slackness at active constraints force a series of nontrivial structural consequences. The results do not assume spacetime geometry, field equations, or particle content. They are operator-theoretic consequences of contractive fixed-point dynamics. The principal structural results include: Algebraic collapse at the active constraint surface via a quantitative pinching gap: superpositions of fixed-point and transient components are excluded exactly, not merely asymptotically. Born-exponent rigidity: modular implementability and the Jordan–von Neumann parallelogram characterization force the unique Schatten exponent p = 2 within the unitarily invariant operator norm family. Recovery of the Born probability rule via Gleason’s theorem once Hilbert geometry is enforced. Strict directedness of the non-fixed-point sector induced by spectral gap and contraction. Primitive completeness: the fixed-point algebra is completely characterized by the commutant of the GKSL generator data; no additional independent structural primitive exists. Exact constraint count equal to eight under bidual independence. Minimal admissible carrier classification: symmetric bilinear structure is uniquely compatible with the constraint budget; linear and higher-arity carriers are excluded. Sector parameter exclusion via Osterwalder–Schrader measure positivity: the deformation parameter theta must vanish in order for Euclidean positivity and positive-norm Hilbert space reconstruction to hold. The paper proves that once strict contractivity is imposed on structural data, the fixed-point algebra, probability geometry, carrier structure, and admissible sector parameters are rigidly determined. This completes the structural closure layer of the five-part canonical QMS–spectral program: Construction layer – canonical spectral bridge and OS positivity. Rigidity layer – spectral compactness, Weyl invariance, and capacity constraints. Structural closure layer – algebraic collapse, modular rigidity, primitive completeness, and sector exclusion (this paper). Universal reduction theorem – reduction from minimal relativistic QFT assumptions to the canonical framework. Universality theorem – forcing of Einstein dynamics at leading order. The present work contains no phenomenological assumptions and introduces no adjustable parameters. All results follow from operator-algebraic fixed-point structure and contractive dynamics.

•Feb 26, 2026•0 citations
We develop the quantum component of Algebraic Phase Theory by showing that quantum phase, Weyl noncommutativity, and stabiliser codes arise as unavoidable algebraic consequences of Frobenius duality. Working over finite commutative Frobenius rings, we extract nondegenerate phase pairings, Weyl operator algebras, and quantum stabiliser codes directly from admissible phase data, without assuming Hilbert spaces, analytic inner products, or an externally imposed symplectic structure. Within this framework, quantum state spaces appear as minimal carriers of faithful phase action, and stabiliser codes are identified canonically with self-orthogonal submodules under the Frobenius phase pairing. CSS-type constructions arise only as a special splitting case, while general Frobenius rings admit intrinsically non-CSS stabilisers. Nilpotent and torsion structure in the base ring give rise to algebraically protected quantum layers that are invisible to admissible Weyl-type errors. These results place quantum stabiliser theory within Algebraic Phase Theory: quantisation emerges as algebraic phase induction rather than analytic completion, and quantum structure is information-complete at the level of algebraic phase relations alone. Throughout, we work over finite Frobenius rings, which are precisely the base rings for which admissible phase data become strongly admissible, and in this regime the full quantum formalism is forced by Frobenius duality.
It is believed that quantum computers would be able to solve complex problems more quickly than any other deterministic or probabilistic computer. Quantum computers basically exploit the rules of quantum mechanics for speeding up computations. However, building a quantum computer remains a daunting task. A quantum computer, as in any quantum mechanical system, is susceptible to decohorence of quantum bits resulting from interaction of the stored information with the environment. Error correction is then required to restore a quantum bit, which has changed due to interaction with external state, to a previous non-erroneous state in the coding subspace. Until now the methods for quantum error correction were mostly based on stabilizer codes over finite fields. The aim of this thesis is to construct quantum error correcting codes over finite Frobenius rings. We introduce stabilizer codes over quadratic algebra, which allows one to use the hamming distance rather than some less known notion of distance. We also develop propagation rules to build new codes from existing codes. Non binary codes have been realized as a gray image of linear Z4 code, hence the most natural class of ring that is suitable for coding theory is given by finite Frobenius rings as it allow to formulate the dual code similar to finite fields. At the end we show some examples of code construction along with various results of quantum codes over finite Frobenius rings, especially codes over Zm.
Quantum error correcting codes play an essential role in protecting quantum information from the noise and the decoherence. Most quantum codes have been constructed based on the Pauli basis indexed by a finite field. With a newly introduced algebraic class called a nice ring, it is possible to construct the quantum codes such that their alphabet sizes are not restricted to powers of a prime.\n\nSubsystem codes are quantum error correcting schemes unifying stabilizer codes, decoherence free subspaces and noiseless subsystems. We show a generalization of subsystem codes over nice rings. Furthermore, we prove that free subsystem codes over a finite chain ring cannot outperform those over a finite field. We also generalize entanglement-assisted quantum error correcting codes to nice rings. With the help of the entanglement, any classical code can be used to derive the corresponding quantum codes, even if such codes are not self-orthogonal. We prove that an R-module with antisymmetric bicharacter can be decomposed as an orthogonal direct sum of hyperbolic pairs using symplectic geometry over rings. So, we can find hyperbolic pairs and commuting generators generating the check matrix of the entanglement-assisted quantum code.\n\nFault-tolerant quantum computation has been also studied over a finite field. Transversal operations are the simplest way to implement fault-tolerant quantum gates. We derive transversal Clifford operations for CSS codes over nice rings, including Fourier transforms, SUM gates, and phase gates. Since transversal operations alone cannot provide a computationally universal set of gates, we add fault-tolerant implementations of doubly-controlled Z gates for triorthogonal stabilizer codes over nice rings.\n\nFinally, we investigate optimal key exchange protocols for unconditionally secure key distribution schemes. We prove how many rounds are needed for the key exchange between any pair of the group on star networks, linear-chain networks, and general networks.
Abstract: In classical and quantum information theory there are different types of error-correcting codes being used. We study the equivalence of codes via a classification of their isometries. The isometries of various codes over Frobenius alphabets endowed with various weights typically have a rich and predictable structure. On the other hand, when the alphabet is not Frobenius the isometry group behaves unpredictably. We use character theory to develop a duality theory of partitions over Frobenius bimodules, which is then used to study the equivalence of codes. We also consider instances of codes over non-Frobenius alphabets and establish their isometry groups. Secondly, we focus on quantum stabilizer codes over local Frobenius rings. We estimate their minimum distance and conjecture that they do not underperform quantum stabilizer codes over fields. We introduce symplectic isometries. Isometry groups of binary quantum stabilizer codes are established and then applied to the LU-LC conjecture. Copyright: © Tefjol Pllaha 2019
We develop a comparative synthesis of quantum-information geometry beyond complex numbers, with emphasis on what different algebraic frameworks contribute to information-processing structure rather than on their formal novelty alone. The organizing idea is a layer-by-layer test of the standard complex Hilbert-space formalism: each non-complex or deformed framework modifies the scalar field, phase group, projective state space, Born-probability semantics, composition rule, measurement geometry, symmetry algebra or representation category. The central thesis is that such frameworks are physically meaningful when they identify which assumptions make complex quantum mechanics operationally stable: positive probabilities, associative multipartite composition, reversible dynamics, experimentally testable phases, locality constraints, informationally complete measurements, error bases and clear operational semantics. Real quantum theory probes the necessity of complex phases and local tomography; quaternionic quantum mechanics probes non-Abelian phase while retaining associativity and admitting complex embeddings; octonionic proposals probe the boundary where exceptional geometry survives but generic circuit composition is obstructed by non-associativity; Jordan algebras test ordered probabilistic state spaces; Clifford algebras and Bott periodicity provide the spinorial and topological grammar connecting gates, Hopf maps and periodic dimensions; and quantum-group or q-deformed constructions probe coproducts, braiding and representation categories rather than scalar amplitudes. We distinguish three roles that are often conflated: genuine hypercomplex kinematics, Hopf-fibration coordinates for ordinary complex multipartite entanglement, and deformed algebraic or categorical structures. The resulting map separates established equivalence and experimental-constraint results from useful representation tools and speculative programs, while identifying concrete open problems for non-complex quantum information.
This paper establishes the structural closure layer of the canonical QMS–spectral program. Working entirely within the framework of uniformly continuous quantum Markov semigroups (QMS) on von Neumann algebras, the paper proves that strict contractivity, faithful invariant states, and complementary slackness at active constraints force a series of nontrivial structural consequences. The results do not assume spacetime geometry, field equations, or particle content. They are operator-theoretic consequences of contractive fixed-point dynamics. The principal structural results include: Algebraic collapse at the active constraint surface via a quantitative pinching gap: superpositions of fixed-point and transient components are excluded exactly, not merely asymptotically. Born-exponent rigidity: modular implementability and the Jordan–von Neumann parallelogram characterization force the unique Schatten exponent p = 2 within the unitarily invariant operator norm family. Recovery of the Born probability rule via Gleason’s theorem once Hilbert geometry is enforced. Strict directedness of the non-fixed-point sector induced by spectral gap and contraction. Primitive completeness: the fixed-point algebra is completely characterized by the commutant of the GKSL generator data; no additional independent structural primitive exists. Exact constraint count equal to eight under bidual independence. Minimal admissible carrier classification: symmetric bilinear structure is uniquely compatible with the constraint budget; linear and higher-arity carriers are excluded. Sector parameter exclusion via Osterwalder–Schrader measure positivity: the deformation parameter theta must vanish in order for Euclidean positivity and positive-norm Hilbert space reconstruction to hold. The paper proves that once strict contractivity is imposed on structural data, the fixed-point algebra, probability geometry, carrier structure, and admissible sector parameters are rigidly determined. This completes the structural closure layer of the five-part canonical QMS–spectral program: Construction layer – canonical spectral bridge and OS positivity. Rigidity layer – spectral compactness, Weyl invariance, and capacity constraints. Structural closure layer – algebraic collapse, modular rigidity, primitive completeness, and sector exclusion (this paper). Universal reduction theorem – reduction from minimal relativistic QFT assumptions to the canonical framework. Universality theorem – forcing of Einstein dynamics at leading order. The present work contains no phenomenological assumptions and introduces no adjustable parameters. All results follow from operator-algebraic fixed-point structure and contractive dynamics.