Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.35665

$κ$-Parametrized Boltzmann Distribution Sampling on Quantum Approximate Optimization Algorithm

João Marcos Cavalcanti de Albuquerque Neto, Gustavo Castro do Amaral, Guilherme Penello Temporão

quant-phSubmitted Oct 26, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

Generative models use training data to produce new samples that resemble the original, with applications in classification and recommendation systems. Restricted Boltzmann Machines (RBMs) are at the core of generative models but suffer from the computational intractability of training, which relies on sampling an unknown Boltzmann Distribution (BD). The Quantum Approximate Optimization Algorithm (QAOA) can assist RBM training, potentially providing benefits over strictly classical strategies. One particular problem is determining the quantum circuit depth for an arbitrary problem size that yields the expected sampling results. In this study, we evaluate QAOA-assisted sampling of BDs using Qiskit's Aer Simulator by analysing the inverse effective temperature of the distribution, $κ$, for tractable problem sizes. The results provide numerical evidence, based on Qiskit Aer simulations, that parameterized annealing-scheduled QAOA (PAQ-QAOA) can approximate RBM Boltzmann sampling for the tractable instances considered, while hardware performance and scaling remain open questions.

AI Summary

The paper asks whether annealing-scheduled QAOA can approximate the joint Boltzmann distribution of a restricted Boltzmann machine (RBM), and whether an effective inverse temperature $\kappa$ can identify circuit parameters yielding the target distribution. It uses a transverse-field mixer and an RBM-derived Ising cost Hamiltonian, with fixed linear-schedule angles $\beta_k=(1-k/p)\Delta t$ and $\gamma_k=(k/p)\Delta t$, rather than variational angle optimization. Qiskit Aer simulations examine one randomly initialized RBM instance at each of $n=6$ and $n=19$ qubits, with $p=10$ layers. For each instance, $\Delta t$ is swept over 1,000 uniformly spaced points in $[0,\pi]$, using $10^6$ shots per point. Sampled distributions are compared with exactly computed target probabilities through KL divergence. An effective temperature is fitted by maximum likelihood to $P_\kappa(x)\propto e^{-\kappa E(x)}$, equivalently matching the sampled mean energy. The simulations distinguish approximately uniform, intermediate non-adiabatic, and ground-state-concentrated sampling regimes. At six qubits, sampled KL-divergence values closely follow the thermal-model prediction, with the minimum near $\kappa=1$. At 19 qubits, they depart from that prediction and the minimum shifts away from unity. The study does not establish a predictive relationship between system size, depth, time step, and $\kappa$; choosing sampling parameters remains unresolved. Reported evidence is limited to tractable simulator instances, with one instance per size. Hardware performance, scaling, shot requirements, and the origin of the larger-instance deviations remain open.

Little sign of AI-generated textIncrementalSmall numerics onlyUnclear noveltyMissing comparison

Error found: The paper interprets the larger-instance discrepancy as requiring an unknown correction factor, although maximum-likelihood temperature fitting matches only mean energy and the discrepancy can instead reflect a non-Boltzmann output distribution.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
8 pages, 4 figures

Related papers

Online Calibration Scheme for Training Restricted Boltzmann Machines with Quantum Annealing

Takeru Goto, Masayuki Ohzeki

We propose a scheme to calibrate the internal parameters of a quantum annealer to obtain well-approximated samples for training a restricted Boltzmann machine (RBM). Empirically, samples from quantum annealers obey the Boltzmann distribution, making them suitable for RBM training. Quantum annealers utilize physical phenomena to generate a large number of samples in a short time. However, hardware imperfections make it challenging to obtain accurate samples. Existing research often estimates the inverse temperature for the compensation. Our scheme efficiently utilizes samples for RBM training also to estimate internal parameters. Furthermore, we consider additional parameters and demonstrate that they improve sample quality. We evaluate our approach by comparing the obtained samples with classical Gibbs sampling, which theoretically generates accurate samples. Our results indicate that our scheme demonstrates performance on par with Gibbs sampling. In addition, the training results with our estimation scheme outperform those of the contrastive divergence algorithm, a standard training algorithm for RBM.

