Quantum mixture-density network for multimodal probabilistic prediction
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917224196866048 |
|---|---|
| author | Seo, Jaemin |
| author_facet | Seo, Jaemin |
| contents | Multimodal probability distributions are common in both quantum and classical systems, yet modeling them remains challenging when the number of modes is large or unknown. Classical methods such as mixture-density networks (MDNs) scale poorly, requiring parameter counts that grow quadratically with the number of modes. We introduce a Quantum Mixture-Density Network (Q-MDN) that employs parameterized quantum circuits to efficiently model multimodal distributions. By representing an exponential number of modes with a compact set of qubits and parameters, Q-MDN predicts Gaussian mixture components with high resolution. We evaluate Q-MDN on two benchmark tasks: the quantum double-slit experiment and chaotic logistic bifurcation. In both cases, Q-MDN outperforms classical MDNs in mode separability and prediction sharpness under equal parameter budgets. Our results demonstrate an efficiency in probabilistic regression and highlight the potential of quantum machine learning in capturing complex stochastic behavior. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_09497 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum mixture-density network for multimodal probabilistic prediction Seo, Jaemin Quantum Physics Multimodal probability distributions are common in both quantum and classical systems, yet modeling them remains challenging when the number of modes is large or unknown. Classical methods such as mixture-density networks (MDNs) scale poorly, requiring parameter counts that grow quadratically with the number of modes. We introduce a Quantum Mixture-Density Network (Q-MDN) that employs parameterized quantum circuits to efficiently model multimodal distributions. By representing an exponential number of modes with a compact set of qubits and parameters, Q-MDN predicts Gaussian mixture components with high resolution. We evaluate Q-MDN on two benchmark tasks: the quantum double-slit experiment and chaotic logistic bifurcation. In both cases, Q-MDN outperforms classical MDNs in mode separability and prediction sharpness under equal parameter budgets. Our results demonstrate an efficiency in probabilistic regression and highlight the potential of quantum machine learning in capturing complex stochastic behavior. |
| title | Quantum mixture-density network for multimodal probabilistic prediction |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2506.09497 |