arXiv:2609.23050
Quantum Generative Modeling with a Coherent Memory, Exact Training and a Memory-Dimension Advantage
Jamal Slim. Saverio Monaco, Ran Xue, Dirk Kruecker, Kerstin Borras
Abstract
We introduce the coherent memory Born machine (CoMB), an algorithm for quantum generative modeling on a register whose size does not depend on the dimension of the data. CoMB generates a sample one component per round. In each round, a work register is entangled with a memory register and measured, and the outcome gives one component. The memory is never measured and carries correlations between rounds. We show that the characteristic function of the generated distribution is a product of small matrices, one per round. This gives exact training, with maximum mean discrepancy losses and gradients costing time linear in the data dimension, without sampling or likelihood. We also compile every round onto one work qubit and evaluate device noise exactly. To isolate coherence, each CoMB is compared with its dephased twin and with equally trained classical hidden Markov models. We benchmark it on continuous data, $368$-cell calorimeter showers from five qubits, and on sequential data, handwritten digits from three qubits. The coherent memory provides a memory-dimension advantage. Four coherent levels do the work of about six classical states on both benchmarks, and of at least five with $95\%$ confidence on showers at every training budget, including convergence. On showers, removing their coherence raises the loss by $23$ to $31\%$. With eight levels, where all models approach a common floor, coherent and classical memories become indistinguishable with longer training. On an IBM Heron processor, the memory carries two thirds of the inter-round correlation through twelve mid-circuit measurements.
AI Summary
The paper asks whether a small coherent quantum memory can learn high-dimensional generative distributions with fewer memory levels than a classical hidden Markov model (HMM). Its coherent memory Born machine emits one token per round by measuring and resetting a work register while retaining an unmeasured memory. Continuous outputs use learned bin readouts and a fixed linear decoder. A tilted-instrument identity expresses characteristic functions as products of maps on the memory. This enables sampling-free evaluation and differentiation of random-feature maximum mean discrepancy (MMD) objectives, costing $O(RdK\chi^3)$ per step for $R$ frequencies, $d$ rounds, $K$ tokens and memory dimension $\chi$. The paper also gives binary-tree compilation onto one work qubit and exact evaluation under specified noise models. Comparisons use dephased twins and equally trained classical HMMs. On 368-cell calorimeter showers, five-qubit circuits with $\chi=4$ achieve a converged held-out MMD loss 15% below the four-state HMM; their equivalent classical memory is approximately 5.8 states, with a bootstrap 95% interval of 5.0–7.2. Their loss is 23–31% below the dephased twin across training budgets. Digits yield approximately 6.2 equivalent classical states. At $\chi=8$, coherent and classical performance becomes indistinguishable with longer training. A processor experiment preserves about two thirds of inter-round correlation over twelve rounds. All models are classically simulable; no computational or practical advantage is claimed. Classical baselines are trained, not provably optimal. Showers remain distinguishable from reference simulations, digits use fixed training budgets, shared readouts impose a fidelity floor, and hardware execution covers only twelve of 369 rounds.
Central claim may not hold: The claimed comparison with the most general classical memory uses factorized transition and emission matrices rather than unrestricted outcome-dependent classical transitions, so the reported memory-dimension advantage is established only against a restricted classical family. The abstract says dephasing raises the four-level shower loss by 23–31%, but the reported losses imply increases of approximately 30–45%; 23–31% uses the dephased loss as the denominator instead.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.