Efficient Hamiltonian learning from Gibbs states

• URL: http://arxiv.org/abs/2403.18061v2
• Date: Mon, 23 Sep 2024 20:01:51 GMT
• Title: Efficient Hamiltonian learning from Gibbs states
• Abstract summary: We describe a novel algorithm that learns a Hamiltonian from local expectations of its Gibbs state using the free energy variational principle. The algorithm avoids the need to compute the free energy directly, instead using efficient estimates of the derivatives of the free energy with respect to perturbations of the state.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We describe a novel algorithm that learns a Hamiltonian from local expectations of its Gibbs state using the free energy variational principle. The algorithm avoids the need to compute the free energy directly, instead using efficient estimates of the derivatives of the free energy with respect to perturbations of the state. These estimates are based on a new entropy bound for Lindblad evolutions, which is of independent interest. We benchmark the algorithm by performing black-box learning of a nearest-neighbour Hamiltonian on a 100-qubit spin chain. A implementation of the algorithm with a Python front-end is made available for use.

Related papers

• Learning the structure of open quantum systems [1.8253425124589737]
  We design an algorithm for learning the coefficients of an $n$-qubit constant-local Lindbladian to $varepsilon$ error with $O(g d2 log(n) / varepsilon2)$ total evolution time.<n>Our algorithm achieves the suite of desiderata attained by state-of-the-art Hamiltonian learning algorithms.
  arXiv  Detail & Related papers  (2026-06-29T14:25:24Z)
• Certifying and learning local quantum Hamiltonians [6.726111988469673]
  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.
  arXiv  Detail & Related papers  (2026-03-31T14:38:38Z)
• 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)
• Computation of operator exponentials using the Dunford-Cauchy integral [51.56484100374058]
  We consider an n-qubit quantum system with a Hamiltonian, defined by an expansion in the Pauli basis, and propose a new algorithm for classical computing the exponential of the Hamiltonian.<n>The algorithm is based on the representation of the exponential by the Dunford-Cauchy integral, followed by an efficient computation of the resolvent, and is suitable for Hamiltonians that are sparse in the Pauli basis.
  arXiv  Detail & Related papers  (2025-09-10T13:58: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)
• Neural Time-Reversed Generalized Riccati Equation [60.92253836775246]
  Hamiltonian equations offer an interpretation of optimality through auxiliary variables known as costates. This paper introduces a novel neural-based approach to optimal control, with the aim of working forward-in-time.
  arXiv  Detail & Related papers  (2023-12-14T19:29:37Z)
• An efficient and exact noncommutative quantum Gibbs sampler [0.0]
  We construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary noncommutative Hamiltonians. Our construction can also be regarded as a continuous-time quantum analog of the Metropolis-Hastings algorithm.
  arXiv  Detail & Related papers  (2023-11-15T18:51:24Z)
• Learning Regularized Monotone Graphon Mean-Field Games [155.38727464526923]
  We study fundamental problems in regularized Graphon Mean-Field Games (GMFGs) We establish the existence of a Nash Equilibrium (NE) of any $lambda$-regularized GMFG. We propose provably efficient algorithms to learn the NE in weakly monotone GMFGs.
  arXiv  Detail & Related papers  (2023-10-12T07:34:13Z)
• Hamiltonian learning from time dynamics using variational algorithms [3.3269356210613656]
  Hamiltonian of a quantum system governs the dynamics of the system via the Schrodinger equation. In this paper, the Hamiltonian is reconstructed in the Pauli basis using measurables on random states forming a time series dataset. We show results on Hamiltonians involving XX, ZZ couplings along with transverse field Ising Hamiltonians and propose an analytical method for the learning of Hamiltonians consisting of generators of the SU(3) group.
  arXiv  Detail & Related papers  (2022-12-28T05:22:57Z)
• 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)
• Continuous-Time Fitted Value Iteration for Robust Policies [93.25997466553929]
  Solving the Hamilton-Jacobi-Bellman equation is important in many domains including control, robotics and economics. We propose continuous fitted value iteration (cFVI) and robust fitted value iteration (rFVI) These algorithms leverage the non-linear control-affine dynamics and separable state and action reward of many continuous control problems.
  arXiv  Detail & Related papers  (2021-10-05T11:33:37Z)
• Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion [6.338178373376447]
  We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. We demonstrate that the cost of the algorithm is independent of the Hamiltonian's frequencies.
  arXiv  Detail & Related papers  (2021-03-29T05:02:02Z)
• A Hybrid Quantum-Classical Hamiltonian Learning Algorithm [6.90132007891849]
  Hamiltonian learning is crucial to the certification of quantum devices and quantum simulators. We propose a hybrid quantum-classical Hamiltonian learning algorithm to find the coefficients of the Pauli operator of the Hamiltonian.
  arXiv  Detail & Related papers  (2021-03-01T15:15:58Z)
• A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise [55.45544638410858]
  We study the problem of PAC learning homogeneous halfspaces in the presence of Tsybakov noise. Our algorithm learns the true halfspace within any accuracy $epsilon$.
  arXiv  Detail & Related papers  (2020-10-04T22:19:06Z)
• Neural Thompson Sampling [94.82847209157494]
  We propose a new algorithm, called Neural Thompson Sampling, which adapts deep neural networks for both exploration and exploitation. At the core of our algorithm is a novel posterior distribution of the reward, where its mean is the neural network approximator, and its variance is built upon the neural tangent features of the corresponding neural network.
  arXiv  Detail & Related papers  (2020-10-02T07:44:09Z)

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.