Graph-theoretical search for integrable multistate Landau-Zener models

• URL: http://arxiv.org/abs/2512.15046v1
• Date: Wed, 17 Dec 2025 03:22:17 GMT
• Title: Graph-theoretical search for integrable multistate Landau-Zener models
• Abstract summary: A class known as the multitime Landau-Zener (MTLZ) models guarantees their exact solvability.<n>A key finding was that an $N$-state MTLZ model can be represented by data defined on an $N$-vertex graph.<n>In this work, we conduct a systematic graph-theoretical search for integrable models within the MTLZ class.
• Score: 10.850304146231911
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The search for exactly solvable models is an evergreen topic in theoretical physics. In the context of multistate Landau-Zener models -- $N$-state quantum systems with linearly time-dependent Hamiltonians -- the theory of integrability provides a framework for identifying new solvable cases. In particular, it was proved that the integrability of a specific class known as the multitime Landau-Zener (MTLZ) models guarantees their exact solvability. A key finding was that an $N$-state MTLZ model can be represented by data defined on an $N$-vertex graph. While known host graphs for MTLZ models include hypercubes, fans, and their Cartesian products, no other families have been discovered, leading to the conjecture that these are the only possibilities. In this work, we conduct a systematic graph-theoretical search for integrable models within the MTLZ class. By first identifying minimal structures that a graph must contain to host an MTLZ model, we formulate an efficient algorithm to systematically search for candidate graphs for MTLZ models. Implementing this algorithm using computational software, we enumerate all candidate graphs with up to $N = 13$ vertices and perform an in-depth analysis of those with $N \le 11$. Our results corroborate the aforementioned conjecture for graphs up to $11$ vertices. For even larger graphs, we propose a specific family, termed descendants of ``$(0,2)$-graphs'', as promising candidates that may violate the conjecture above. Our work can serve as a guideline to identify new exactly solvable multistate Landau-Zener models in the future.

Related papers

• Can Neural Networks Achieve Optimal Computational-statistical Tradeoff? An Analysis on Single-Index Model [53.6316818897326]
  We propose a gradient-based algorithm for training a two-layer neural network in time.<n>We show that our algorithm learns a sparse representation that strongly aligns with the unknown signal $star$.<n>We extend our approach to the setting where $star$ is $k$-sparse for $k = o(sqrtd)$ by introducing a novel weight technique.
  arXiv  Detail & Related papers  (2026-06-13T09:34:39Z)
• Fully-inductive Node Classification on Arbitrary Graphs [18.90340185554506]
  This paper introduces a fully-inductive setup, where models should perform inference on arbitrary test graphs.<n>We propose GraphAny as the first attempt at this challenging setup.<n> Empirically, GraphAny trained on a single Wisconsin dataset with only 120 labeled nodes can generalize to 30 new graphs with an average accuracy of 67.26%.
  arXiv  Detail & Related papers  (2024-05-30T19:43:29Z)
• Agnostically Learning Multi-index Models with Queries [54.290489524576756]
  We study the power of query access for the task of agnostic learning under the Gaussian distribution. We show that query access gives significant runtime improvements over random examples for agnostically learning MIMs.
  arXiv  Detail & Related papers  (2023-12-27T15:50:47Z)
• No distributed quantum advantage for approximate graph coloring [2.8518543181146785]
  We give an almost complete characterization of the hardness of $c$-coloring $chi$-chromatic graphs with distributed algorithms. We show that these problems do not admit any distributed quantum advantage.
  arXiv  Detail & Related papers  (2023-07-18T17:17:27Z)
• Seq-HGNN: Learning Sequential Node Representation on Heterogeneous Graph [57.2953563124339]
  We propose a novel heterogeneous graph neural network with sequential node representation, namely Seq-HGNN. We conduct extensive experiments on four widely used datasets from Heterogeneous Graph Benchmark (HGB) and Open Graph Benchmark (OGB)
  arXiv  Detail & Related papers  (2023-05-18T07:27:18Z)
• Minimax Optimal Quantization of Linear Models: Information-Theoretic Limits and Efficient Algorithms [59.724977092582535]
  We consider the problem of quantizing a linear model learned from measurements. We derive an information-theoretic lower bound for the minimax risk under this setting. We show that our method and upper-bounds can be extended for two-layer ReLU neural networks.
  arXiv  Detail & Related papers  (2022-02-23T02:39:04Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Generative hypergraph clustering: from blockmodels to modularity [26.99290024958576]
  We propose an expressive generative model of clustered hypergraphs with heterogeneous node degrees and edge sizes. We show that hypergraph Louvain is highly scalable, including as an example an experiment on a synthetic hypergraph of one million nodes. We use our model to analyze different patterns of higher-order structure in school contact networks, U.S. congressional bill cosponsorship, U.S. congressional committees, product categories in co-purchasing behavior, and hotel locations.
  arXiv  Detail & Related papers  (2021-01-24T00:25:22Z)
• Rethinking Graph Regularization for Graph Neural Networks [21.32758655943999]
  We show that graph Laplacian regularization brings little-to-no benefit to existing graph neural networks (GNNs) We propose a simple but non-trivial variant of graph Laplacian regularization, called propagation-regularization (P-reg) We demonstrate that P-reg can effectively boost the performance of existing GNN models on both node-level and graph-level tasks.
  arXiv  Detail & Related papers  (2020-09-04T07:04:51Z)
• Scalable Deep Generative Modeling for Sparse Graphs [105.60961114312686]
  Existing deep neural methods require $Omega(n2)$ complexity by building up the adjacency matrix. We develop a novel autoregressive model, named BiGG, that utilizes this sparsity to avoid generating the full adjacency matrix. During training this autoregressive model can be parallelized with $O(log n)$ synchronization stages.
  arXiv  Detail & Related papers  (2020-06-28T04:37:57Z)
• Learning Gaussian Graphical Models via Multiplicative Weights [54.252053139374205]
  We adapt an algorithm of Klivans and Meka based on the method of multiplicative weight updates. The algorithm enjoys a sample complexity bound that is qualitatively similar to others in the literature. It has a low runtime $O(mp2)$ in the case of $m$ samples and $p$ nodes, and can trivially be implemented in an online manner.
  arXiv  Detail & Related papers  (2020-02-20T10:50:58Z)
• Learning the Hypotheses Space from data: Learning Space and U-curve Property [0.0]
  This paper presents an extension of the classical PAC learning model in which learning problems are modelled not only by a Hypothesis Space $mathcalH$, but also by a Learning Space $mathbbL(mathcalH)$. Our main contribution is a data driven general learning algorithm to perform regularized Model Selection on $mathbbL(mathcalH)$.
  arXiv  Detail & Related papers  (2020-01-26T22:29:33Z)

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.