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

arXiv:2605.30428v1 Announce Type: new Abstract: 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 principl