Hamilton-Zero: A Neural Tensor-Network Foundation Model for Ground States of Arbitrary Quadratic Qubit Hamiltonians

• URL: http://arxiv.org/abs/2608.11911v2
• Date: Thu, 13 Aug 2026 13:29:22 GMT
• Title: Hamilton-Zero: A Neural Tensor-Network Foundation Model for Ground States of Arbitrary Quadratic Qubit Hamiltonians
• Abstract summary: We train a foundation model with $sim0.5$B variational parameters, trained with contemporary techniques from large language models and deep reinforcement learning.<n>We prove that the resulting variational principle on this manifold preserves the $textspin-1/2$ sector's ground-state upper bound.<n>We fine-tune our model on system sizes of up to 1024 qubits, and evaluate on systems up to 8100 qubits.
• Score: 10.606940539062064
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A central promise of useful quantum advantage is the ability to compute ground states of Hamiltonian systems beyond the reach of classical simulation methods. Here we demonstrate that this problem can be effectively amortized across an arbitrary and universal set of Hamiltonians by a foundation model with $\sim0.5$B variational parameters, trained with contemporary techniques from large language models and deep reinforcement learning. To do this, we formulate $\text{spin-}1/2$ quantum ground-state learning as manifold variational optimisation over centrally odd scalar functions on $\mathrm{SU}(2)^N$. This replaces explicit Hilbert-space vector amplitudes with manifold functions on which the Hamiltonian acts through Lie derivatives, evaluated by custom automatic differentiation primitives. We prove that the resulting variational principle on this manifold preserves the $\text{spin-}1/2$ sector's ground-state upper bound using the Peter-Weyl theorem, then pre-train our foundation model on a dataset of hundreds of thousands of different Hamiltonian systems, varying the connection topology, system size, interaction types and strengths, bringing together a century of many-body literature. Using a novel $\mathrm{SU}(2)$ replica-exchange Langevin sampler and sharded natural-gradient optimisation, we train our model with our own extension of the Kronecker-Factored Approximate Curvature (KFAC) optimiser on system sizes up to 64 qubits. On a held-out generalisation dataset, we fine-tune our model on system sizes of up to 1024 qubits, and evaluate on systems up to 8100 qubits.

Related papers

• Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE [36.587368823954584]
  We show thatADAPT-VQE can construct accurate ground states for dense and sparse SYK models containing up to $N$ fermions.<n>We find that while the preparation of ground states is efficient (in terms of operator pool size and circuit depth) for the SK model, it is not efficient for either dense or moderately sparse SYK models.
  arXiv  Detail & Related papers  (2026-06-16T18:00:00Z)
• The Hamilton-Jacobi Theory of Deep Learning [0.0]
  Training a neural network is identified, exactly, as a search through Hamilton--Jacobi initial-value problems.<n>The correspondence is exact for log-sum-exp layers and structural for broader architectures.
  arXiv  Detail & Related papers  (2026-05-27T18:38:23Z)
• Theoretical Foundations of Scaling Law in Familial Models [46.506708373314375]
  We introduce Granularity (G) as a fundamental scaling variable alongside model size (N) and training tokens (D)<n>Our results reveal that the granularity penalty follows a multiplicative power law with an extremely small exponent.<n> Practically, it validates the "train once, deploy many" paradigm, demonstrating that deployment flexibility is achievable.
  arXiv  Detail & Related papers  (2025-12-29T12:01:58Z)
• Optimal local basis truncation of lattice quantum many-body systems [0.0]
  We show how to optimally reduce the local basis of lattice quantum many-body (QMB) Hamiltonians.<n>The basis truncation exploits the most relevant eigenvalues of the estimated single-site reduced density matrix.
  arXiv  Detail & Related papers  (2025-09-22T16:22:54Z)
• Large N vector models in the Hamiltonian framework [0.0]
  We first present the method in the simpler setting of a quantum mechanical system with quartic interactions.<n>We then apply these techniques to the $O(N)$ model in $2+1$ and $3+1$ dimensions.<n>We recover various known results, such as the gap equation determining the ground state of the system.
  arXiv  Detail & Related papers  (2025-02-12T00:18:02Z)
• Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms [48.869199703062606]
  A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. We introduce two approaches that achieve a constant sample complexity, independent of system size $n$, for learning ground state properties.
  arXiv  Detail & Related papers  (2024-05-28T18:00:32Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Digital-Analog Quantum Computation with Arbitrary Two-Body Hamiltonians [0.0]
  Digital-analog quantum computing is a computational paradigm which employs an analog Hamiltonian resource together with single-qubit gates to reach universality.<n>We design a new scheme which employs an arbitrary two-body source Hamiltonian, extending the experimental applicability of this computational paradigm to most quantum platforms.
  arXiv  Detail & Related papers  (2023-07-03T12:36:32Z)
• Improved machine learning algorithm for predicting ground state properties [3.156207648146739]
  We give a classical machine learning (ML) algorithm for predicting ground state properties with an inductive bias encoding geometric locality. The proposed ML model can efficiently predict ground state properties of an $n$-qubit gapped local Hamiltonian after learning from only $mathcalO(log(n))$ data.
  arXiv  Detail & Related papers  (2023-01-30T18:40:07Z)
• Neural Inference of Gaussian Processes for Time Series Data of Quasars [72.79083473275742]
  We introduce a new model that enables it to describe quasar spectra completely. We also introduce a new method of inference of Gaussian process parameters, which we call $textitNeural Inference$. The combination of both the CDRW model and Neural Inference significantly outperforms the baseline DRW and MLE.
  arXiv  Detail & Related papers  (2022-11-17T13:01:26Z)
• NeuralEF: Deconstructing Kernels by Deep Neural Networks [47.54733625351363]
  Traditional nonparametric solutions based on the Nystr"om formula suffer from scalability issues. Recent work has resorted to a parametric approach, i.e., training neural networks to approximate the eigenfunctions. We show that these problems can be fixed by using a new series of objective functions that generalizes to space of supervised and unsupervised learning problems.
  arXiv  Detail & Related papers  (2022-04-30T05:31:07Z)
• On the Generalization Power of Overfitted Two-Layer Neural Tangent Kernel Models [42.72822331030195]
  min $ell$-norm overfitting solutions for the neural tangent kernel (NTK) model of a two-layer neural network. We show that, depending on the ground-truth function, the test error of overfitted NTK models exhibits characteristics that are different from the "double-descent" For functions outside of this class, we provide a lower bound on the generalization error that does not diminish to zero even when $n$ and $p$ are both large.
  arXiv  Detail & Related papers  (2021-03-09T06:24:59Z)

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.