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:2603.09401 · Ukrainian Mathematical Journal

On Quantum Symmetries of Graphs

Olha Ostrovska, Vasyl Ostrovskyi, Lyudmila B. Turowska

Published Oct 23, 2026• 0 citations
arXivHTMLPDF
DOI
10.1007/s11253-026-02649-7

Related papers

Quantum graphs: Self-adjoint, and yet exhibiting a nontrivial PT -symmetry

Pavel Exner, Miloš Tater

arXiv:2108.04708•Physics Letters A•Sep 6, 2021•10 citations

On the properties of simple quantum graphs

Pavel Hejčík

•Jan 1, 2008•0 citations

Characterizing graph symmetries through quantum Jensen-Shannon divergence

Luca Rossi, Andrea Torsello A, Edwin R. Hancock +1 more

In this paper we investigate the connection between quantum walks and graph symmetries. We begin by designing an experiment that allows us to analyze the behavior of the quantum walks on the graph without causing the wave function collapse. To achieve this, we base our analysis on the recently introduced quantum Jensen-Shannon divergence. In particular, we show that the quantum Jensen-Shannon divergence between the evolution of two quantum walks with suitably defined initial states is maximum when the graph presents symmetries. Hence, we assign to each pair of nodes of the graph a value of the divergence, and we average over all pairs of nodes to characterize the degree of symmetry possessed by a graph.

Physical Review E•Sep 10, 2013•44 citations

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•8 citations

Quantum graphs special section

Waves in Random Media•Jan 1, 2004•0 citations

Basics of Quantum Graphs

Sovan Samanta, Antonios Kalampakas, Tofigh Allahviranloo

Studies in computational intelligence•Jan 1, 2025•0 citations
In this paper we investigate the connection between quantum walks and graph symmetries. We begin by designing an experiment that allows us to analyze the behavior of the quantum walks on the graph without causing the wave function collapse. To achieve this, we base our analysis on the recently introduced quantum Jensen-Shannon divergence. In particular, we show that the quantum Jensen-Shannon divergence between the evolution of two quantum walks with suitably defined initial states is maximum when the graph presents symmetries. Hence, we assign to each pair of nodes of the graph a value of the divergence, and we average over all pairs of nodes to characterize the degree of symmetry possessed by a 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.