Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE

• URL: http://arxiv.org/abs/2606.18339v1
• Date: Tue, 16 Jun 2026 18:00:00 GMT
• Title: Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE
• Abstract summary: 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.
• Score: 36.587368823954584
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The ground state of random Hamiltonians with all-to-all interactions such as the quantum Sherrington-Kirkpatrick (SK) model and the Sachdev-Ye-Kitaev (SYK) model follow volume-law entanglement and are expected to be hard to model using tensor networks. In recent years, some progress has been made to push the limit of classical methods using neural quantum states. However, it remains an open question whether there exist quantum algorithms that could offer a quantum advantage over the state-of-the-art classical methods in simulating random Hamiltonians. In this work, we show that one such algorithm, TETRIS-ADAPT-VQE, can construct accurate ground states for dense and sparse SYK models containing up to $N=20$ Majorana fermions achieving fidelities $\geq 99.3\%$ and for the quantum SK model with up to $L=18$ sites achieving fidelities $\geq 99.9998\%$. 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.

Related papers

• A rigorous quasipolynomial-time classical algorithm for SYK thermal expectations [51.660331450043806]
  Estimating local observables in Gibbs states is a central problem in quantum simulation.<n>We give a proof of a quasipolynomial-time classical algorithm that estimates SYK local thermal expectations at sufficiently high constant temperature.<n>Our result introduces a new Wick-pair expansion that we expect to be broadly useful for quantum many-body systems.
  arXiv  Detail & Related papers  (2026-04-22T21:14:04Z)
• SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians [42.007194397302825]
  Ground state search is central to quantum computing.<n>We present SpinGQE, an extension of the Generative Quantum Eigensolver framework to spin Hamiltonians.<n>We employ a transformer-based decoder to learn over quantum circuits that produce low-energy states.
  arXiv  Detail & Related papers  (2026-03-25T13:38:15Z)
• Sample-Based Krylov Quantum Diagonalization for the Schwinger Model on Trapped-Ion and Superconducting Quantum Processors [26.315169722500556]
  We apply the recently proposed Sample-based Krylov Quantum Diagonalization (SKQD) method to lattice gauge theories.<n>We study the dependence of the ground-state energy and particle number on the value of the $theta$-term, accurately capturing the model's phase structure.<n>We show that SKQD substantially reduces the effective Hilbert space, and although the Krylov space dimension still scales exponentially, the slower growth underscores its promise for simulating lattice gauge theories in larger volumes.
  arXiv  Detail & Related papers  (2025-10-30T19:21:06Z)
• Optimizing Sparse SYK [0.0]
  Finding the ground state of strongly-interacting fermionic systems is often the prerequisite for understanding both quantum chemistry and condensed matter systems.<n>The Sachdev--Ye--Kitaev (SYK) model is a representative example of such a system.<n>We show that the quantum algorithm of Hastings--O'Donnell for $p=1$ still achieves a constant-factor approximation to the ground energy when $pgeqOmega(log n/n)$.
  arXiv  Detail & Related papers  (2025-06-10T17:57:08Z)
• Probing Quantum Spin Systems with Kolmogorov-Arnold Neural Network Quantum States [0.0]
  We propose textttSineKAN, a neural network model to represent quantum mechanical wave functions.<n>We find that textttSineKAN models can be trained to high precisions and accuracies with minimal computational costs.
  arXiv  Detail & Related papers  (2025-06-02T17:18:40Z)
• Efficient Learning Implies Quantum Glassiness [0.0]
  We show a surprising relation between quantum learning theory and algorithmic hardness.<n>We show that finding near-ground states of certain sparse disordered quantum systems is average-case hard for "Lipschitz" quantum algorithms.
  arXiv  Detail & Related papers  (2025-04-30T18:00:29Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• 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)
• A Bosonic Model of Quantum Holography [0.0]
  We analyze a model of qubits which we argue has an emergent quantum gravitational description similar to the fermionic Sachdev-Ye-Kitaev (SYK) model. The model is known as the quantum $q$-spin model because it features $q$-local interactions between qubits.
  arXiv  Detail & Related papers  (2023-11-02T18:04:10Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.