Metraipolis › archive › dc_ec030ae04839

Hardware Demonstration of Neural-Surrogated Quantum-Enhanced MCMC for Large-Scale Constrained Boltzmann Sampling — arXiv:2611.05883

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05883
License (as archived)
CC0-1.0
Archived
2026-11-05T18:32:47.349Z
SHA-256 of the archived text
3a97fcbe21a3aa6a47a6bf61bc733500be73f7bfa6fb46c36f82d51a7185676c
Stable URL of this page
https://metraipolis.com/documento/dc_ec030ae04839

How to cite

Hardware Demonstration of Neural-Surrogated Quantum-Enhanced MCMC for Large-Scale Constrained Boltzmann Sampling — arXiv:2611.05883 — arXiv (en), https://arxiv.org/abs/2611.05883 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ec030ae04839 (Metraipolis archive dc_ec030ae04839, sha256 3a97fcbe21a3aa6a47a6bf61bc733500be73f7bfa6fb46c36f82d51a7185676c)
BibTeX
@misc{dcec030ae04839,
  title = {Hardware Demonstration of Neural-Surrogated Quantum-Enhanced MCMC for Large-Scale Constrained Boltzmann Sampling — arXiv:2611.05883},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05883},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ec030ae04839; sha256 3a97fcbe21a3aa6a47a6bf61bc733500be73f7bfa6fb46c36f82d51a7185676c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05883. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Neural-surrogated quantum-enhanced Markov chain Monte Carlo (QeMCMC) uses neural networks trained on samples from the quantum approximate optimization algorithm (QAOA) to accelerate Boltzmann sampling. A divide-and-conquer strategy extends this approach to larger systems, but independently optimizing QAOA parameters for each subproblem is costly. In this paper, we develop a hardware-efficient implementation of neural-surrogated QeMCMC and demonstrate it using an IBM Quantum Heron r2 processor. Experiments with $N=144$ binary variables reveal faster autocorrelation decay for appropriate subproblem sizes while exposing challenges in neural-surrogate learning for larger blocks. We then extend the demonstration to a system with $N=1064$, where the autocorrelation decay rate per MCMC step is approximately $5.2$ and $12.3$ times those of global and local Kawasaki dynamics, respectively. These results demonstrate faster autocorrelation decay in a system exceeding one thousand variables using samples generated on quantum hardware.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.05883 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:22:49.015Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).