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. To address these issues, we reformulate quantum image generation as coordinate-conditioned implicit function learning. Our method takes spatial coordinates and latent variables as inputs, uses a classical embedding network to generate input-dependent circuit parameters, and evaluates a variational quantum circuit at each coordinate. Pixel intensities are directly obtained from the expectation value of a dedicated color qubit, and a complete image is generated by querying all spatial coordinates. This design decouples image resolution from address-qubit requirements and avoids shared probability-normalization constraints across pixels. We further design a specialized variational quantum circuit to provide structural inductive bias for coordinate-conditioned generation. Simulated experiments on two benchmark datasets show that our method outperforms FRQI-based generation and PQWGAN in visual and quantitative quality while using fewer qubits, and also achieves better generation quality than the corresponding classical baseline.
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. To address these issues, we reformulate quantum image generation as coordinate-conditioned implicit function learning. Our method takes spatial coordinates and latent variables as inputs, uses a classical embedding network to generate input-dependent circuit parameters, and evaluates a variational quantum circuit at each coordinate. Pixel intensities are directly obtained from the expectation value of a dedicated color qubit, and a complete image is generated by querying all spatial coordinates. This design decouples image resolution from address-qubit requirements and avoids shared probability-normalization constraints across pixels. We further design a specialized variational quantum circuit to provide structural inductive bias for coordinate-conditioned generation. Simulated experiments on two benchmark datasets show that our method outperforms FRQI-based generation and PQWGAN in visual and quantitative quality while using fewer qubits, and also achieves better generation quality than the corresponding classical baseline.
Quantum generative adversarial networks (QGANs) have attracted increasing attention for their potential to surpass classical generative models by leveraging the expressive power of parameterized quantum circuits (PQCs). However, in the current noisy intermediate-scale quantum era, the implementation of fully quantum algorithms is hindered by hardware limitations, restricting most existing approaches to low-resolution generated image. To address this challenge, we propose a hybrid quantum-classical generative adversarial network for patch-based image generation. Our method employs dual PQC-based generators that decompose images into structured patches, while local and global classical discriminators jointly capture local details and preserve global structural coherence. This design addresses scalability limitations of existing QGANs and mitigates patch-boundary artifacts, thereby enabling high-resolution image generation on hardware with restricted qubit counts. Experimental results validate the effectiveness of the proposed method, demonstrating improvements in image fidelity over existing baselines, and providing insights into the influence of qubit count on generative performance.
Quantum Generative Adversarial Networks (QGANs) offer a promising path for learning data distributions on near-term quantum devices. However, existing QGANs for image synthesis avoid direct full-image generation, relying on classical post-processing or patch-based methods. These approaches dilute the quantum generator's role and struggle to capture global image semantics. To address this, we propose ReQGAN, an end-to-end framework that synthesizes an entire N=2^D-pixel image using a single D-qubit quantum circuit. ReQGAN overcomes two fundamental bottlenecks hindering direct pixel generation: (1) the rigid classical-to-quantum noise interface and (2) the output mismatch between normalized quantum statistics and the desired pixel-intensity space. We introduce a learnable Neural Noise Encoder for adaptive state preparation and a differentiable Intensity Calibration module to map measurements to a stable, visually meaningful pixel domain. Experiments on MNIST and Fashion-MNIST demonstrate that ReQGAN achieves stable training and effective image synthesis under stringent qubit budgets, with ablation studies verifying the contribution of each component.
Quantum Generative Adversarial Networks (QGANs) have emerged as representative generative models in the Noisy Intermediate-Scale Quantum (NISQ) era and have attracted increasing attention in quantum machine learning. However, most existing QGAN methods rely on patch-based decomposition strategies, which weaken the global consistency of generated images and increase quantum resource overhead. In this work, we investigate a simpler approach: pixel-level, end-to-end image generation using a single-quantum-circuit QGAN. By analyzing the structural matching relationship between the quantum prior and the target data distribution in Hilbert space, we provide a new theoretical perspective for understanding the training behavior of naive end-to-end QGANs. Specifically, we introduce the Quantum Fidelity Landscape (QFL), defined as the pairwise-fidelity structure induced by an ensemble of quantum states and preserved under shared unitary transformations of the quantum generation process. We show that, under a fixed Lipschitz readout, this invariant imposes a one-sided bound on decoded sample separation, motivating calibration of the prior-induced QFL before adversarial training. To validate this theoretical insight, we propose BasicQGAN, a QGAN framework incorporating quantum prior calibration. Before adversarial optimization, BasicQGAN aligns the prior-induced QFL with the data-induced QFL. Experimental results on small-scale grayscale image datasets show that BasicQGAN achieves stable and effective end-to-end pixel-level image generation while requiring fewer qubits and trainable parameters than representative patch-based quantum generators. Furthermore, experiments with different initial quantum-state ensembles show that QFL-calibrated ensembles achieve better generative performance.
Abstract Integration of quantum computing in generative machine learning models has the potential to offer benefits such as training speed-up and superior feature extraction. However, the existing quantum generative adversarial networks (QGANs) fail to generate high-quality images due to their patch-based, pixel-wise learning approaches. These methods capture only local details, ignoring the global structure and semantic information of images. In this work, we address these challenges by proposing a quantum image generative learning (QIGL) approach for high-quality medical image generation. Our proposed quantum generator leverages variational quantum circuit approach addressing scalability issues by extracting principal components from the images instead of dividing them into patches. Additionally, we integrate the Wasserstein distance within the QIGL framework to generate a diverse set of medical samples. Through a systematic set of simulations on x-ray images from knee osteoarthritis and medical MNIST datasets, our model demonstrates superior performance, achieving the lowest Fréchet inception distance scores compared to its classical counterpart and advanced QGAN models reported in the literature.
Quantum machine learning (QML) has attracted increasing attention due to its excellent performance on clas-sification and identification tasks. In quantum machine learning methods, quantum generative adversarial networks (QGANs) are an extension of classical generative adversarial networks in the field of quantum computing. However, current quan-tum generation techniques are limited by quantum computing resources, these techniques are only validated on small-scale datasets, and the images generated by QGANs are of lower quality. To improve the image quality generated by QGANs, we introduce a new method to construct latent spaces based on quantum principal component analysis, to ensure high-quality data output of QGANs. In addition, we employ a parameterized quantum circuit instead of a sub module of quantum principal component analysis (Quantum Phase Estimation) to reduce the circuit depths and the number of gates. Experimental results indicate that our new method, which utilizes the new latent space as the input for QGANs, outperforms the original QGAN in terms of performance metrics Frechet Inception Distance and Cosine similarity. Specifically, our method achieves a 20 % lower Frechet Inception Distance score and 9 % higher cosine similarity compared to the original QGAN.
Quantum Generative Adversarial Networks (QGANs), as a rising paradigm in Quantum Machine Learning, have shown promising potential in image generation and processing. However, their output quality remains suboptimal, and existing research is largely limited to small-scale, proof-of-concept studies. In this work, we propose a hybrid quantum-classical GAN architecture, where the generator integrates parameterized quantum circuits (PQCs) and classical neural networks. This integration significantly enhances the visual quality of generated images. Our model leverages the complementary strengths of quantum and classical components and outperforms existing methods (Tsang et al. in IEEE Trans. Quantum Eng. 4:1–19, 2023 ; Gulrajani et al. in Proceedings of the 31st international conference on neural information processing systems. NIPS’17, Red Hook, pp. 5769–5779, 2017 ), particularly in terms of image fidelity. Experiments conducted on the MNIST family of datasets show that our hybrid approach achieves a 20.26% average reduction in Fréchet Inception Distance. Furthermore, it improves the Structural Similarity Index Measure, Cosine Similarity, and Peak Signal-to-Noise Ratio by 26.04%, 2.22%, and 7.62%, respectively. These results highlight the effectiveness of combining quantum computing with machine learning, and underscore the potential of hybrid quantum-classical models in advancing generative tasks.