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

Journal of Physics Conference Series

Projective representations from quantum enhanced graph symmetries

Ralph M. Kaufmann, Sergei Khlebnikov, Birgit Wehefritz–Kaufmann

Published Apr 13, 2015• 3 citations
Publisher

Abstract

We define re-gaugings and enhanced symmetries for graphs with group labels on their edges. These give rise to interesting projective representations of subgroups of the automorphism groups of the graphs. We furthermore embed this construction into several higher levels of generalization using category theory and show that they are natural in that language. These include projective representations of the re-gauging groupoid and a novel generalization to all symmetries of the graph.

DOI
10.1088/1742-6596/597/1/012048

Related papers

Solution group representations as quantum symmetries of graphs

David E. Roberson, Simon Schmidt

In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that the quantum automorphism group of such a colored graph is the dual of the homogeneous solution group of the underlying linear constraint system. Given a vertex- and edge-colored graph with certain properties, we construct an uncolored graph that has the same quantum automorphism group as the colored graph we started with. Using those results, we obtain the first known example of a graph that has quantum symmetry and finite quantum automorphism group. Furthermore, we construct a pair of quantum isomorphic, non-isomorphic graphs that both have no quantum symmetry.

arXiv:2111.12362•Journal of the London Mathematical Society•Jul 11, 2022•6 citations

Von Neumann subfactors and non-invertible symmetries

Xingyang Yu, Hao Y. Zhang

We use the language of von Neumann subfactors to investigate non-invertible symmetries in two dimensions. A fusion categorical symmetry \mathcal{C} 𝒞 , its module category \mathcal{M} ℳ , and a gauging labeled by an algebra object \mathcal{A} 𝒜 are encoded in the bipartite principal graph of a subfactor. The dual principal graph captures the quantum symmetry \mathcal{C}' 𝒞 ′ obtained by gauging \mathcal{A} 𝒜 in \mathcal{C} 𝒞 , as well as a reverse gauging back to \mathcal{C} 𝒞 . From a given subfactor N \subset M N ⊂ M , we derive a quiver diagram that encodes the representations of the associated non-invertible symmetry. We show how this framework provides necessary conditions for admissible gaugings, enabling the construction of generalized orbifold groupoids. To illustrate this strategy, we present three examples: Rep (D_4) ( D 4 ) as a warm-up, the higher-multiplicity case Rep (A_4) ( A 4 ) with its associated generalized orbifold groupoid and triality symmetry, and Rep (A_5) ( A 5 ) , where A_5 A 5 is the smallest non-solvable finite group. For applications to gapless systems, we embed these generalized gaugings as global manipulations on the conformal manifolds of c=1 c = 1 CFTs and uncover new self-dualities in the exceptional SU(2)_1/A_5 S U ( 2 ) 1 / A

arXiv:2504.05374•SciPost Physics•Dec 15, 2025•3 citations

Graph automorphisms to obtain Clifford symmetries in open and closed qudit models

Charlie Nation, Rick P. A. Simon, Shreya Banerjee +4 more

In the recent article [arXiv:2605.18966], we demonstrated that finding Clifford symmetries can be mapped to a Graph Automorphism (GA) problem. Here, we provide an algorithm to obtain such symmetries on general qudit systems, that works on the principle of encoding Clifford invariants of a Hamiltonian onto properties of a graph. Labelling Hamiltonian terms as vertices, a permutation of such vertices that respects the Clifford invariants (a GA) is both a valid Clifford, and a symmetry up to phase correction checks. We test this on multiple physical models and discuss the scaling with respect to the number of qudits and Pauli strings, as well as various strategies for optimisation in different regimes. We further show that the graph automorphism representation of Clifford symmetries can be expanded to open quantum systems.

quant-pharXiv:2605.30428•Jun 1, 2026•0 citations

Higher categorical symmetries and gauging in two-dimensional spin systems

Clement Delcamp, Apoorv Tiwari

