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

Lecture notes in physics

2 The Automorphism Group of Quantum Mechanics

Gianni Cassinelli, Ernesto De Vito, PEKKA J. LAHTI, Alberto Levrero

Published Dec 9, 2004• 0 citations
Publisher
DOI
10.1007/978-3-540-44509-8_2

Related papers

Group theory in quantum mechanics

James Lindesay

Cambridge University Press eBooks•May 16, 2013•43 citations

Investigations on Automorphism Groups of Quantum Stabilizer Codes

Hanson Hao

The stabilizer formalism for quantum error-correcting codes has been, without doubt, the most successful at producing examples of quantum codes with strong error-correcting properties. In this paper, we discuss strong automorphism groups of stabilizer codes, beginning with the analogous notion from the theory of classical codes. Two weakenings of this concept, the weak automorphism group and Clifford-twisted automorphism group, are also discussed, along with many examples highlighting the possible relationships between the types of "automorphism groups". In particular, we construct an example of a $[[10,0,4]]$ stabilizer code showing how the Clifford-twisted automorphism groups might be connected to the Mathieu groups. Finally, nonexistence results are proved regarding stabilizer codes with highly transitive strong and weak automorphism groups, suggesting a potential inverse relationship between the error-correcting properties of a quantum code and the transitivity of those automorphism groups.

arXiv:2109.12735•Sep 27, 2021•6 citations

Group Theory in Quantum Mechanics

Elsevier eBooks•Jan 1, 1960•520 citations

Wigner's theorem for an infinite set

John Harding

Abstract It is well known that the closed subspaces of a Hilbert space form an orthomodular lattice. Elements of this orthomodular lattice are the propositions of a quantum mechanical system represented by the Hilbert space, and by Gleason’s theorem atoms of this orthomodular lattice correspond to pure states of the system. Wigner’s theorem says that the automorphism group of this orthomodular lattice corresponds to the group of unitary and anti-unitary operators of the Hilbert space. This result is of basic importance in the use of group representations in quantum mechanics. The closed subspaces A of a Hilbert space H ${\mathcal H}$ correspond to direct product decompositions H ≃ A × A ⊥ $\mathcal{H}\simeq A\times A^\perp$ of the Hilbert space, a result that lies at the heart of the superposition principle. In [10] it was shown that the direct product decompositions of any set, group, vector space, and topological space form an orthomodular poset. This is the basis for a line of study in foundational quantum mechanics replacing Hilbert spaces with other types of structures. It is the purpose of this note to prove a version of Wigner’s theorem: for an infinite set X, the automorphism group of the orthomodular poset Fact(X) of direct product decompositions of X is isomorphic to the permutation group of X. The structure Fact(X) plays the role for direct product decompositions of a set that the lattice of equivalence relations plays for surjective images of a set. So determining its automorphism group is of interest independent of its application to quantum mechanics. Other properties of Fact(X) are determined in proving our version of Wigner’s theorem, namely that Fact(X) is atomistic in a very strong way.

arXiv:1604.06973•Mathematica Slovaca•Oct 1, 2018•3 citations

Asymmetric graphs with quantum symmetry

Josse van Dobben de Bruyn, David E. Roberson, Simon Schmidt

Abstract We present an infinite sequence of finite graphs with trivial automorphism group and non‐trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are the first examples of any asymmetric classical space that has non‐trivial quantum symmetries. Our construction is based on solution groups to (binary) linear systems, as defined by Cleve, Liu, and Slofstra in the context of non‐local games. We first show that the dual quantum group of every solution group occurs as the quantum automorphism group of some graph, and then construct an infinite sequence of systems whose solution groups are non‐trivial perfect groups. This leads to the desired sequence of graphs. In addition to our main result, we prove a number of related results that allow us to answer several open problems from the literature. We prove a weak quantum analog of Frucht's theorem, namely that every finite classical group occurs as the quantum automorphism group of a finite graph. Combined with our main result, this shows that, for every finite group , there are graphs and that both have classical automorphism group isomorphic to but one of them has quantum symmetry and the other does not. Therefore, the quantum automorphism group of a graph is never determined by its classical automorphism group, and there do not exist any “quantum excluding groups.”

