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:1807.09107 · Journal of Algebra and Its Applications

Symplectic isometries of stabilizer codes

Tefjol Pllaha

Published Dec 26, 2018• 5 citations
arXivHTMLPDF

Abstract

In this paper, we study the equivalence of quantum stabilizer codes via symplectic isometries of stabilizer codes. We define monomially and symplectically equivalent stabilizer codes and determine how different the two notions can be. Further, we show that monomial maps correspond to local Clifford operators. We relate the latter with the LU-LC Conjecture.

DOI
10.1142/s0219498820500218

Related papers

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

Local unitary versus local Clifford equivalence of stabilizer states

Maarten Van den Nest, Jeroen Dehaene, Bart De Moor

We study the relation between local unitary (LU) equivalence and local Clifford (LC) equivalence of stabilizer states. We introduce a large subclass of stabilizer states, such that every two LU equivalent states in this class are necessarily LC equivalent. Together with earlier results, this shows that LC, LU, and stochastic local operation with classical communication equivalence are the same notions for this class of stabilizer states. Moreover, recognizing whether two given stabilizer states in the present subclass are locally equivalent only requires a polynomial number of operations in the number of qubits.

arXiv:quant-ph/0411115•Physical Review A•Jun 1, 2005•75 citations

Finite set of invariants to characterize local Clifford equivalence of stabilizer states

Maarten Van den Nest, Jeroen Dehaene, Bart De Moor

The classification of stabilizer states under local Clifford (LC) equivalence is of particular importance in quantum error-correction and measurement-based quantum computation. Two stabilizer states are called LC equivalent if there exists a local Clifford operation which maps the first state to the second. We present a finite set of invariants which completely characterizes the LC equivalence class of any stabilizer state. Our invariants have simple descriptions within the binary framework in which stabilizer states are usually described.

arXiv:quant-ph/0410165•Physical Review A•Jul 20, 2005•20 citations

Stabilizer codes over general phase spaces

Sayan Chakraborty, Victor V. Albert

We develop a theory of stabilizer codes whose stabilizer groups consist of commuting qudit Paulis, oscillator displacements, and/or planar-rotor displacements. We consider codes whose stabilizer groups form generalized lattices in quantum phase space, a condition that guarantees a finite logical dimension. We construct oscillator-rotor, rotor-qudit, and oscillator-rotor-qubit codes that cannot be decomposed into separate subsystems by generalized Clifford transformations. We also introduce an oscillator-qubit code arising from a partially lifted Golay code, where Construction A is applied to half of the Golay code coordinates. We derive analytical forms of logical operators from the symplectic dual lattice, determine Clifford-Gaussian gates from lattice symmetries, show that the code dimension equals the covolume of the stabilizer lattice, and organize the syndrome subspaces into a vector bundle. Our technique builds on earlier non-commutative geometric results by Rieffel, but it can often be interpreted simply as concatenating a given stabilizer code with a Gottesman-Kitaev-Preskill (GKP) code, applying conventional lattice-theoretic results, and unconcatenating. We formulate distances, optimal decoding, and quantum weight enumerators, recovering the Pauli, qudit, and GKP versions together with known MacWilliams identities. We construct finite-energy codewords whose encoding is an isometry up to an error exponentially small in the inverse damping parameter.

quant-pharXiv:2610.04694•Oct 6, 2026•0 citations

Local unitary versus local Clifford equivalence of stabilizer and graph states

Bei Zeng, Hyeyoun Chung, Andrew W. Cross +1 more

The equivalence of stabilizer states under local transformations is of fundamental interest in understanding properties and uses of entanglement. Two stabilizer states are equivalent under the usual stochastic local operations and classical communication criterion if and only if they are equivalent under local unitary (LU) operations. More surprisingly, under certain conditions, two LU-equivalent stabilizer states are also equivalent under local Clifford (LC) operations, as was shown by Van den Nest et al. [Phys. Rev. A 71, 062323 (2005)]. Here, we broaden the class of stabilizer states for which LU equivalence implies LC equivalence $(\mathrm{LU}\ensuremath{\Leftrightarrow}\mathrm{LC})$ to include all stabilizer states represented by graphs with cycles of length neither 3 nor 4. To compare our result with Van den Nest et al.'s, we show that any stabilizer state of distance $\ensuremath{\delta}=2$ is beyond their criterion. We then further prove that $\mathrm{LU}\ensuremath{\Leftrightarrow}\mathrm{LC}$ holds for a more general class of stabilizer states of $\ensuremath{\delta}=2$. We also explicitly construct graphs representing $\ensuremath{\delta}>2$ stabilizer states which are beyond their criterion: we identify all 58 graphs with up to 11 vertices and construct graphs with ${2}^{m}\ensuremath{-}1$ $(m\ensuremath{\geqslant}4)$ vertices using quantum error-correcting codes which have non-Clifford transversal gates.

arXiv:quant-ph/0611214•Physical Review A•Mar 19, 2007•53 citations

A Classification of Invertible Stabilizer Codes

Geiko, Roman, Shuklin, Georgii

