English

Quantum Scrambling Born Machine

Quantum Physics 2026-02-20 v1 Machine Learning

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.

Keywords

Cite

@article{arxiv.2602.17281,
  title  = {Quantum Scrambling Born Machine},
  author = {Marcin Płodzień},
  journal= {arXiv preprint arXiv:2602.17281},
  year   = {2026}
}
R2 v1 2026-07-01T10:42:47.347Z