arXiv:2307.09785•Journal of the Physical Society of Japan•Feb 16, 2025•9 citations

A Quantum-Assisted Algorithm for Sampling Applications in Machine Learning

Alejandro Perdomo‐Ortiz, Marcello Benedetti, John Realpe-Gómez +1 more

An increase in the efficiency of sampling from Boltzmann distributions would have a significant impact in deep learning and other machine learning applications. Recently, quantum annealers have been proposed as a potential candidate to speed up this task, but several limitations still bar these state-of-the-art technologies from being used effectively. One of the main limitations is that, while the device may indeed sample from a Boltzmann-like distribution, quantum dynamical arguments suggests it will do so with an instance-dependent effective temperature, different from the physical temperature of the device. Unless this unknown temperature can be unveiled, it might not be possible to effectively use a quantum annealer for Boltzmann sampling. In this talk, we present a strategy to overcome this challenge with a simple effective-temperature estimation algorithm. We provide a systematic study assessing the impact of the effective temperatures in the learning of a kind of restricted Boltzmann machine embedded on quantum hardware, which can serve as a building block for deep learning architectures. We also provide a comparison to k-step contrastive divergence (CD-k) with k up to 100. Although assuming a suitable fixed effective temperature also allows to outperform one step contrastive divergence (CD-1), only when using an instance-dependent effective temperature we find a performance close to that of CD-100 for the case studied here. We discuss generalizations of the algorithm to other more expressive generative models, beyond restricted Boltzmann machines.

•Aug 24, 2016•0 citations

Diabatic quantum annealing for training energy-based generative models

Gilhan Kim, Ju-Yeon Gyhm, Daniel K. Park

Energy-based generative models, such as restricted Boltzmann machines (RBMs), require unbiased Boltzmann samples for effective training. Classical Markov chain Monte Carlo methods, however, converge slowly and yield correlated samples, making large-scale training difficult. We address this bottleneck by applying the analytic relation between annealing schedules and effective inverse temperature in diabatic quantum annealing. By implementing this prescription on a quantum annealer, we obtain temperature-controlled Boltzmann samples that enable RBM training with faster convergence and lower validation error than classical sampling. We further identify a systematic temperature misalignment intrinsic to analog quantum computers and propose an analytical rescaling method that mitigates this hardware noise, thereby enhancing the practicality of quantum annealers as Boltzmann samplers. In our method, the model's connectivity is set directly by the qubit connectivity, transforming the computational complexity inherent in classical sampling into a requirement on quantum hardware. This shift allows the approach to extend naturally from RBMs to fully connected Boltzmann machines, opening opportunities inaccessible to classical training methods.

arXiv:2509.09374•Physical review. E•Feb 6, 2026•1 citation

Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems

Sami Khairy, Ruslan Shaydulin, Lukasz Cincio +2 more

Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.

arXiv:1911.11071•Proceedings of the AAAI Conference on Artificial Intelligence•Apr 3, 2020•117 citations

QAOA pseudo-Boltzmann sampling beyond the rapid-mixing regime on superconducting quantum computers

Feliks Kivelä, Pablo Díez-Valle, Juan José García‐Ripoll +1 more

Abstract The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm developed for solving combinatorial optimization problems. It has also been shown to generate pseudo-Boltzmann distributions, with potential applications in various fields of computer science and computational physics. In this work, we build upon previous theoretical results and demonstrate pseudo-Boltzmann sampling with single-layer QAOA on real superconducting quantum computers. We show that the pseudo-Boltzmann distribution and the ability to adjust its effective temperature survive the accumulated errors of a real, noisy superconducting quantum processor. On an IBM processor, we are able to reach temperatures below a classical minimum-temperature boundary that guarantees the rapid mixing of single-site Glauber dynamics. We also run controlled simulations of QAOA with various noise models to characterize how increasing error rates raises the effective temperature of the distribution and limits the lowest accessible temperature.

Quantum Science and Technology•Sep 17, 2026•0 citations

Software techniques for training restricted Boltzmann machines on size-constrained quantum annealing hardware

