arXiv:2608. 11884v1 Announce Type: cross Abstract: Quantum generative adversarial networks (QGANs) have attracted increasing attention for image generation using parameterized quantum circuits.
By Xue Yang, Rigui Zhou, ShiZheng Jia, Dax Enshan Koh, Siong Thye Goh, Young-Wook Cho, YaoChong Li, Xuezhi Ma, Hongyu Chen, Xin Wang
Quantum generative adversarial networks (QGANs) have attracted increasing attention for image generation using parameterized quantum circuits. Existing amplitude-based approaches face two key limitations: pixel locations are typically encoded by computational-basis indices or address qubits, causing quantum resources to grow with image resolution; meanwhile, jointly decoding many pixels from normalized quantum states introduces probability competition among pixels and limits precise pixel-wise control.
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.
By Xue Yang, Rigui Zhou, Dax Enshan Koh, Siong Thye Goh, Yitao Tang, ShiZheng Jia, Young-Wook Cho, Hongyu Chen
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...
By Saadet M\"uzehher Eren
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:2606. 26312v1 Announce Type: cross Abstract: Autoencoders transformed classical machine learning by solving the curse of dimensionality, enabling principled weight initialization and learning compact, structured representations.
By Aldo Lamarre, Dominik \v{S}afr\'anek