Partition Function Estimation Using Analog Quantum Processors

• URL: http://arxiv.org/abs/2512.19685v1
• Date: Mon, 22 Dec 2025 18:58:46 GMT
• Title: Partition Function Estimation Using Analog Quantum Processors
• Authors: Thinh Le, Elijah Pelofske,
• Abstract summary: We evaluate using programmable superconducting flux qubit D-Wave quantum annealers to approximate the partition function of Ising models.<n>We find that fast quench-like anneals can quickly generate ensemble distributions that are very good estimates of the true partition function of the classical Ising model.
• Score: 4.239775815863115
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We evaluate using programmable superconducting flux qubit D-Wave quantum annealers to approximate the partition function of Ising models. We propose the use of two distinct quantum annealer sampling methods: chains of Monte Carlo-like reverse quantum anneals, and standard linear-ramp quantum annealing. The control parameters used to attenuate the quality of the simulations are the effective analog energy scale of the J coupling, the total annealing time, and for the case of reverse annealing the anneal-pause. The core estimation technique is to sample across the energy spectrum of the classical Hamiltonian of interest, and therefore obtain a density of states estimate for each energy level, which in turn can be used to compute an estimate of the partition function with some sampling error. This estimation technique is powerful because once the distribution is sampled it allows thermodynamic quantity computation at arbitrary temperatures. On a $25$ spin $\pm J$ hardware graph native Ising model we find parameter regimes of the D-Wave processors that provide comparable result quality to two standard classical Monte Carlo methods, Multiple Histogram Reweighting and Wang-Landau. Remarkably, we find that fast quench-like anneals can quickly generate ensemble distributions that are very good estimates of the true partition function of the classical Ising model; on a Pegasus graph-structured QPU we report a logarithmic relative error of $7.6 \times 10^{-6}$, from $171,000$ samples generated using $0.2$ seconds of QPU time with an anneal time of $8$ nanoseconds per sample which is interestingly within the closed system dynamics timescale of the superconducting qubits.

Related papers

• Boltzmann Sampling of Frustrated J1 - J2 Ising Models with Programmable Quantum Annealers [4.670305538969914]
  D-Wave quantum annealers can sample from the Boltzmann, or Gibbs, distribution defined by a classical Hamiltonian.<n>We find some analog hardware parameters which result in a very high accuracy (down to a TVD of $0.0003$) and low temperature sampling.<n>This bolsters the viability of current analog quantum computers for thermodynamic sampling applications of highly frustrated magnetic spin systems.
  arXiv  Detail & Related papers  (2025-11-05T19:01:55Z)
• Digitized Counterdiabatic Quantum Sampling [29.85893589594055]
  We propose a hybrid quantum-classical algorithm for efficient sampling from energy-based models, such as low-temperature Boltzmann distributions.<n>We show that classical sampling algorithms, including Metropolis-Hastings and the state-of-the-art low-temperature technique parallel tempering, require up to three orders of magnitude more samples to match the quality of DCQS.
  arXiv  Detail & Related papers  (2025-10-30T17:32:49Z)
• Iterated Denoising Energy Matching for Sampling from Boltzmann Densities [109.23137009609519]
  Iterated Denoising Energy Matching (iDEM) iDEM alternates between (I) sampling regions of high model density from a diffusion-based sampler and (II) using these samples in our matching objective. We show that the proposed approach achieves state-of-the-art performance on all metrics and trains $2-5times$ faster.
  arXiv  Detail & Related papers  (2024-02-09T01:11:23Z)
• 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)
• A quantum spectral method for simulating stochastic processes, with applications to Monte Carlo [4.134846879110833]
  We introduce a new analog'' quantum representation of processes, in which the value of the process at time t is stored in the amplitude of the quantum state. We show that we can simulate $T$ timesteps of fractional Brownian motion using a quantum circuit with gate complexity $textpolylog(T)$, which coherently prepares the superposition over Brownian paths. We then show this can be combined with quantum mean estimation to create end to end algorithms for estimating certain time averages over processes in time $O(textpolylog(Tepsilon
  arXiv  Detail & Related papers  (2023-03-12T17:54:38Z)
• Algorithmic Shadow Spectroscopy [0.0]
  We present a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubits) We demonstrate that our method is intuitively easy to use in practice, robust against gate noise, to a new type of algorithmic error mitigation technique, and uses orders of magnitude fewer number of shots than typical near-term quantum algorithms -- as low as 10 shots per timestep is sufficient.
  arXiv  Detail & Related papers  (2022-12-21T14:23:48Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Faster spectral density calculation using energy moments [77.34726150561087]
  We reformulate the recently proposed Gaussian Integral Transform technique in terms of Fourier moments of the system Hamiltonian. One of the main advantages of this framework is that it allows for an important reduction of the computational cost.
  arXiv  Detail & Related papers  (2022-11-01T23:57:58Z)
• 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)
• Perils of Embedding for Quantum Sampling [0.0]
  A common approach is to minor embed the desired Hamiltonian in a native Hamiltonian. Here, we consider quantum thermal sampling in the transverse-field Ising model. We simulate systems of much larger sizes and larger transverse-field strengths than would otherwise be possible.
  arXiv  Detail & Related papers  (2021-03-12T01:49:52Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)

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.