Ilmo Salmenperä, Jukka K. Nurminen

Restricted Boltzmann machines are common machine learning models that can utilize quantum annealing devices in their training processes as quantum samplers. While this approach has shown promise as an alternative to classical sampling methods, the limitations of quantum annealing hardware, such as the number of qubits and the lack of connectivity between the qubits, still pose a barrier to wide-scale adoption. We propose the use of multiple software techniques such as dropout method, passive labeling, and parallelization techniques for addressing these hardware limitations. The study found that using these techniques along with quantum sampling showed comparable results to its classical counterparts in certain contexts, while in others the increased complexity of the sampling process hindered the performance of the trained models. This means that further research into the behavior of quantum sampling needs to be done to apply quantum annealing to training tasks of more complicated RBM models.

Frontiers in Computer Science•Oct 16, 2023•3 citations
κκκ-Parametrized Boltzmann Distribution Sampling on Quantum Approximate Optimization Algorithm
Generative models use training data to produce new samples that resemble the original, with applications in classification and recommendation systems. Restricted Boltzmann Machines (RBMs) are at the core of generative models but suffer from the computational intractability of training, which relies on sampling an unknown Boltzmann Distribution (BD). The Quantum Approximate Optimization Algorithm (QAOA) can assist RBM training, potentially providing benefits over strictly classical strategies. One particular problem is determining the quantum circuit depth for an arbitrary problem size that yields the expected sampling results. In this study, we evaluate QAOA-assisted sampling of BDs using Qiskit's Aer Simulator by analysing the inverse effective temperature of the distribution, κκκ, for tractable problem sizes. The results provide numerical evidence, based on Qiskit Aer simulations, that parameterized annealing-scheduled QAOA (PAQ-QAOA) can approximate RBM Boltzmann sampling for the tractable instances considered, while hardware performance and scaling remain open questions.
The paper asks whether annealing-scheduled QAOA can approximate the joint Boltzmann distribution of a restricted Boltzmann machine (RBM), and whether an effective inverse temperature κ\kappaκ can identify circuit parameters yielding the target distribution. It uses a transverse-field mixer and an RBM-derived Ising cost Hamiltonian, with fixed linear-schedule angles βk=(1−k/p)Δt\beta_k=(1-k/p)\Delta tβk​=(1−k/p)Δt and γk=(k/p)Δt\gamma_k=(k/p)\Delta tγk​=(k/p)Δt, rather than variational angle optimization.
Qiskit Aer simulations examine one randomly initialized RBM instance at each of n=6n=6n=6 and n=19n=19n=19 qubits, with p=10p=10p=10 layers. For each instance, Δt\Delta tΔt is swept over 1,000 uniformly spaced points in [0,π][0,\pi][0,π], using 10610^6106 shots per point. Sampled distributions are compared with exactly computed target probabilities through KL divergence. An effective temperature is fitted by maximum likelihood to Pκ(x)∝e−κE(x)P_\kappa(x)\propto e^{-\kappa E(x)}Pκ​(x)∝e−κE(x), equivalently matching the sampled mean energy.
The simulations distinguish approximately uniform, intermediate non-adiabatic, and ground-state-concentrated sampling regimes. At six qubits, sampled KL-divergence values closely follow the thermal-model prediction, with the minimum near κ=1\kappa=1κ=1. At 19 qubits, they depart from that prediction and the minimum shifts away from unity.
The study does not establish a predictive relationship between system size, depth, time step, and κ\kappaκ; choosing sampling parameters remains unresolved. Reported evidence is limited to tractable simulator instances, with one instance per size. Hardware performance, scaling, shot requirements, and the origin of the larger-instance deviations remain open.
We propose a scheme to calibrate the internal parameters of a quantum annealer to obtain well-approximated samples for training a restricted Boltzmann machine (RBM). Empirically, samples from quantum annealers obey the Boltzmann distribution, making them suitable for RBM training. Quantum annealers utilize physical phenomena to generate a large number of samples in a short time. However, hardware imperfections make it challenging to obtain accurate samples. Existing research often estimates the inverse temperature for the compensation. Our scheme efficiently utilizes samples for RBM training also to estimate internal parameters. Furthermore, we consider additional parameters and demonstrate that they improve sample quality. We evaluate our approach by comparing the obtained samples with classical Gibbs sampling, which theoretically generates accurate samples. Our results indicate that our scheme demonstrates performance on par with Gibbs sampling. In addition, the training results with our estimation scheme outperform those of the contrastive divergence algorithm, a standard training algorithm for RBM.
An increase in the efficiency of sampling from Boltzmann distributions would have a significant impact in deep learning and other machine learning applications. Recently, quantum annealers have been proposed as a potential candidate to speed up this task, but several limitations still bar these state-of-the-art technologies from being used effectively. One of the main limitations is that, while the device may indeed sample from a Boltzmann-like distribution, quantum dynamical arguments suggests it will do so with an instance-dependent effective temperature, different from the physical temperature of the device. Unless this unknown temperature can be unveiled, it might not be possible to effectively use a quantum annealer for Boltzmann sampling. In this talk, we present a strategy to overcome this challenge with a simple effective-temperature estimation algorithm. We provide a systematic study assessing the impact of the effective temperatures in the learning of a kind of restricted Boltzmann machine embedded on quantum hardware, which can serve as a building block for deep learning architectures. We also provide a comparison to k-step contrastive divergence (CD-k) with k up to 100. Although assuming a suitable fixed effective temperature also allows to outperform one step contrastive divergence (CD-1), only when using an instance-dependent effective temperature we find a performance close to that of CD-100 for the case studied here. We discuss generalizations of the algorithm to other more expressive generative models, beyond restricted Boltzmann machines.
Energy-based generative models, such as restricted Boltzmann machines (RBMs), require unbiased Boltzmann samples for effective training. Classical Markov chain Monte Carlo methods, however, converge slowly and yield correlated samples, making large-scale training difficult. We address this bottleneck by applying the analytic relation between annealing schedules and effective inverse temperature in diabatic quantum annealing. By implementing this prescription on a quantum annealer, we obtain temperature-controlled Boltzmann samples that enable RBM training with faster convergence and lower validation error than classical sampling. We further identify a systematic temperature misalignment intrinsic to analog quantum computers and propose an analytical rescaling method that mitigates this hardware noise, thereby enhancing the practicality of quantum annealers as Boltzmann samplers. In our method, the model's connectivity is set directly by the qubit connectivity, transforming the computational complexity inherent in classical sampling into a requirement on quantum hardware. This shift allows the approach to extend naturally from RBMs to fully connected Boltzmann machines, opening opportunities inaccessible to classical training methods.
Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.
Abstract The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm developed for solving combinatorial optimization problems. It has also been shown to generate pseudo-Boltzmann distributions, with potential applications in various fields of computer science and computational physics. In this work, we build upon previous theoretical results and demonstrate pseudo-Boltzmann sampling with single-layer QAOA on real superconducting quantum computers. We show that the pseudo-Boltzmann distribution and the ability to adjust its effective temperature survive the accumulated errors of a real, noisy superconducting quantum processor. On an IBM processor, we are able to reach temperatures below a classical minimum-temperature boundary that guarantees the rapid mixing of single-site Glauber dynamics. We also run controlled simulations of QAOA with various noise models to characterize how increasing error rates raises the effective temperature of the distribution and limits the lowest accessible temperature.
Restricted Boltzmann machines are common machine learning models that can utilize quantum annealing devices in their training processes as quantum samplers. While this approach has shown promise as an alternative to classical sampling methods, the limitations of quantum annealing hardware, such as the number of qubits and the lack of connectivity between the qubits, still pose a barrier to wide-scale adoption. We propose the use of multiple software techniques such as dropout method, passive labeling, and parallelization techniques for addressing these hardware limitations. The study found that using these techniques along with quantum sampling showed comparable results to its classical counterparts in certain contexts, while in others the increased complexity of the sampling process hindered the performance of the trained models. This means that further research into the behavior of quantum sampling needs to be done to apply quantum annealing to training tasks of more complicated RBM models.