We develop a framework for the classification of invertible translation-invariant stabilizer codes modulo condensation and stabilization with simple codes. Our stabilizer codes generalize the Pauli codes: they are extracted from local commuting projector Hamiltonians whose terms are made of local alphabets more general than the Pauli operators. In particular, not all such codes can be entangled/disentangled with Clifford Quantum Cellular Automata. We compute their Witt-equivalence classes in any spatial dimension in terms of relative L-theory groups. In particular, we show that the group of equivalence classes of such codes in three spatial dimensions is isomorphic to the Witt group of abelian topological orders in two spatial dimensions. In four spatial dimensions we obtain a group of order two, conjecturally corresponding to the non-trivial invertible phase. Additionally, we propose a representing spectrum for the generalized cohomology theory corresponding to the invertible stabilizer codes.

arXiv:2512.01142•Nov 30, 2025•3 citations
In this paper, we study the equivalence of quantum stabilizer codes via symplectic isometries of stabilizer codes. We define monomially and symplectically equivalent stabilizer codes and determine how different the two notions can be. Further, we show that monomial maps correspond to local Clifford operators. We relate the latter with the LU-LC Conjecture.
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 study the relation between local unitary (LU) equivalence and local Clifford (LC) equivalence of stabilizer states. We introduce a large subclass of stabilizer states, such that every two LU equivalent states in this class are necessarily LC equivalent. Together with earlier results, this shows that LC, LU, and stochastic local operation with classical communication equivalence are the same notions for this class of stabilizer states. Moreover, recognizing whether two given stabilizer states in the present subclass are locally equivalent only requires a polynomial number of operations in the number of qubits.
The classification of stabilizer states under local Clifford (LC) equivalence is of particular importance in quantum error-correction and measurement-based quantum computation. Two stabilizer states are called LC equivalent if there exists a local Clifford operation which maps the first state to the second. We present a finite set of invariants which completely characterizes the LC equivalence class of any stabilizer state. Our invariants have simple descriptions within the binary framework in which stabilizer states are usually described.
We develop a theory of stabilizer codes whose stabilizer groups consist of commuting qudit Paulis, oscillator displacements, and/or planar-rotor displacements. We consider codes whose stabilizer groups form generalized lattices in quantum phase space, a condition that guarantees a finite logical dimension. We construct oscillator-rotor, rotor-qudit, and oscillator-rotor-qubit codes that cannot be decomposed into separate subsystems by generalized Clifford transformations. We also introduce an oscillator-qubit code arising from a partially lifted Golay code, where Construction A is applied to half of the Golay code coordinates. We derive analytical forms of logical operators from the symplectic dual lattice, determine Clifford-Gaussian gates from lattice symmetries, show that the code dimension equals the covolume of the stabilizer lattice, and organize the syndrome subspaces into a vector bundle. Our technique builds on earlier non-commutative geometric results by Rieffel, but it can often be interpreted simply as concatenating a given stabilizer code with a Gottesman-Kitaev-Preskill (GKP) code, applying conventional lattice-theoretic results, and unconcatenating. We formulate distances, optimal decoding, and quantum weight enumerators, recovering the Pauli, qudit, and GKP versions together with known MacWilliams identities. We construct finite-energy codewords whose encoding is an isometry up to an error exponentially small in the inverse damping parameter.
The equivalence of stabilizer states under local transformations is of fundamental interest in understanding properties and uses of entanglement. Two stabilizer states are equivalent under the usual stochastic local operations and classical communication criterion if and only if they are equivalent under local unitary (LU) operations. More surprisingly, under certain conditions, two LU-equivalent stabilizer states are also equivalent under local Clifford (LC) operations, as was shown by Van den Nest et al. [Phys. Rev. A 71, 062323 (2005)]. Here, we broaden the class of stabilizer states for which LU equivalence implies LC equivalence $(\mathrm{LU}\ensuremath{\Leftrightarrow}\mathrm{LC})$ to include all stabilizer states represented by graphs with cycles of length neither 3 nor 4. To compare our result with Van den Nest et al.'s, we show that any stabilizer state of distance $\ensuremath{\delta}=2$ is beyond their criterion. We then further prove that $\mathrm{LU}\ensuremath{\Leftrightarrow}\mathrm{LC}$ holds for a more general class of stabilizer states of $\ensuremath{\delta}=2$. We also explicitly construct graphs representing $\ensuremath{\delta}>2$ stabilizer states which are beyond their criterion: we identify all 58 graphs with up to 11 vertices and construct graphs with ${2}^{m}\ensuremath{-}1$ $(m\ensuremath{\geqslant}4)$ vertices using quantum error-correcting codes which have non-Clifford transversal gates.
We develop a framework for the classification of invertible translation-invariant stabilizer codes modulo condensation and stabilization with simple codes. Our stabilizer codes generalize the Pauli codes: they are extracted from local commuting projector Hamiltonians whose terms are made of local alphabets more general than the Pauli operators. In particular, not all such codes can be entangled/disentangled with Clifford Quantum Cellular Automata. We compute their Witt-equivalence classes in any spatial dimension in terms of relative L-theory groups. In particular, we show that the group of equivalence classes of such codes in three spatial dimensions is isomorphic to the Witt group of abelian topological orders in two spatial dimensions. In four spatial dimensions we obtain a group of order two, conjecturally corresponding to the non-trivial invertible phase. Additionally, we propose a representing spectrum for the generalized cohomology theory corresponding to the invertible stabilizer codes.