On Certifying Source Sampling Hardness in Quantum Generative Modeling
quant-ph
Submitted: 2026-09-23
Updated: 2026-09-23
Terminology
Sources
- Generative quantum advantage for classical and quantum problems
- Train on classical, deploy on quantum: scaling generative quantum machine learning to a thousand qubits
- Characterizing Trainability of Instantaneous Quantum Polynomial Circuit Born Machines
- Complexity-Theoretic Foundations of Quantum Supremacy Experiments
- The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits
- Toward Generative Quantum Utility via Correlation-Complexity Map
- Generative modeling with Gaussian Boson Sampling: classically trainable Bosonic Born Machines
- Fermionic Born Machines: Classical training of quantum generative models based on Fermion Sampling
- Generative IQP Circuit Learning with Physics-Informed Latent Initialization
- Limits of quantum generative models with classical sampling hardness
- Quantum Fourier Generative Models Trainable at Large Scale
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity