Curator's Take
AI Commentary
This article matters because it quantifies how much “magic”—the non‑stabiliser resource essential for quantum speed‑up—is actually consumed when IQP circuits are used as generative models, moving the discussion from abstract expressivity to concrete hardware cost. By showing that trained sparse IQP circuits generate target distributions with surprisingly little intermediate magic, especially compared with phase‑randomised states, the work positions IQP‑based generators as realistic candidates for early fault‑tolerant demonstrations of quantum advantage. It also bridges two active strands—resource‑theoretic analysis and quantum generative modelling—offering a practical metric (Jensen‑Shannon divergence on the probability simplex) that experimental teams can use to benchmark resource efficiency.
— Mark Eatherly
Summary
Quantum generative modelling casts sampling as a generative task: a parametrised quantum circuit is trained such that sampling reproduces a target probability distribution. Instantaneous Quantum Polynomial-time (IQP) circuits combine structural simplicity with complexity-theoretic evidence for quantum advantage. Yet their practical value depends not only on expressivity, but on how efficiently they consume genuinely quantum resources. We study this question through the lens of magic, or non-stabiliserness, as a resource for quantum generative modelling. We show that established fidelity- and geodesic-based notions of computational progress in a projective Hilbert space are ill-suited to generative models, since operational performance is determined by output probability distributions rather than quantum states themselves. We evaluate magic-consumption directly on the probability simplex, using changes in Jensen-Shannon divergence to quantify progress. Applying this framework to trained random γ-sparse IQP circuits shows signatures of efficient magic use, with the dominant contribution arising from two-qubit gates. As IQP circuits produce remarkably low intermediate magic relative to phase-randomised states with the same sampling distributions, this renders IQP-based quantum generative models as promising candidates for resource-efficient demonstrations of quantum advantage on early fault-tolerant architectures.