arXiv:2311.04889•Proceedings of the London Mathematical Society•Nov 1, 2025•9 citations

Group Representations in Quantum Mechanics

Teturô Inui, Yukito Tanabe, Yositaka Onodera

Springer series in solid-state sciences•Jan 1, 1990•0 citations
The stabilizer formalism for quantum error-correcting codes has been, without doubt, the most successful at producing examples of quantum codes with strong error-correcting properties. In this paper, we discuss strong automorphism groups of stabilizer codes, beginning with the analogous notion from the theory of classical codes. Two weakenings of this concept, the weak automorphism group and Clifford-twisted automorphism group, are also discussed, along with many examples highlighting the possible relationships between the types of "automorphism groups". In particular, we construct an example of a [[10,0,4]][[10,0,4]][[10,0,4]] stabilizer code showing how the Clifford-twisted automorphism groups might be connected to the Mathieu groups. Finally, nonexistence results are proved regarding stabilizer codes with highly transitive strong and weak automorphism groups, suggesting a potential inverse relationship between the error-correcting properties of a quantum code and the transitivity of those automorphism groups.
Abstract It is well known that the closed subspaces of a Hilbert space form an orthomodular lattice. Elements of this orthomodular lattice are the propositions of a quantum mechanical system represented by the Hilbert space, and by Gleason’s theorem atoms of this orthomodular lattice correspond to pure states of the system. Wigner’s theorem says that the automorphism group of this orthomodular lattice corresponds to the group of unitary and anti-unitary operators of the Hilbert space. This result is of basic importance in the use of group representations in quantum mechanics. The closed subspaces A of a Hilbert space H H{\mathcal H}H correspond to direct product decompositions H ≃ A × A ⊥ H≃A×A⊥\mathcal{H}\simeq A\times A^\perpH≃A×A⊥ of the Hilbert space, a result that lies at the heart of the superposition principle. In [10] it was shown that the direct product decompositions of any set, group, vector space, and topological space form an orthomodular poset. This is the basis for a line of study in foundational quantum mechanics replacing Hilbert spaces with other types of structures. It is the purpose of this note to prove a version of Wigner’s theorem: for an infinite set X, the automorphism group of the orthomodular poset Fact(X) of direct product decompositions of X is isomorphic to the permutation group of X. The structure Fact(X) plays the role for direct product decompositions of a set that the lattice of equivalence relations plays for surjective images of a set. So determining its automorphism group is of interest independent of its application to quantum mechanics. Other properties of Fact(X) are determined in proving our version of Wigner’s theorem, namely that Fact(X) is atomistic in a very strong way.
Abstract We present an infinite sequence of finite graphs with trivial automorphism group and non‐trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are the first examples of any asymmetric classical space that has non‐trivial quantum symmetries. Our construction is based on solution groups to (binary) linear systems, as defined by Cleve, Liu, and Slofstra in the context of non‐local games. We first show that the dual quantum group of every solution group occurs as the quantum automorphism group of some graph, and then construct an infinite sequence of systems whose solution groups are non‐trivial perfect groups. This leads to the desired sequence of graphs. In addition to our main result, we prove a number of related results that allow us to answer several open problems from the literature. We prove a weak quantum analog of Frucht's theorem, namely that every finite classical group occurs as the quantum automorphism group of a finite graph. Combined with our main result, this shows that, for every finite group , there are graphs and that both have classical automorphism group isomorphic to but one of them has quantum symmetry and the other does not. Therefore, the quantum automorphism group of a graph is never determined by its classical automorphism group, and there do not exist any “quantum excluding groups.”