arXiv:2508. 12413v4 Announce Type: replace-cross Abstract: The flow matching has rapidly become a dominant paradigm in classical generative modeling, offering an efficient way to interpolate between two complex distributions.
arXiv:2607. 00301v1 Announce Type: new Abstract: The emergence of powerful deep generative models based on diffusion and flow matching has enabled the learning and modeling of complex distributions.
Quantum MeanFlow (QMF) is a new quantum generative sampling method that enables single‑step sample generation by learning an average velocity field over a time interval, unlike the multi‑step quantum flow matching (QFM) which requires sequential integration of an ordinary differential equation. Using parameterized quantum circuits, the authors benchmark QMF and QFM on the MNIST dataset, finding that QMF produces lower image quality than multi‑step QFM but outperforms single‑step QFM at every shot count. Both models were executed on IBM quantum computers, and best‑of‑N rejection sampling mitigates device noise without circuit modification, demonstrating QMF’s practicality for efficient single‑step quantum generative sampling.
The paper introduces a quantum score‑matching framework that extends classical score matching to quantum states, addressing challenges posed by noncommuting density operators. It demonstrates that this method can learn thermal (Gibbs) states without extra state preparation, achieving optimal sample complexity in high‑temperature regimes for local Hamiltonians. Numerical tests and experiments on IBM quantum hardware confirm the approach’s effectiveness and NISQ‑friendly performance, reducing Hamiltonian‑parameter error from 64% to about 10%.
arXiv:2608.31117v1 Announce Type: cross Abstract: Generative models have become central across science and industry, from image and text synthesis to the design of molecules and materials. Quantum ge...
arXiv:2512. 06695v3 Announce Type: replace Abstract: Quantum generative models exploit quantum superposition and entanglement to enhance learning efficiency for both classical and quantum data.
arXiv:2401. 07039v5 Announce Type: replace-cross Abstract: Mixed quantum states are the native description of many physically important quantum systems, making their generation a fundamental task in quantum information processing.
arXiv:2607. 18552v1 Announce Type: cross Abstract: Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout.
arXiv:2607. 07072v1 Announce Type: new Abstract: Quantum diffusion models provide a physics-consistent route to generative learning by formulating noising and denoising directly on quantum states.
Bridge of Ψ's (BOPS) is a generative model that learns to transform quantum circuits into equivalent, optimized versions using Schr"odinger bridges and a custom denoiser architecture. Trained on data engineered to challenge existing optimizers, BOPS achieves a 2.46× reduction in gate count and a 2.45× reduction in depth on 8‑qubit, 64‑depth Clifford+$T$ circuits, outperforming nine baseline optimizers. This work demonstrates the first successful application of generative machine learning to quantum circuit optimization, expanding the quantum compilation stack with learned techniques.
arXiv:2411. 19896v2 Announce Type: replace-cross Abstract: Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous.
arXiv:2508. 19857v3 Announce Type: replace Abstract: Many successful families of generative models leverage a low-dimensional latent distribution that is mapped to a data distribution.
arXiv:2605. 28690v2 Announce Type: replace-cross Abstract: Many applications in quantum simulation, quantum chemistry, and quantum machine learning require not a single quantum state but an ensemble of states characterizing the heterogeneity of a target system.