Slow Mixing of Quantum Gibbs Samplers

• URL: http://arxiv.org/abs/2411.04300v2
• Date: Thu, 12 Dec 2024 16:51:32 GMT
• Title: Slow Mixing of Quantum Gibbs Samplers
• Authors: David Gamarnik, Bobak T. Kiani, Alexander Zlokapa,
• Abstract summary: 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. We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
• Score: 47.373245682678515
• License:
• Abstract: Preparing thermal (Gibbs) states is a common task in physics and computer science. Recent algorithms mimic cooling via system-bath coupling, where the cost is determined by mixing time, akin to classical Metropolis-like algorithms. However, few methods exist to demonstrate slow mixing in quantum systems, unlike the well-established classical tools for systems like the Ising model and constraint satisfaction problems. We present a quantum generalization of these tools through a generic bottleneck lemma that implies slow mixing in quantum systems. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles and quantified either through Bohr spectrum jumps or operator locality. Using our bottleneck lemma, we establish unconditional lower bounds on the mixing times of Gibbs samplers for several families of Hamiltonians at low temperatures. For classical Hamiltonians with mixing time lower bounds $T_\mathrm{mix} = \exp[\Omega(n^\alpha)]$, we prove that quantum Gibbs samplers also have $T_\mathrm{mix} = \exp[\Omega(n^\alpha)]$. This applies to models like random $K$-SAT instances and spin glasses. For stabilizer Hamiltonians, we provide a concise proof of exponential lower bounds $T_\mathrm{mix} = \exp[\Omega(n)]$ on mixing times of good $n$-qubit stabilizer codes at low constant temperature. Finally, we consider constant-degree classical Hamiltonians and show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques. We show generic results for models with linear free energy barriers, and we demonstrate that our techniques extend to models with sublinear free energy barriers by proving $T_\mathrm{mix} = \exp[n^{1/2-o(1)}]$ for the ferromagnetic 2D transverse field Ising model.

Related papers

• Polynomial Time Quantum Gibbs Sampling for Fermi-Hubbard Model at any Temperature [9.62464358196899]
  We prove a constant gap of the perturbed Lindbladian corresponding to interacting fermions up to some maximal coupling strength. This is achieved by using theorems about stability of the gap for lattice fermions. The gap then provides an upper bound on the mixing time, and hence on the overall complexity of the quantum algorithm.
  arXiv  Detail & Related papers  (2025-01-02T18:56:02Z)
• 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)
• Quantum walks advantage on the dihedral group for uniform sampling problem [0.0]
  This paper advances the general understanding of quantum walk mixing on Cayley graphs. It highlights the improved mixing time achieved by continuous-time quantum walks on $D_2n$. This work has potential applications in algorithms for a class of sampling problems based on non-abelian groups.
  arXiv  Detail & Related papers  (2023-12-25T11:21:55Z)
• 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)
• Uniform observable error bounds of Trotter formulae for the semiclassical Schrödinger equation [0.0]
  We show that the computational cost for a class of observables can be much lower than the state-of-the-art bounds. We improve the additive observable error bounds to uniform-in-$h$ observable error bounds. This is, to our knowledge, the first uniform observable error bound for semiclassical Schr"odinger equation.
  arXiv  Detail & Related papers  (2022-08-16T21:34:49Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• 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)
• 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.