We present a framework to systematically investigate higher categorical symmetries in two-dimensional spin systems. Though exotic, such generalised symmetries have been shown to naturally arise as dual symmetries upon gauging invertible symmetries. Our framework relies on an approach to dualities whereby dual quantum lattice models only differ in a choice of module 2-category over some input fusion 2-category. Given an arbitrary two-dimensional spin system with an ordinary symmetry, we explain how to perform the (twisted) gauging of any of its sub-symmetries. We then demonstrate that the resulting model has a symmetry structure encoded into the Morita dual of the input fusion 2-category with respect to the corresponding module 2-category. We exemplify this approach by specialising to certain finite group generalisations of the transverse-field Ising model, for which we explicitly define lattice symmetry operators organised into fusion 2-categories of higher representations of higher groups.

arXiv:2301.01259•SciPost Physics•Apr 23, 2024•59 citations

Automorphism in Gauge Theories: Higher Symmetries and Transversal Non-Clifford Logical Gates

Po-Shen Hsin, Ryohei Kobayashi

Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge theories induced by automorphisms of the gauge group, when the gauge theories have nontrivial topological actions in different spacetime dimensions. We discover the automorphism symmetry can be extended, become a higher group symmetry, and/or become a non-invertible symmetry. We illustrate the discussion with various models in field theory and on the lattice. In particular, we use automorphism symmetry to construct new transversal non-Clifford logical gates in topological quantum codes. In particular, we show that 2+1d $\mathbb{Z}_N$ qudit Clifford stabilizer models can implement non-Clifford transversal logical gate in the 4th level $\mathbb{Z}_N$ qudit Clifford hierarchy for $N\geq 3$, extending the generalized Bravyi-König bound proposed in the companion paper [arXiv:2511.02900] for qubits.

cond-mat.str-elCross-listedarXiv:2511.15783•SciPost Physics•Nov 21, 2025•0 citations

The Morita Theory of Quantum Graph Isomorphisms

Benjamin Musto, David Reutter, Dominic Verdon

We classify instances of quantum pseudo-telepathy in the graph isomorphism game, exploiting the recently discovered connection between quantum information and the theory of quantum automorphism groups. Specifically, we show that graphs quantum isomorphic to a given graph are in bijective correspondence with Morita equivalence classes of certain Frobenius algebras in the category of finite-dimensional representations of the quantum automorphism algebra of that graph. We show that such a Frobenius algebra may be constructed from a central type subgroup of the classical automorphism group, whose action on the graph has coisotropic vertex stabilisers. In particular, if the original graph has no quantum symmetries, quantum isomorphic graphs are classified by such subgroups. We show that all quantum isomorphic graph pairs corresponding to a well-known family of binary constraint systems arise from this group-theoretical construction. We use our classification to show that, of the small order vertex-transitive graphs with no quantum symmetry, none is quantum isomorphic to a non-isomorphic graph. We show that this is in fact asymptotically almost surely true of all graphs.

