Metraipolis › archive › dc_a735f2cbde71
Classical training of conditional instantaneous quantum polynomial-time Born machines — arXiv:2611.05483
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05483
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:22:29.858Z
- SHA-256 of the archived text
3f2abb9db7c9ef7278ac51892618fe074fa8fd6cf007c08dd1bda6580384cc4e- Stable URL of this page
https://metraipolis.com/documento/dc_a735f2cbde71
How to cite
Classical training of conditional instantaneous quantum polynomial-time Born machines — arXiv:2611.05483 — arXiv (en), https://arxiv.org/abs/2611.05483 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a735f2cbde71 (Metraipolis archive dc_a735f2cbde71, sha256 3f2abb9db7c9ef7278ac51892618fe074fa8fd6cf007c08dd1bda6580384cc4e)
BibTeX
@misc{dca735f2cbde71,
title = {Classical training of conditional instantaneous quantum polynomial-time Born machines — arXiv:2611.05483},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05483},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a735f2cbde71; sha256 3f2abb9db7c9ef7278ac51892618fe074fa8fd6cf007c08dd1bda6580384cc4e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05483. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Instantaneous quantum polynomial-time (IQP) Born machines are attractive quantum generative models, as certain IQP circuit families are conjectured to be hard to sample, yet they can be trained classically. Previously proposed conditional IQP Born machines make the parameters of the diagonal layer condition dependent. We introduce conditional IQP Born machines, in which the condition is encoded in the input state and a single IQP unitary is shared across conditions. Efficient sampling and amplitude-ratio evaluation for the reference state entering the diagonal layer suffice to obtain unbiased classical estimates of a conditional maximum mean discrepancy objective and its gradients. We show that input conditioning can represent conditional families that no diagonally conditioned IQP model with the same number of qubits can reproduce. For the sixteen-qubit Curie-Weiss spin model, a single conditional model captures the magnetization transition at held-out temperatures. Its mean total variation distance is six times lower than that of diagonal conditioning under the same protocol and comparable to that of classical generative models with up to seven times as many parameters. We also train conditional models classically with up to 2048 qubits, which reproduce the mean squared magnetization of the target away from the crossover. These results extend classically trained IQP Born machines to conditional generation. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2611.05483 — 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:15:49.028Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).