Clifford symmetries in quantum many-body systems

• URL: http://arxiv.org/abs/2605.18966v1
• Date: Mon, 18 May 2026 18:00:23 GMT
• Title: Clifford symmetries in quantum many-body systems
• Abstract summary: 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.
• Score: 33.81183023775755
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result of insightful thinking. In this work, we complement human ingenuity with an algorithm. We leverage the classically efficient Clifford group to find symmetries for arbitrary many-body Hamiltonians via a graph representation. 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.

Related papers

• Graph automorphisms to obtain Clifford symmetries in open and closed qudit models [33.81183023775755]
  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.
  arXiv  Detail & Related papers  (2026-05-28T18:00:10Z)
• 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)
• Computing Game Symmetries and Equilibria That Respect Them [77.72705755558839]
  We study the computational of identifying and using symmetries in games.<n>We find a strong connection between game symmetries and graph automorphisms.<n>We show that finding a Nash equilibrium that respects a given set of symmetries is exactly as hard as Brouwer fixed point and gradient descent problems.
  arXiv  Detail & Related papers  (2025-01-15T16:15:16Z)
• Robust Symmetry Detection via Riemannian Langevin Dynamics [39.342336146118015]
  We propose a novel symmetry detection method that marries classical symmetry detection techniques with recent advances in generative modeling. Specifically, we apply Langevin dynamics to a symmetry space to enhance robustness against noise. We provide empirical results on a variety of shapes that suggest our method is not only robust to noise, but can also identify both partial and global symmetries.
  arXiv  Detail & Related papers  (2024-09-18T02:28:20Z)
• Learning Symmetric Hamiltonian [10.743546036912655]
  Hamiltonian Learning is a process of recovering system Hamiltonian from measurements.<n>In this study, we investigate the problem of learning the symmetric Hamiltonian from its eigenstate.
  arXiv  Detail & Related papers  (2024-04-09T01:38:32Z)
• A Generative Model of Symmetry Transformations [44.87295754993983]
  We build a generative model that explicitly aims to capture the data's approximate symmetries.<n>We empirically demonstrate its ability to capture symmetries under affine and color transformations.
  arXiv  Detail & Related papers  (2024-03-04T11:32:18Z)
• Evaluating the Robustness of Interpretability Methods through Explanation Invariance and Equivariance [72.50214227616728]
  Interpretability methods are valuable only if their explanations faithfully describe the explained model. We consider neural networks whose predictions are invariant under a specific symmetry group.
  arXiv  Detail & Related papers  (2023-04-13T17:59:03Z)
• Capturing dynamical correlations using implicit neural representations [85.66456606776552]
  We develop an artificial intelligence framework which combines a neural network trained to mimic simulated data from a model Hamiltonian with automatic differentiation to recover unknown parameters from experimental data. In doing so, we illustrate the ability to build and train a differentiable model only once, which then can be applied in real-time to multi-dimensional scattering data.
  arXiv  Detail & Related papers  (2023-04-08T07:55:36Z)
• Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras from First Principles [55.41644538483948]
  We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the transformations symmetry and the corresponding generators. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
  arXiv  Detail & Related papers  (2023-01-13T16:25:25Z)
• Exact solutions of interacting dissipative systems via weak symmetries [77.34726150561087]
  We analytically diagonalize the Liouvillian of a class Markovian dissipative systems with arbitrary strong interactions or nonlinearity. This enables an exact description of the full dynamics and dissipative spectrum. Our method is applicable to a variety of other systems, and could provide a powerful new tool for the study of complex driven-dissipative quantum systems.
  arXiv  Detail & Related papers  (2021-09-27T17:45:42Z)
• 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.