Quantum symmetry in multigraphs (part I)
Debashish Goswami, Sk Asfaq Hossain

TL;DR
This paper introduces and explores various notions of quantum symmetry in multigraphs, showing how they relate to existing concepts and identifying conditions under which genuine quantum symmetry exists.
Contribution
It defines new notions of quantum symmetry for multigraphs and demonstrates their relation to existing theories, highlighting conditions for genuine quantum symmetry.
Findings
All notions reduce to known quantum symmetries in simple graphs.
Multigraphs with multiple edges between at least two pairs of vertices have genuine quantum symmetry.
The study extends quantum symmetry concepts from simple graphs to multigraphs.
Abstract
We introduce various notions of quantum symmetry in a directed or undirected multigraph with no isolated vertex and explore relations among them. If the multigraph is single edged (that is, a simple graph where loops are allowed), all our notions of quantum symmetry reduce to already existing notions of quantum symmetry provided by Bichon and Banica. Our constructions also show that any multigraph with at least two pairs of vertices with multiple edges among them possesses genuine quantum symmetry.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
