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. 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: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 Fidelity Landscape-Guided Prior Calibration for Single-Circuit QGAN Image Generation explores a simpler pixel‑level, end‑to‑end approach to quantum generative adversarial networks (QGANs) that avoids patch‑based decomposition. The authors introduce the Quantum Fidelity Landscape (QFL) as an invariant pairwise‑fidelity structure preserved under shared unitary transformations, and use it to calibrate the quantum prior before adversarial training. Their BasicQGAN framework aligns the prior‑induced QFL with the data‑induced QFL, achieving stable, effective image generation on small‑scale grayscale datasets while requiring fewer qubits and trainable parameters than patch‑based quantum generators.
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:2603.06755v3 Announce Type: replace Abstract: We propose a quantum implicit neural representation (QINR)-based autoencoder (AE) and variational autoencoder (VAE) for image reconstruction and ge...
arXiv:2606. 18970v1 Announce Type: cross Abstract: 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.
arXiv:2606. 02785v1 Announce Type: new Abstract: Large machine learning models benefit substantially from multimodal inputs that provide a complementary view of the same example.
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.
arXiv:2510. 03389v2 Announce Type: replace-cross Abstract: Current quantum computers require algorithms that use limited resources economically.
arXiv:2509. 14026v2 Announce Type: replace-cross Abstract: Variational quantum circuits (VQCs) are central to quantum machine learning, while recent progress in Kolmogorov-Arnold networks (KANs) highlights the power of learnable activation functions.
arXiv:2606. 27561v1 Announce Type: new Abstract: Generative models have achieved remarkable success in data synthesis, though recent advances driven by increasing model scale have introduced challenges in computational cost and efficiency.
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.