Papers › Quantum mixture-density network for multimodal probabilistic prediction
Quantum mixture-density network for multimodal probabilistic prediction
Jaemin Seo
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections