κ-Parametrized Boltzmann Distribution Sampling on Quantum Approximate Optimization Algorithm

@misc{neto2026κparametrized,
  title = {{$κ$-Parametrized Boltzmann Distribution Sampling on Quantum Approximate Optimization Algorithm}},
  author = {João Marcos Cavalcanti de Albuquerque Neto and Gustavo Castro do Amaral and Guilherme Penello Temporão},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.35665},
  eprint = {2610.35665},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.35665},
}

TY  - UNPB
TI  - κ-Parametrized Boltzmann Distribution Sampling on Quantum Approximate Optimization Algorithm
AU  - João Marcos Cavalcanti de Albuquerque Neto
AU  - Gustavo Castro do Amaral
AU  - Guilherme Penello Temporão
PY  - 2026
DA  - 2026/10/26
PB  - arXiv
DO  - 10.48550/arxiv.2610.35665
UR  - https://arxiv.org/abs/2610.35665
AB  - 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.
ER  -