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

• URL: http://arxiv.org/abs/2605.30428v1
• Date: Thu, 28 May 2026 18:00:10 GMT
• Title: Graph automorphisms to obtain Clifford symmetries in open and closed qudit models
• Abstract summary: We provide an algorithm to obtain Clifford symmetries on general qudit systems.<n>We show that the graph automorphism representation of Clifford symmetries can be expanded to open quantum systems.
• Score: 33.81183023775755
• License: http://creativecommons.org/licenses/by/4.0/
• 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 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.

Related papers

• Clifford symmetries in quantum many-body systems [33.81183023775755]
  We leverage the classically efficient Clifford group to find symmetries for arbitrary many-body Hamiltonians via a graph representation.<n>We demonstrate our method on random and physical Hamiltonians, with instances of up to one thousand qubits and demonstrate how our approach can provide deeper understanding of the model.
  arXiv  Detail & Related papers  (2026-05-18T18:00:23Z)
• Efficient Identification of Permutation Symmetries in Many-Body Hamiltonians via Graph Theory [2.5782420501870296]
  This paper introduces a new method that identifies this symmetry group by establishing an isomorphism between the Hamiltonian's permutation group and the automorphism group of a coloured bipartite graph constructed from the Hamiltonian.<n>We show that for physical Hamiltonians with bounded locality and interaction degree, the resulting graph has a bounded degree, reducing the computational problem of finding the automorphism group to time.<n>This work provides a general, structurally exact tool for algorithmic symmetry finding, enabling the scalable application of these symmetries to Hamiltonian simulation problems.
  arXiv  Detail & Related papers  (2025-11-28T13:16:20Z)
• Automorphism in Gauge Theories: Higher Symmetries and Transversal Non-Clifford Logical Gates [0.0]
  We study symmetries in gauge theories induced by automorphisms of the gauge group.<n>In particular, we use automorphism symmetry to construct new non-Clifford logical gates in topological quantum codes.
  arXiv  Detail & Related papers  (2025-11-19T19:00:00Z)
• Meson spectroscopy of exotic symmetries of Ising criticality in Rydberg atom arrays [39.58317527488534]
  Coupling two Ising chains in a ladder leads to an even richer $mathcalD(1)_8$ symmetries.<n>Here, we probe these emergent symmetries in a Rydberg atom processing unit, leveraging its geometry to realize both chain and ladder configurations.
  arXiv  Detail & Related papers  (2025-06-26T14:19:30Z)
• The Generalized Skew Spectrum of Graphs [42.70026220176376]
  We introduce a new class of graph invariants that are isomorphism-invariant and capable of embedding richer graph structures.<n>By applying generalization-preservings to this family, we improve the Skew Spectrum's expressivity at the same computational cost.
  arXiv  Detail & Related papers  (2025-05-29T16:18:01Z)
• Lie symmetries and ghost-free representations of the Pais-Uhlenbeck model [44.99833362998488]
  We investigate the Pais-Uhlenbeck (PU) model, a paradigmatic example of a higher time-derivative theory.<n>Exploiting Lie symmetries in conjunction with the model's Bi-Hamiltonian structure, we construct distinct Poisson bracket formulations.<n>Our approach yields a unified framework for interpreting and stabilising higher time-derivative dynamics.
  arXiv  Detail & Related papers  (2025-05-09T15:16:40Z)
• Disentangling critical quantum spin chains with Clifford circuits [39.58317527488534]
  We explore the power of the CAMPS method in critical spin chains described by conformal field theories (CFTs) in the scaling limit.<n>We find that the optimized disentanglers correspond to it duality transformations, which significantly reduce the entanglement entropy in the ground state.<n>Our results highlight the potential of the framework as a versatile tool for uncovering hidden dualities and simplifying the entanglement structure of critical quantum systems.
  arXiv  Detail & Related papers  (2024-11-19T17:39:54Z)
• Bounding Entanglement Entropy with Clifford Double Cosets [0.0]
  We study contracted graphs for stabilizer states, W states and Dicke states.<n>We derive an upper bound on the number of entropy vectors that can be generated using any $n$-qubit Clifford circuit.<n>We speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit.
  arXiv  Detail & Related papers  (2023-10-30T18:00:01Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Tensor network models of AdS/qCFT [69.6561021616688]
  We introduce the notion of a quasiperiodic conformal field theory (qCFT) We show that qCFT can be best understood as belonging to a paradigm of discrete holography.
  arXiv  Detail & Related papers  (2020-04-08T18:00:05Z)
• Characterization of solvable spin models via graph invariants [0.38073142980732994]
  We provide a complete characterization of models that can be mapped to free fermions hopping on a graph. A corollary of our result is a complete set of constant-sized commutation structures that constitute the obstructions to a free-fermion solution. We show how several exact free-fermion solutions from the literature fit into our formalism and give an explicit example of a new model previously unknown to be solvable by free fermions.
  arXiv  Detail & Related papers  (2020-03-11T18:06:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.