$κ$-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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-26
DOI
https://doi.org/10.48550/arxiv.2610.35665
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

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

Guilherme P. Temporão, Gustavo Castro do Amaral, João Marcos Cavalcanti de Albuquerque Neto
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

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

Guilherme P. Temporão, Gustavo Castro do Amaral, João Marcos Cavalcanti de Albuquerque Neto
preprint en

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.

arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon