Posted

Mario Herrero-Gonzalez, Brian Coyle, Kieran McDowall, Ross Grassie, Sjoerd Beentjes, Ava Khamseh, Elham Kashefi (Nov 04 2025).
Abstract: Quantum Circuit Born Machines (QCBMs) are powerful quantum generative models that sample according to the Born rule, with complexity-theoretic evidence suggesting potential quantum advantages for generative tasks. Here, we identify QCBMs as a quantum Fourier model independently of the loss function. This allows us to apply known dequantization conditions when the optimal quantum distribution is available. However, realizing this distribution is hindered by trainability issues such as vanishing gradients on quantum hardware. Recent train-classical, deploy-quantum approaches propose training classical surrogates of QCBMs and using quantum devices only for inference. We analyze the limitations of these methods arising from deployment discrepancies between classically trained and quantumly deployed parameters. Using the Fourier decomposition of the Born rule in terms of correlators, we quantify this discrepancy analytically. Approximating the decomposition via distribution truncation and classical surrogation provides concrete examples of such discrepancies, which we demonstrate numerically. We study this effect using tensor-networks and Pauli-propagation-based classical surrogates. Our study examines the use of IQP circuits, matchcircuits, Heisenberg-chain circuits, and Haldane-chain circuits for the QCBM ansatz. In doing so, we derive closed-form expressions for Pauli propagation in IQP circuits and the dynamical Lie algebra of the Haldane chain, which may be of independent interest.

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!