arXiv AI By Zidong Cui, Pan Zhang, Ying Tang

Quantum Flow Matching

Read the original on arXiv AI →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Sep 3

Quantum MeanFlow: single-shot generative sampling on NISQ hardware

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.

By Ashish Joshi, Eshaan Mistry, Takahiko Koyama
arXiv Machine Learning
Sep 24

Quantum score matching with applications to learning thermal states

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%.

By Yulong Dong, Jiaqi Leng