Efficient Quantum Gibbs Sampling with Local Circuits

• URL: http://arxiv.org/abs/2506.04321v1
• Date: Wed, 04 Jun 2025 18:00:02 GMT
• Title: Efficient Quantum Gibbs Sampling with Local Circuits
• Authors: Dominik Hahn, Ryan Sweke, Abhinav Deshpande, Oles Shtanko,
• Abstract summary: We show a way to implement breakthrough algorithms based on the simulation of well-designed dissipative processes.<n>We rigorously prove that the approximations we use have little effect on rapid mixing at high temperatures.<n>Results provide the first provably efficient quantum thermalization protocol implementable on near-term quantum devices.
• Score: 0.2796197251957244
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The problem of simulating the thermal behavior of quantum systems remains a central open challenge in quantum computing. Unlike well-established quantum algorithms for unitary dynamics, \emph{provably efficient} algorithms for preparing thermal states -- crucial for probing equilibrium behavior -- became available only recently with breakthrough algorithms based on the simulation of well-designed dissipative processes, a quantum-analogue to Markov chain Monte Carlo (MCMC) algorithms. We show a way to implement these algorithms avoiding expensive block encoding and relying only on dense local circuits, akin to Hamiltonian simulation. Specifically, our method leverages spatial truncation and Trotterization of exact quasilocal dissipative processes. We rigorously prove that the approximations we use have little effect on rapid mixing at high temperatures and allow convergence to the thermal state with small bounded error. Moreover, we accompany our analytical results with numerical simulations that show that this method, unlike previously thought, is within the reach of current generation of quantum hardware. These results provide the first provably efficient quantum thermalization protocol implementable on near-term quantum devices, offering a concrete path toward practical simulation of equilibrium quantum phenomena.

Related papers

• Real-time Sign-Problem-Suppressed Quantum Monte Carlo Algorithm For Noisy Quantum Circuit Simulations [3.6733372067077954]
  We present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems.<n>Our algorithm uses population dynamics to continuously suppress the sign problem, preventing its accumulation throughout the evolution.
  arXiv  Detail & Related papers  (2025-02-26T08:31:23Z)
• Variational quantum thermalizers based on weakly-symmetric nonunitary multi-qubit operations [0.0]
  Variational Quantum Thermalizers (VQTs) generate the thermal (Gibbs) state of a given Hamiltonian.<n>Current algorithms struggle at intermediate temperatures, where the target state is nonpure but exhibits entanglement.<n>We devise multi-qubit nonunitary operations that harness weak symmetries and thereby improve the performance of the algorithm.
  arXiv  Detail & Related papers  (2025-02-13T19:00:00Z)
• Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum Computer [0.40964539027092917]
  We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer. Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits. In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
  arXiv  Detail & Related papers  (2023-12-03T13:56:41Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Continuous-variable assisted thermal quantum simulation [1.6530012863603747]
  We present an experimentally feasible quantum algorithm assisted with continuous-variable simulating for quantum systems at finite temperatures. It is found that the important crossover phase diagram of the Kitaev ring can be accurately simulated by a quantum computer with only a few qubits. We propose a protocol implementable with superconducting or trapped ion quantum computers.
  arXiv  Detail & Related papers  (2020-05-31T09:04:02Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

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.