Quantum Scrambling Born Machine
Marcin P{\l}odzie\'n

TL;DR
This paper introduces a Quantum Scrambling Born Machine that uses a fixed entangling unitary as a scrambling reservoir, enabling efficient quantum generative modeling with competitive performance to classical models.
Contribution
It proposes a novel quantum generative model leveraging fixed entangling unitaries and variational Hamiltonian training, demonstrating effectiveness across different entangling schemes.
Findings
Near-Haar entanglement suffices for learning target distributions.
Model performance is robust to the microscopic details of the entangler.
Variational Hamiltonian approach achieves competitive results with classical models.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Quantum Information and Cryptography
