Quantum latent distributions in deep generative models
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: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.
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.
arXiv:2607. 09113v1 Announce Type: cross Abstract: Data scarcity and class imbalance are persistent challenges in machine learning that degrade model generalization and introduce predictive bias.
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.
arXiv:2607. 29145v1 Announce Type: cross Abstract: Quantum software engineering is an emerging research field focusing on efficiently embedding the quantum programming paradigm into existing software ecosystems.
arXiv:2606. 31536v1 Announce Type: new Abstract: As Quantum Machine Learning (QML) transitions toward practical implementation, the field faces a critical architectural bottleneck that challenges the fundamental assumptions of classical statistical learning theory.
arXiv:2508. 19437v2 Announce Type: replace-cross Abstract: The importance of analyzing nontrivial datasets when testing quantum machine learning (QML) models is becoming increasingly prominent in literature, yet a cohesive framework for understanding dataset characteristics remains elusive.
The paper introduces TabularQGAN, a quantum generative adversarial network designed to synthesize tabular data with both categorical and numerical features. It proposes flexible data encoding and a novel quantum circuit ansatz, and evaluates the model on MIMIC‑III and Adult Census datasets, benchmarking against classical methods such as CTGAN, CopulaGAN, VAE‑GMM, and an LLM‑based approach. Results from noiseless statevector simulations show competitive or leading performance in overall similarity scores and demonstrate strong generalization through custom metrics.
arXiv:2607. 12780v1 Announce Type: cross Abstract: Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates.
arXiv:2608. 11884v1 Announce Type: cross Abstract: Quantum generative adversarial networks (QGANs) have attracted increasing attention for image generation using parameterized quantum circuits.
arXiv:2603. 00233v2 Announce Type: replace-cross Abstract: Quantum generative modeling is a rapidly evolving discipline at the intersection of quantum computing and machine learning.
Medical image classification is often constrained by limited labeled data, motivating generative augmentation; recently, quantum generative models have been proposed for this purpose, frequently reporting accuracy gains. However, such claims are typically based on single training runs, do not match the parameter budgets of the quantum and classical generators, and do not characterize the data regime in which any benefit appears.