Certifying and learning local quantum Hamiltonians

• URL: http://arxiv.org/abs/2603.29809v1
• Date: Tue, 31 Mar 2026 14:38:38 GMT
• Title: Certifying and learning local quantum Hamiltonians
• Abstract summary: We show that certifying a local Hamiltonian in normalized Frobenius norm can be achieved with only $O (1/varepsilon)$ evolution time.<n>We design an algorithm for learning Gibbs states of local Hamiltonians in trace norm that is sample-efficient in all relevant parameters.
• Score: 6.726111988469673
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we study the problems of certifying and learning quantum $k$-local Hamiltonians, for a constant $k$. Our main contributions are as follows: - Certification of Hamiltonians. We show that certifying a local Hamiltonian in normalized Frobenius norm via access to its time-evolution operator can be achieved with only $O(1/\varepsilon)$ evolution time. This is optimal, as it matches the Heisenberg-scaling lower bound of $Ω(1/\varepsilon)$. To our knowledge, this is the first optimal algorithm for testing a Hamiltonian property. A key ingredient in our analysis is the Bonami Hypercontractivity Lemma from Fourier analysis. - Learning Gibbs states. We design an algorithm for learning Gibbs states of local Hamiltonians in trace norm that is sample-efficient in all relevant parameters. In contrast, previous approaches learned the underlying Hamiltonian (which implies learning the Gibbs state), and thus inevitably suffered from exponential sample complexity scaling in the inverse temperature. - Certification of Gibbs states. We give an algorithm for certifying Gibbs states of local Hamiltonians in trace norm that is both sample and time-efficient in all relevant parameters, thereby solving a question posed by Anshu (Harvard Data Science Review, 2022).

Related papers

• Hamiltonian Decoded Quantum Interferometry [69.7049555871155]
  We introduce Hamiltonian Decoded Quantum Interferometry (HDQI)<n>HDQI utilizes coherent measurements and the symplectic representation of the Pauli group to reduce Gibbs sampling and Hamiltonian Bellians.<n>We show that HDQI efficiently prepares Gibbs states at arbitrary temperatures for a class of physically motivated commuting Hamiltonians.
  arXiv  Detail & Related papers  (2025-10-09T08:06:15Z)
• Lower Bounds for Learning Hamiltonians from Time Evolution [5.118083299467833]
  We consider the problem of learning Hamiltonians from time evolution.<n>We show that any learning algorithm with inverse time resolution requires super-polynomial total evolution time.
  arXiv  Detail & Related papers  (2025-09-25T01:50:55Z)
• Certifying and learning quantum Ising Hamiltonians [5.034708496440794]
  We show that certifying an Ising Hamiltonian in normalized Frobenius norm requires only $widetilde O (1/varepsilon)$ time evolution.<n>We design an algorithm for learning Ising Gibbs states in trace norm that is sample-efficient in all parameters.<n>We extend our results on learning and certification of Gibbs states to general $k$-local Hamiltonians for any constant $k$
  arXiv  Detail & Related papers  (2025-09-12T13:33:20Z)
• Quantum Hamiltonian Certification [12.536652791069576]
  This work introduces a direct and efficient framework for Hamiltonian certification.<n>We show that the certification problem with respect to normalized Schatten $inftyco-norm is $mathco-norm, and therefore unlikely to have efficient solutions.<n>To enhance practical applicability, we develop an ancilla-free certification method that maintains the inverse precision scaling while eliminating the need for auxiliary qubits.
  arXiv  Detail & Related papers  (2025-05-19T15:00:58Z)
• 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)
• Gibbs state preparation for commuting Hamiltonian: Mapping to classical Gibbs sampling [0.2764448420478315]
  We show that our Gibbs sampler is able to replicate state-of-the-art results.<n>We demonstrate that our Gibbs sampler is able to prepare the Gibbs state in regimes which were previously unknown.
  arXiv  Detail & Related papers  (2024-10-07T10:52:23Z)
• 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)
• 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)
• Learning many-body Hamiltonians with Heisenberg-limited scaling [3.460138063155115]
  We propose the first algorithm to achieve the Heisenberg limit for learning interacting $N$-qubit local Hamiltonian. After a total evolution time of $mathcalO(epsilon-1)$, the proposed algorithm can efficiently estimate any parameter in the $N$-qubit Hamiltonian to $epsilon$-error with high probability.
  arXiv  Detail & Related papers  (2022-10-06T16:30:51Z)
• 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)
• Hamiltonian simulation with random inputs [74.82351543483588]
  Theory of average-case performance of Hamiltonian simulation with random initial states. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models.
  arXiv  Detail & Related papers  (2021-11-08T19:08:42Z)

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.