arXiv:1801.09705•Communications in Mathematical Physics•Sep 7, 2018•36 citations
We define re-gaugings and enhanced symmetries for graphs with group labels on their edges. These give rise to interesting projective representations of subgroups of the automorphism groups of the graphs. We furthermore embed this construction into several higher levels of generalization using category theory and show that they are natural in that language. These include projective representations of the re-gauging groupoid and a novel generalization to all symmetries of the graph.
In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that the quantum automorphism group of such a colored graph is the dual of the homogeneous solution group of the underlying linear constraint system. Given a vertex- and edge-colored graph with certain properties, we construct an uncolored graph that has the same quantum automorphism group as the colored graph we started with. Using those results, we obtain the first known example of a graph that has quantum symmetry and finite quantum automorphism group. Furthermore, we construct a pair of quantum isomorphic, non-isomorphic graphs that both have no quantum symmetry.
We use the language of von Neumann subfactors to investigate non-invertible symmetries in two dimensions. A fusion categorical symmetry \mathcal{C} 𝒞 , its module category \mathcal{M} ℳ , and a gauging labeled by an algebra object \mathcal{A} 𝒜 are encoded in the bipartite principal graph of a subfactor. The dual principal graph captures the quantum symmetry \mathcal{C}' 𝒞 ′ obtained by gauging \mathcal{A} 𝒜 in \mathcal{C} 𝒞 , as well as a reverse gauging back to \mathcal{C} 𝒞 . From a given subfactor N \subset M N ⊂ M , we derive a quiver diagram that encodes the representations of the associated non-invertible symmetry. We show how this framework provides necessary conditions for admissible gaugings, enabling the construction of generalized orbifold groupoids. To illustrate this strategy, we present three examples: Rep (D_4) ( D 4 ) as a warm-up, the higher-multiplicity case Rep (A_4) ( A 4 ) with its associated generalized orbifold groupoid and triality symmetry, and Rep (A_5) ( A 5 ) , where A_5 A 5 is the smallest non-solvable finite group. For applications to gapless systems, we embed these generalized gaugings as global manipulations on the conformal manifolds of c=1 c = 1 CFTs and uncover new self-dualities in the exceptional SU(2)_1/A_5 S U ( 2 ) 1 / A
In the recent article [arXiv:2605.18966], we demonstrated that finding Clifford symmetries can be mapped to a Graph Automorphism (GA) problem. Here, we provide an algorithm to obtain such symmetries on general qudit systems, that works on the principle of encoding Clifford invariants of a Hamiltonian onto properties of a graph. Labelling Hamiltonian terms as vertices, a permutation of such vertices that respects the Clifford invariants (a GA) is both a valid Clifford, and a symmetry up to phase correction checks. We test this on multiple physical models and discuss the scaling with respect to the number of qudits and Pauli strings, as well as various strategies for optimisation in different regimes. We further show that the graph automorphism representation of Clifford symmetries can be expanded to open quantum systems.
We present a framework to systematically investigate higher categorical symmetries in two-dimensional spin systems. Though exotic, such generalised symmetries have been shown to naturally arise as dual symmetries upon gauging invertible symmetries. Our framework relies on an approach to dualities whereby dual quantum lattice models only differ in a choice of module 2-category over some input fusion 2-category. Given an arbitrary two-dimensional spin system with an ordinary symmetry, we explain how to perform the (twisted) gauging of any of its sub-symmetries. We then demonstrate that the resulting model has a symmetry structure encoded into the Morita dual of the input fusion 2-category with respect to the corresponding module 2-category. We exemplify this approach by specialising to certain finite group generalisations of the transverse-field Ising model, for which we explicitly define lattice symmetry operators organised into fusion 2-categories of higher representations of higher groups.
Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge theories induced by automorphisms of the gauge group, when the gauge theories have nontrivial topological actions in different spacetime dimensions. We discover the automorphism symmetry can be extended, become a higher group symmetry, and/or become a non-invertible symmetry. We illustrate the discussion with various models in field theory and on the lattice. In particular, we use automorphism symmetry to construct new transversal non-Clifford logical gates in topological quantum codes. In particular, we show that 2+1d ZN\mathbb{Z}_NZN​ qudit Clifford stabilizer models can implement non-Clifford transversal logical gate in the 4th level ZN\mathbb{Z}_NZN​ qudit Clifford hierarchy for N≥3N\geq 3N≥3, extending the generalized Bravyi-König bound proposed in the companion paper [arXiv:2511.02900] for qubits.
We classify instances of quantum pseudo-telepathy in the graph isomorphism game, exploiting the recently discovered connection between quantum information and the theory of quantum automorphism groups. Specifically, we show that graphs quantum isomorphic to a given graph are in bijective correspondence with Morita equivalence classes of certain Frobenius algebras in the category of finite-dimensional representations of the quantum automorphism algebra of that graph. We show that such a Frobenius algebra may be constructed from a central type subgroup of the classical automorphism group, whose action on the graph has coisotropic vertex stabilisers. In particular, if the original graph has no quantum symmetries, quantum isomorphic graphs are classified by such subgroups. We show that all quantum isomorphic graph pairs corresponding to a well-known family of binary constraint systems arise from this group-theoretical construction. We use our classification to show that, of the small order vertex-transitive graphs with no quantum symmetry, none is quantum isomorphic to a non-isomorphic graph. We show that this is in fact asymptotically almost surely true of all graphs.