We propose Hamiltonian quantum generative adversarial networks (HQuGANs) to learn to generate unknown input quantum states using two competing quantum optimal controls. The game-theoretic framework of the algorithm is inspired by the success of classical generative adversarial networks in learning high-dimensional distributions. The quantum optimal control approach not only makes the algorithm naturally adaptable to the experimental constraints of near-term hardware, but also offers a more natural characterization of overparameterization compared to the circuit model. We numerically demonstrate the capabilities of the proposed framework to learn various highly entangled many-body quantum states, using simple two-body Hamiltonians and under experimentally relevant constraints such as low-bandwidth controls. We analyze the computational cost of implementing HQuGANs on quantum computers and show how the framework can be extended to learn quantum dynamics. Furthermore, we introduce a cost function that circumvents the problem of mode collapse that prevents convergence of HQuGANs and demonstrate how to accelerate the convergence of them when generating a pure state. Published by the American Physical Society 2024
We propose Hamiltonian quantum generative adversarial networks (HQuGANs) to learn to generate unknown input quantum states using two competing quantum optimal controls. The game-theoretic framework of the algorithm is inspired by the success of classical generative adversarial networks in learning high-dimensional distributions. The quantum optimal control approach not only makes the algorithm naturally adaptable to the experimental constraints of near-term hardware, but also offers a more natural characterization of overparameterization compared to the circuit model. We numerically demonstrate the capabilities of the proposed framework to learn various highly entangled many-body quantum states, using simple two-body Hamiltonians and under experimentally relevant constraints such as low-bandwidth controls. We analyze the computational cost of implementing HQuGANs on quantum computers and show how the framework can be extended to learn quantum dynamics. Furthermore, we introduce a cost function that circumvents the problem of mode collapse that prevents convergence of HQuGANs and demonstrate how to accelerate the convergence of them when generating a pure state. Published by the American Physical Society 2024
Generative Adversarial Networks (GANs) have demonstrated remarkable success in generating realistic data across various domains. However, traditional GANs often struggle with mode collapse, difficulty in capturing complex data distributions, and challenges in generating high-dimensional data effectively. This paper proposes Quantum-Inspired Generative Adversarial Networks (QGANs), a novel approach that incorporates principles of quantum mechanics – specifically superposition and interference – into the GAN architecture. QGANs utilize quantum circuits to generate latent vectors in a superposition state, enabling richer sampling and enhanced diversity in the generated data. Interference patterns are then strategically applied to refine the generated output, leading to improved quality and complexity. We argue that this direct application of quantum concepts offers a promising avenue for overcoming the limitations of classical GANs and achieving superior generative performance. This work presents a foundational framework for QGANs, outlining the core mechanisms and potential benefits, and lays the groundwork for future research in this area.
Hybrid Quantum Generative Adversarial Networks (HQ-GANs) have emerged as a promising class of models at the intersection of quantum computing and generative artificial intelligence. Unlike early quantum generative approaches that relied on fully quantum pipelines, hybrid QGANs combine parameterized quantum circuits with classical optimization and discrimination mechanisms, enabling practical training under the constraints of noisy intermediate-scale quantum (NISQ) hardware. This paper presents a comprehensive technical review of hybrid QGAN architectures, with a particular focus on implicit quantum representations and hybrid optimization strategies that enhance expressivity, stability, and scalability. We analyze how recent advances in variational circuit design, data re-encoding, Wasserstein-based objectives, and hybriddepth control have reshaped the feasibility of quantum generative learning. New mathematical formulations are introduced to describe implicit quantum mappings and hybrid adversarial convergence. Comparative analysis highlights performance trends, architectural trade-offs, and unresolved challenges related to noise, barren plateaus, and hardware–software mismatch. The paper concludes by outlining future research directions toward robust, application-ready quantum generative intelligence.
Tremendous progress has been witnessed in artificial intelligence, where neural network backed deep learning systems have been used, with applications in almost every domain. As a representative deep learning framework, Generative Adversarial Network (GAN) has been widely used for generating artificial images, text-to-image or image augmentation across areas of science, arts and video games. However, GANs are computationally expensive, sometimes computationally prohibitive. Furthermore, training GANs may suffer from convergence failure and modal collapse. Aiming at the acceleration of use cases for practical quantum computers, we propose QuGAN, a quantum GAN architecture that provides stable convergence, quantum-states based gradients and significantly reduced parameter sets. The QuGANarchitecture runs both the discriminator and the generator purely on quantum state fidelity and utilizes the swap test on qubits to calculate the values of quantum-based loss functions. Built on quantum layers, QuGAN achieves similar performance with a 94.98% reduction on the parameter set when compared to classical GANs. With the same number of parameters, addition-ally, QuGAN outperforms state-of-the-art quantum based GANsin the literature providing a 48.33% improvement in system performance compared to others attaining less than 0.5% in terms of similarity between generated distributions and original data sets.
Abstract Generative Adversarial Networks (GANs) have revolutionized Deep learning-based generative models are still challenging to train. This is due to issues such as mode collapse, instability, and non-convergence. This article provides a comprehensive analysis of the challenges faced by classical GANs, offering insights into their computational flow and limitations. Additionally, it explores Quantum Generative Adversarial Networks (QuGANs), detailing their unique architecture and the mechanism of quantum information generation. To further advance the field, this work presents an in-depth analysis of a hybridized model combining classical GANs and QuGANs, leveraging the strengths of both paradigms to enhance learning and stability. Furthermore, a novel algorithm for training quantum–classical GANs is proposed, with a detailed complexity analysis to assess its computational efficiency. The integration of quantum principles into classical frameworks offers a promising direction to mitigate existing GANs limitations while unlocking new possibilities for quantum machine learning. The proposed approach aims to bridge the gap between classical and quantum generative models, improving training dynamics and sample quality. The objective of this investigation is to establish a foundation for improving the efficiency and comprehension of hybrid GANs architectures, which will allow the design of more efficient and durable generative models in quantum computing.
Some of the most impressive achievements of contemporary Machine Learning systems comes from the GAN (Generative Adversarial Network) structure. DALLE-2 and GPT- 3, two of the most impressive and recognizable feats of ML in recent years, were both trained using adversarial techniques. The world of Quantum Computing is already well aware of the value of such techniques on near-term Quantum Hardware: QGANs provide a highly efficient method for loading classical data into a quantum state. We investigate the performance of these techniques in an attempt to determine some of the optimal training parameters in a Qiskit-style Parameterized Circuit QGAN framework.
Tremendous progress has been witnessed in artificial intelligence where neural network backed deep learning systems have been used, with applications in almost every domain. As a representative deep learning framework, Generative Adversarial Network (GAN) has been widely used for generating artificial images, text-to-image or image augmentation across areas of science, arts and video games. However, GANs are computationally expensive, sometimes computationally prohibitive. Furthermore, training GANs may suffer from convergence failure and modal collapse. Aiming at the acceleration of use cases for practical quantum computers, we propose QuGAN, a quantum GAN architecture that provides stable convergence, quantum-states based gradients and significantly reduced parameter sets. The QuGAN architecture runs both the discriminator and the generator purely on quantum state fidelity and utilizes the swap test on qubits to calculate the values of quantum-based loss functions. Built on quantum layers, QuGAN achieves similar performance with a 94.98% reduction on the parameter set when compared to classical GANs. With the same number of parameters, additionally, QuGAN outperforms state-of-the-art quantum based GANs in the literature providing a 48.33% improvement in system performance compared to others attaining less than 0.5% in terms of similarity between generated distributions and original data sets. QuGAN code is released at https://github.com/yingmao/Quantum-Generative-Adversarial-Network