Quantum-rigid random quantum graphs
Alexandru Chirvasitu, Piotr M. So{\l}tan, Mateusz Wasilewski

TL;DR
This paper investigates quantum automorphism groups of quantum graphs, showing that both classical and quantum symmetries are generically trivial under broad conditions, extending classical results to the quantum setting.
Contribution
It demonstrates that quantum automorphism groups of quantum graphs are generically trivial, providing a quantum analogue of classical almost-rigidity results.
Findings
Quantum automorphism groups are generically trivial for a broad class of quantum graphs.
Classical symmetry groups of quantum graphs are also generically trivial.
The universal preserver of the quantum adjacency matrix relates to a different quantum automorphism group.
Abstract
A quantum graph housed by a matrix algebra can be encoded as an operator system . There are two sensible notions of quantum automorphism group for any such: , capturing the quantum symmetries of the adjacency matrix attached to , and , the quantum group acting universally on so as to preserve its structure, standard trace, and subspace . The two quantum groups coincide classically, but diverge in general. We nevertheless show that both are generically trivial in the sense that they are so for ranging over a non-empty Zariski-open set under all reasonable dimensional constraints on and . This extends analogous prior results by the first and third authors to the…
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.
