analiza aiqbench
This research introduces a Quantum Scrambling Born Machine, demonstrating that near-Haar-typical entanglement from fixed reservoirs allows quantum generative models to learn target distributions with minimal sensitivity to the scrambler's specific implementation. By optimizing only single-qubit rotations or trainable Hamiltonian couplings, the approach achieves performance competitive with classical generative models while leveraging multi-qubit entanglement efficiently. This work highlights a viable near-term application for quantum computing in generative modeling where complex entangling operations are replaced by simpler, optimized components.
Quantum Scrambling Born Machine
arXiv:2602.17281v2 Announce Type: replace Abstract: Quantum generative modeling, where the Born rule naturally defines probability distributions through measurement of parameterized quantum states, is a promising near-term application of quantum computing. We propose a Quantum Scrambling Born Machine in which a fixed entangling unitary -- acting as a scrambling reservoir -- provides multi-qubit entanglement, while only single-qubit rotations are optimized. We consider three entangling unitaries -- a Haar random unitary and two physically realizable approximations, a finite-depth brickwork random circuit and analog time evolution under nearest-neighbor spin-chain Hamiltonians -- and show that, for the benchmark distributions and system sizes considered, once the entangler produces near-Haar-typical entanglement the model learns the target distribution with weak sensitivity to the scrambler's microscopic origin. Finally, promoting the Hamiltonian couplings to trainable parameters casts the generative task as a variational Hamiltonian problem, with performance competitive with representative classical generative models at matched parameter count.
Abstract:Quantum generative modeling, where the Born rule naturally defines probability distributions through measurement of parameterized quantum states, is a promising near-term application of quantum computing. We propose a Quantum Scrambling Born Machine in which a fixed entangling unitary -- acting as a scrambling reservoir -- provides multi-qubit entanglement, while only single-qubit rotations are optimized. We consider three entangling unitaries -- a Haar random unitary and two physically realizable approximations, a finite-depth brickwork random circuit and analog time evolution under nearest-neighbor spin-chain Hamiltonians -- and show that, for the benchmark distributions and system sizes considered, once the entangler produces near-Haar-typical entanglement the model learns the target distribution with weak sensitivity to the scrambler's microscopic origin. Finally, promoting the Hamiltonian couplings to trainable parameters casts the generative task as a variational Hamiltonian problem, with performance competitive with representative classical generative models at matched parameter count.
Quantum Physics (quant-ph); Machine Learning (cs.LG)
arXiv:2602.17281 [quant-ph]
(or arXiv:2602.17281v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2602.17281 Focus to learn more arXiv-issued DOI via DataCite
Phys. Rev. A 114, 012464 (2026)
https://doi.org/10.1103/qccv-flmq Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 254 cuvinte
Subiecte conexe

Quantum Measurement, How Reading a Qubit Works
Quantum Zeitgeist · 5 sept. 2026

Gray-codes help quantum machine learning grasp numbers faster
Quantum Zeitgeist · 14 oct. 2026

Quantum Circuits Cut Data Imbalance Recall Gap by 10–25%
Quantum Zeitgeist · 13 iul. 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026