Graph theory and tunable slow dynamics in quantum East Hamiltonians

• URL: http://arxiv.org/abs/2504.03458v2
• Date: Mon, 14 Apr 2025 11:29:15 GMT
• Title: Graph theory and tunable slow dynamics in quantum East Hamiltonians
• Authors: Heiko Georg Menzler, Mari Carmen Bañuls, Fabian Heidrich-Meisner,
• Abstract summary: We show how graph theory concepts can provide an insight into the origin of slow dynamics in systems with kinetic constraints.<n>Slow dynamics is related to the presence of strong hierarchies between nodes on the Fock-space graph.<n>We numerically demonstrate how these detunings affect the degree of non-ergodicity on finite systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We show how graph theory concepts can provide an insight into the origin of slow dynamics in systems with kinetic constraints. In particular, we observe that slow dynamics is related to the presence of strong hierarchies between nodes on the Fock-space graph in the particle occupation basis, which encodes configurations connected by a given Hamiltonian. To quantify hierarchical structures, we develop a measure of centrality of the nodes, which is applicable to generic Hamiltonian matrices and inspired by established centrality measures from graph theory. We illustrate these ideas in the quantum East (QE) model. We introduce several ways of detuning nodes in the corresponding graph that alter the hierarchical structure, defining a family of QE models. We numerically demonstrate how these detunings affect the degree of non-ergodicity on finite systems, as evidenced by both the time dependence of density autocorrelations and eigenstate properties in the detuned QE models.

Related papers

• Computing the graph-changing dynamics of loop quantum gravity [1.351813974961217]
  We introduce the first numerical tool that implements graph-changing dynamics via the Hamiltonian constraint.<n>We show that some quantum-geometrical observables behave differently than in the graph-preserving truncation.
  arXiv  Detail & Related papers  (2024-12-28T20:12:15Z)
• Latent Space Energy-based Neural ODEs [73.01344439786524]
  This paper introduces novel deep dynamical models designed to represent continuous-time sequences.<n>We train the model using maximum likelihood estimation with Markov chain Monte Carlo.<n> Experimental results on oscillating systems, videos and real-world state sequences (MuJoCo) demonstrate that our model with the learnable energy-based prior outperforms existing counterparts.
  arXiv  Detail & Related papers  (2024-09-05T18:14:22Z)
• Port-Hamiltonian Architectural Bias for Long-Range Propagation in Deep Graph Networks [55.227976642410766]
  dynamics of information diffusion within graphs is a critical open issue that heavily influences graph representation learning.<n>Motivated by this, we introduce (port-)Hamiltonian Deep Graph Networks.<n>We reconcile under a single theoretical and practical framework both non-dissipative long-range propagation and non-conservative behaviors.
  arXiv  Detail & Related papers  (2024-05-27T13:36:50Z)
• LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering [59.89626219328127]
  Graph clustering is a fundamental problem in machine learning. Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predefined cluster numbers. We propose to address this problem from a fresh perspective of graph information theory.
  arXiv  Detail & Related papers  (2024-05-20T05:46:41Z)
• Learning Coarse-Grained Dynamics on Graph [4.692217705215042]
  We consider a Graph Neural Network (GNN) non-Markovian modeling framework to identify coarse-grained dynamical systems on graphs. Our main idea is to systematically determine the GNN architecture by inspecting how the leading term of the Mori-Zwanzig memory term depends on the coarse-grained interaction coefficients that encode the graph topology.
  arXiv  Detail & Related papers  (2024-05-15T13:25:34Z)
• SEGNO: Generalizing Equivariant Graph Neural Networks with Physical Inductive Biases [66.61789780666727]
  We show how the second-order continuity can be incorporated into GNNs while maintaining the equivariant property. We also offer theoretical insights into SEGNO, highlighting that it can learn a unique trajectory between adjacent states. Our model yields a significant improvement over the state-of-the-art baselines.
  arXiv  Detail & Related papers  (2023-08-25T07:15:58Z)
• Dynamic Causal Explanation Based Diffusion-Variational Graph Neural Network for Spatio-temporal Forecasting [60.03169701753824]
  We propose a novel Dynamic Diffusion-al Graph Neural Network (DVGNN) fortemporal forecasting. The proposed DVGNN model outperforms state-of-the-art approaches and achieves outstanding Root Mean Squared Error result.
  arXiv  Detail & Related papers  (2023-05-16T11:38:19Z)
• OrthoReg: Improving Graph-regularized MLPs via Orthogonality Regularization [66.30021126251725]
  Graph Neural Networks (GNNs) are currently dominating in modeling graphstructure data. Graph-regularized networks (GR-MLPs) implicitly inject the graph structure information into model weights, while their performance can hardly match that of GNNs in most tasks. We show that GR-MLPs suffer from dimensional collapse, a phenomenon in which the largest a few eigenvalues dominate the embedding space. We propose OrthoReg, a novel GR-MLP model to mitigate the dimensional collapse issue.
  arXiv  Detail & Related papers  (2023-01-31T21:20:48Z)
• QESK: Quantum-based Entropic Subtree Kernels for Graph Classification [11.51839867040302]
  We propose a novel graph kernel, namely the Quantum-based Entropic Subtree Kernel (QESK) for Graph Classification. We show how this AMM matrix can be employed to compute a series of entropic subtree representations associated with the classical Weisfeiler-Lehman (WL) algorithm. We show that the proposed QESK kernel can significantly outperform state-of-the-art graph kernels and graph deep learning methods for graph classification problems.
  arXiv  Detail & Related papers  (2022-12-10T07:10:03Z)
• Algebraic-Dynamical Theory for Quantum Many-body Hamiltonians: A Formalized Approach To Strongly Interacting Systems [0.0]
  Dynamical perturbation methods are the most widely used approaches for quantum many-body systems. We formulate an algebraic-dynamical theory (ADT) by combining the power of quantum algebras and dynamical methods. Applying ADT to many-body systems on lattices, we find that the quantum entanglement is represented by the cumulant structure of expectation values of the many-body COBS.
  arXiv  Detail & Related papers  (2022-02-24T13:07:30Z)
• Unraveling the topology of dissipative quantum systems [58.720142291102135]
  We discuss topology in dissipative quantum systems from the perspective of quantum trajectories. We show for a broad family of translation-invariant collapse models that the set of dark state-inducing Hamiltonians imposes a nontrivial topological structure on the space of Hamiltonians.
  arXiv  Detail & Related papers  (2020-07-12T11:26:02Z)

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.