Classification of dynamical Lie algebras generated by spin interactions on undirected graphs

• URL: http://arxiv.org/abs/2409.19797v1
• Date: Sun, 29 Sep 2024 21:46:29 GMT
• Title: Classification of dynamical Lie algebras generated by spin interactions on undirected graphs
• Authors: Efekan Kökcü, Roeland Wiersema, Alexander F. Kemper, Bojko N. Bakalov,
• Abstract summary: We provide a classification of all dynamical Lie algebras generated by 2-local spin interactions on undirected graphs. As it turns out, the one-dimensional case is special; for any other graph, the dynamical Lie algebra depends solely on whether the graph is bipartite or not.
• Score: 41.912613724593875
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We provide a classification of all dynamical Lie algebras generated by 2-local spin interactions on undirected graphs. Building on our previous work where we provided such a classification for spin chains, here we consider the more general case of undirected graphs. As it turns out, the one-dimensional case is special; for any other graph, the dynamical Lie algebra solely depends on whether the graph is bipartite or not. An important consequence of this result is that the cases where the dynamical Lie algebra is polynomial in size are special and restricted to one dimension.

Related papers

• On statistical learning of graphs [0.0]
  We study PAC and online learnability of hypothesis classes formed by copies of a countably infinite graph G.<n>Our main result shows that PAC learnability of all such finite-support copies implies online learnability of the full isomorphism type of G.
  arXiv  Detail & Related papers  (2025-07-17T12:26:25Z)
• Graph-Dictionary Signal Model for Sparse Representations of Multivariate Data [49.77103348208835]
  We define a novel Graph-Dictionary signal model, where a finite set of graphs characterizes relationships in data distribution through a weighted sum of their Laplacians. We propose a framework to infer the graph dictionary representation from observed data, along with a bilinear generalization of the primal-dual splitting algorithm to solve the learning problem. We exploit graph-dictionary representations in a motor imagery decoding task on brain activity data, where we classify imagined motion better than standard methods.
  arXiv  Detail & Related papers  (2024-11-08T17:40:43Z)
• Generalization, Expressivity, and Universality of Graph Neural Networks on Attributed Graphs [53.27010448621372]
  We analyze the universality and generalization of graph neural networks (GNNs) on attributed graphs with node attributes.<n>We prove a universal approximation theorem for GNNs and bounds generalization for GNNs on any data distribution of attributed graphs.<n>Our work extends and unites previous approaches which either derived theory only for graphs with no attributes, derived compact metrics under which GNNs are continuous but without separation power, or derived metrics under which GNNs are continuous and separate points.
  arXiv  Detail & Related papers  (2024-11-08T10:34:24Z)
• Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras [0.0]
  We study the underlying algebraic properties of three QAOA ans"atze for the maximum-cut (maxcut) problem on connected graphs. We are able to fully characterize the Lie algebras of the multi-angle ansatz for arbitrary connected graphs.
  arXiv  Detail & Related papers  (2024-10-07T16:46:20Z)
• Introducing Graph Learning over Polytopic Uncertain Graph [7.165583602747691]
  This abstract introduces a class of graph learning applicable to cases where the underlying graph has polytopic uncertainty. By incorporating this assumption that the graph lies in a polytopic set into two established graph learning frameworks, we find that our approach yields better results with less computation.
  arXiv  Detail & Related papers  (2024-04-12T00:55:07Z)
• Advective Diffusion Transformers for Topological Generalization in Graph Learning [69.2894350228753]
  We show how graph diffusion equations extrapolate and generalize in the presence of varying graph topologies. We propose a novel graph encoder backbone, Advective Diffusion Transformer (ADiT), inspired by advective graph diffusion equations.
  arXiv  Detail & Related papers  (2023-10-10T08:40:47Z)
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension [44.41126861546141]
  We provide a classification of Lie algebras generated by translation-invariant 2-local spin chain Hamiltonians. We consider chains with open and periodic boundary conditions and find 17 unique dynamical Lie algebras. In addition to the closed and open spin chains, we consider systems with a fully connected topology, which may be relevant for quantum machine learning approaches.
  arXiv  Detail & Related papers  (2023-09-11T17:59:41Z)
• Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs [48.79929516665371]
  Graphs with homophily-prone edges tend to connect nodes with the same class. Heterophily-prone edges tend to build relationships between nodes with different classes. Existing GNNs only take the original graph during training.
  arXiv  Detail & Related papers  (2023-06-13T08:06:10Z)
• Graphon Pooling for Reducing Dimensionality of Signals and Convolutional Operators on Graphs [131.53471236405628]
  We present three methods that exploit the induced graphon representation of graphs and graph signals on partitions of [0, 1]2 in the graphon space. We prove that those low dimensional representations constitute a convergent sequence of graphs and graph signals. We observe that graphon pooling performs significantly better than other approaches proposed in the literature when dimensionality reduction ratios between layers are large.
  arXiv  Detail & Related papers  (2022-12-15T22:11:34Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• Geometric presentations of braid groups for particles on a graph [0.0]
  We study geometric presentations of braid groups for particles constrained to move on a graph. In particular, we show that for $3$-connected planar graphs such a quotient reconstructs the well-known planar braid group. Our results are of particular relevance for the study of non-abelian anyons on networks showing new possibilities for non-abelian quantum statistics on graphs.
  arXiv  Detail & Related papers  (2020-06-27T02:10:22Z)

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.