Gibbs state preparation for commuting Hamiltonian: Mapping to classical Gibbs sampling

• URL: http://arxiv.org/abs/2410.04909v2
• Date: Tue, 8 Oct 2024 19:26:17 GMT
• Title: Gibbs state preparation for commuting Hamiltonian: Mapping to classical Gibbs sampling
• Authors: Yeongwoo Hwang, Jiaqing Jiang,
• Abstract summary: We show that our Gibbs sampler is able to replicate state-of-the-art results. We demonstrate that our Gibbs sampler is able to prepare the Gibbs state in regimes which were previously unknown.
• Score: 0.759660604072964
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gibbs state preparation, or Gibbs sampling, is a key computational technique extensively used in physics, statistics, and other scientific fields. Recent efforts for designing fast mixing Gibbs samplers for quantum Hamiltonians have largely focused on commuting local Hamiltonians (CLHs), a non-trivial subclass of Hamiltonians which include highly entangled systems such as the Toric code and quantum double model. Most previous Gibbs samplers relied on simulating the Davies generator, which is a Lindbladian associated with the thermalization process in nature. Instead of using the Davies generator, we design a different Gibbs sampler for various CLHs by giving a reduction to classical Hamiltonians, in the sense that one can efficiently prepare the Gibbs state for some CLH $H$ on a quantum computer as long as one can efficiently do classical Gibbs sampling for the corresponding classical Hamiltonian $H^{(c)}$. We demonstrate that our Gibbs sampler is able to replicate state-of-the-art results as well as prepare the Gibbs state in regimes which were previously unknown, such as the low temperature region, as long as there exists fast mixing Gibbs samplers for the corresponding classical Hamiltonians. Our reductions are as follows. - If $H$ is a 2-local qudit CLH, then $H^{(c)}$ is a 2-local qudit classical Hamiltonian. - If $H$ is a 4-local qubit CLH on 2D lattice and there are no classical qubits, then $H^{(c)}$ is a 2-local qudit classical Hamiltonian on a planar graph. As an example, our algorithm can prepare the Gibbs state for the (defected) Toric code at any non-zero temperature in $\mathcal O(n^2)$ time. - If $H$ is a 4-local qubit CLH on 2D lattice and there are classical qubits, assuming that quantum terms are uniformly correctable, then $H^{(c)}$ is a constant-local classical Hamiltonian.

Related papers

• Efficient quantum Gibbs sampling of stabilizer codes using hybrid computation [0.0]
  We present hybrid Gibbs sampling algorithms for the stabilizer code Hamiltonians of the rotated surface code and the toric code with only local quantum algorithms.<n>We show that if we allow for non-local gates, the Gibbs state of the periodic 1D Ising model can be prepared in logarithmic depth and linearly many simultaneous measurements.
  arXiv  Detail & Related papers  (2025-11-13T22:49:30Z)
• 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)
• 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)
• New random compiler for Hamiltonians via Markov Chains [0.07499722271664146]
  We develop a new compiler, similar to the first order randomized Trotter, or qDRIFT, but with an arguably simpler framework. We first present the model and derive its governing equations. We then define and analyze the simulation error for a sum of two Hamiltonians, and generalize it to a sum of $Q$ Hamiltonians.
  arXiv  Detail & Related papers  (2024-11-10T14:57:25Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
  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)
• Emergence of the Gibbs ensemble as a steady state in Lindbladian dynamics [4.889561507168047]
  We explicitly construct unique non-equilibrium steady state (NESS) of Lindblad master equation characterized by a Gibbs ensemble. By studying the XX model and Fredkin model, we showcase how the Gibbs state emerges as the unique steady state.
  arXiv  Detail & Related papers  (2024-06-26T03:38:34Z)
• Quantum Metropolis Sampling via Weak Measurement [0.7414581563903817]
  For classical Hamiltonians, the most commonly used Gibbs sampler is the Metropolis algorithm. For quantum Hamiltonians, designing provably correct Gibbs samplers has been more challenging. We revisit the inspiration for the Metropolis-style algorithm and incorporate weak measurement to design a conceptually simple and provably correct quantum Gibbs sampler.
  arXiv  Detail & Related papers  (2024-06-23T06:05:01Z)
• 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)
• 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)
• Simplifying the simulation of local Hamiltonian dynamics [0.0]
  Local Hamiltonians, $H_k$, describe non-trivial $k$-body interactions in quantum many-body systems. We build upon known methods to derive examples of $H_k$ and $H_k'$ that simulate the same physics. We propose a method to search for the $k'$-local Hamiltonian that simulates, with the highest possible precision, the short time dynamics of a given $H_k$ Hamiltonian.
  arXiv  Detail & Related papers  (2023-10-10T22:31:45Z)
• 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)
• 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)
• 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.