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

Lettere al nuovo cimento della societa italiana di fisica/Lettere al nuovo cimento

On implemented state automorphisms within the logico-algebraic approach to deterministic mechanics

F. A. Barone

Published Jan 1, 1981• 2 citations
Publisher
DOI
10.1007/bf02817033

Related papers

The Logico-Algebraic Approach to Quantum Mechanics

Springer eBooks•Jan 1, 1979•162 citations

The Logico-Algebraic Approach to Quantum Mechanics

C. A. Hooker

Springer eBooks•Jan 1, 1975•124 citations

From Logic to Physics: The Logico-Algebraic Foundations of Quantum Theory

Gianpiero Cattaneo, Federico Laudisa

Springer eBooks•Jan 1, 1999•0 citations

On the time evolution automorphisms of the CCR-algebra for quantum mechanics

M. Fannes, André F. Verbeure

Communications in Mathematical Physics•Sep 1, 1974•26 citations

State automorphisms in axiomatic quantum mechanics

Stanley Gudder

International Journal of Theoretical Physics•Apr 1, 1973•11 citations

Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure

AJ Davenport, John Blue, Isaac Chuang

Automorphisms of quantum codes, when they exist, offer a pathway toward fault-tolerant gate implementation via qubit relabeling. Although useful, the conditions under which automorphisms appear in a given code remain poorly understood. In this paper, we develop an algebraic framework for systematically analyzing and engineering automorphisms in Generalized Bicycle (GB) codes. Central to our approach is the derivation of a three-space dependency between the polynomial ring space, the parity check matrix space, and the $\mathbb{F}_2^{2\ell}$ qubit space, similar to the structure found in the study of classical cyclic codes. By expressing GB codes as a pair of cyclic submodules of $R_\ell^2$, where $R_\ell \cong \mathbb{F}_2[x]/\langle x^\ell-1\rangle$, we reduce the search for code automorphisms to a deterministic algebraic problem, deriving necessary and sufficient conditions for the existence of block-separable automorphisms built from cyclic shifts, ring automorphisms and block-swaps. We connect these conditions to the fold-transversal gate framework, providing explicit criteria for the existence of $H$-, $S$-, and $CX$-type fold-transversal gates. We further discuss structured bases for logical operators in order to determine the logical action of a given automorphism. Finally, we introduce the Maximal Cube Root (MCR) code family, a family of GB codes constructed around the principle of maximizing automorphism flexibility and fold-CX gates. We demonstrate a collection of $k=2$ MCR codes up to $d=13$ generating the 2-qubit Clifford group via automorphism and fold-transversal gates, with stabilizer weight ranging from 8 to 16, and $k>2$ MCR codes with a minimum of 20 distinct logical gates achievable from automorphisms. This serves as a first demonstration of inverse design: using these methods to build codes around a rich automorphism structure from the ground up.

quant-pharXiv:2606.05044•Jun 4, 2026•7 citations
Automorphisms of quantum codes, when they exist, offer a pathway toward fault-tolerant gate implementation via qubit relabeling. Although useful, the conditions under which automorphisms appear in a given code remain poorly understood. In this paper, we develop an algebraic framework for systematically analyzing and engineering automorphisms in Generalized Bicycle (GB) codes. Central to our approach is the derivation of a three-space dependency between the polynomial ring space, the parity check matrix space, and the F22ℓ\mathbb{F}_2^{2\ell}F22ℓ​ qubit space, similar to the structure found in the study of classical cyclic codes. By expressing GB codes as a pair of cyclic submodules of Rℓ2R_\ell^2Rℓ2​, where Rℓ≅F2[x]/⟨xℓ−1⟩R_\ell \cong \mathbb{F}_2[x]/\langle x^\ell-1\rangleRℓ​≅F2​[x]/⟨xℓ−1⟩, we reduce the search for code automorphisms to a deterministic algebraic problem, deriving necessary and sufficient conditions for the existence of block-separable automorphisms built from cyclic shifts, ring automorphisms and block-swaps. We connect these conditions to the fold-transversal gate framework, providing explicit criteria for the existence of HHH-, SSS-, and CXCXCX-type fold-transversal gates. We further discuss structured bases for logical operators in order to determine the logical action of a given automorphism. Finally, we introduce the Maximal Cube Root (MCR) code family, a family of GB codes constructed around the principle of maximizing automorphism flexibility and fold-CX gates. We demonstrate a collection of k=2k=2k=2 MCR codes up to d=13d=13d=13 generating the 2-qubit Clifford group via automorphism and fold-transversal gates, with stabilizer weight ranging from 8 to 16, and k>2k>2k>2 MCR codes with a minimum of 20 distinct logical gates achievable from automorphisms. This serves as a first demonstration of inverse design: using these methods to build codes around a rich automorphism structure from the ground up.