Boltzmann Sampling of Frustrated J1 - J2 Ising Models with Programmable Quantum Annealers

• URL: http://arxiv.org/abs/2511.03796v1
• Date: Wed, 05 Nov 2025 19:01:55 GMT
• Title: Boltzmann Sampling of Frustrated J1 - J2 Ising Models with Programmable Quantum Annealers
• Authors: Elijah Pelofske,
• Abstract summary: 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.
• Score: 4.670305538969914
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: One of the surprising, and potentially very useful, capabilities of analog quantum computers, such as D-Wave quantum annealers, is sampling from the Boltzmann, or Gibbs, distribution defined by a classical Hamiltonian. In this study, we thoroughly examine the ability of D-Wave quantum annealers to sample from the Boltzmann distribution defined of a canonical type of competing magnetic frustration $J_1$-$J_2$ model; the ANNNI (axial next-nearest-neighbor Ising) model. Boltzmann sampling error rate is quantified for standard linear-ramp anneals ranging from $5$ nanosecond annealing times up to $2000$ microseconds on two different D-Wave quantum annealing processors. Interestingly, we find some analog hardware parameters which result in a very high accuracy (down to a TVD of $0.0003$) and low temperature sampling (down to $\beta=32.2$) in a frustrated region of the ANNNI model magnetic phase diagram. This bolsters the viability of current analog quantum computers for thermodynamic sampling applications of highly frustrated magnetic spin systems.

Related papers

• Partition Function Estimation Using Analog Quantum Processors [4.239775815863115]
  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.
  arXiv  Detail & Related papers  (2025-12-22T18:58:46Z)
• Metamagnetic Transition in Low-Dimensional Site-Decorated Quantum Heisenberg Ferrimagnets [0.0]
  We present a theoretical study of quantum Heisenberg ferrimagnets in a magnetic field.<n>We find two finite-temperature second-order transitions; just above $T_c2$ a half-ice, half-fire'' regime appears.<n>These results may shed light on new technological applications of low-dimensional quantum spin systems.
  arXiv  Detail & Related papers  (2025-11-09T16:24:45Z)
• FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
  We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
  arXiv  Detail & Related papers  (2025-10-13T07:57:21Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Analysis of a Programmable Quantum Annealer as a Random Number Generator [1.0878040851638]
  We present experimental random number results from a D-Wave 2000Q quantum annealer. The results show that the generated random bits from the D-Wave 2000Q are biased, and not unpredictable random bit sequences.
  arXiv  Detail & Related papers  (2023-07-05T18:15:06Z)
• 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 hybrid quantum-classical approach for inference on restricted Boltzmann machines [1.0928470926399563]
  A Boltzmann machine is a powerful machine learning model with many real-world applications. Statistical inference on a Boltzmann machine can be carried out by sampling from its posterior distribution. Quantum computers have the promise of solving some non-trivial problems in an efficient manner.
  arXiv  Detail & Related papers  (2023-03-31T11:10:31Z)
• 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)
• Assessment of image generation by quantum annealer [0.0]
  A quantum annealer may also serve as a fast sampler for the Ising spin-glass problem. In this study, we focused on the performance of a quantum annealer as a generative model.
  arXiv  Detail & Related papers  (2021-03-15T13:24:05Z)
• 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.