The advancement of diverse generative deep learning models and their variants has furnished substantial insights for investigating quantum many-body problems. In this work, we design two models based on the foundational architecture of generative adversarial networks (GANs) to investigate the ground-state properties and phase transition characteristics of the two-dimensional quantum rotor model (QRM). Within a semi-supervised learning framework, we incorporate multiple layers of transposed convolutions in the generator, enabling the conditional GAN to more efficiently extract low-dimensional encoded information. Analysis of one-dimensional latent variables associated with ground-state samples for different system sizes allows us to pinpoint the location of the critical point. In addition, we introduce dynamically adaptive weighting factors related to the distributional characteristics into the loss function of the deep convolutional GAN, and utilize upsampling techniques to enlarge the generated sample sizes. Comparisons of the optimization processes for mean magnetization and potential energy density across different magnetization regimes of QRM demonstrate that our model can efficiently generate valid ground-state samples, significantly reducing computational time. Our results highlight the promising potential of generative deep learning in quantum phase transition research, especially in critical point identification and the auxiliary generation of simulation data for quantum many-body models.
The advancement of diverse generative deep learning models and their variants has furnished substantial insights for investigating quantum many-body problems. In this work, we design two models based on the foundational architecture of generative adversarial networks (GANs) to investigate the ground-state properties and phase transition characteristics of the two-dimensional quantum rotor model (QRM). Within a semi-supervised learning framework, we incorporate multiple layers of transposed convolutions in the generator, enabling the conditional GAN to more efficiently extract low-dimensional encoded information. Analysis of one-dimensional latent variables associated with ground-state samples for different system sizes allows us to pinpoint the location of the critical point. In addition, we introduce dynamically adaptive weighting factors related to the distributional characteristics into the loss function of the deep convolutional GAN, and utilize upsampling techniques to enlarge the generated sample sizes. Comparisons of the optimization processes for mean magnetization and potential energy density across different magnetization regimes of QRM demonstrate that our model can efficiently generate valid ground-state samples, significantly reducing computational time. Our results highlight the promising potential of generative deep learning in quantum phase transition research, especially in critical point identification and the auxiliary generation of simulation data for quantum many-body models.
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.
In this work, we study generative adversarial networks (GANs) as a tool to learn the distribution of spin configurations and to generate samples, conditioned on external tuning parameters or other quantities associated with individual configurations. For concreteness, we focus on two examples of conditional variables---the temperature of the system and the energy of the samples. We show that temperature-conditioned models can not only be used to generate samples across thermal phase transitions, but also be employed as unsupervised indicators of transitions. To this end, we introduce a GAN-fidelity measure that captures the model’s susceptibility to external changes of parameters. The proposed energy-conditioned models are integrated with Monte Carlo simulations to perform over-relaxation steps, which break the Markov chain and reduce auto-correlations. We propose ways of efficiently representing the physical states in our network architectures, e.g., by exploiting symmetries, and to minimize the correlations between generated samples. A detailed evaluation, using the two-dimensional XY model as an example, shows that these incorporations bring in considerable improvements over standard machine-learning approaches. We further study the performance of our architectures when no training data is provided near the critical region.
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.
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.
Quantum circuit optimization is a critical challenge in the development and deployment of quantum computers. The complexity of optimizing large quantum circuits grows exponentially with circuit size, making traditional methods computationally prohibitive. This work proposes a novel approach utilizing Generative Adversarial Networks (GANs) to address this problem. The core idea is to train a GAN to learn a compressed, lower-dimensional representation of quantum circuits. This representation can then be used to efficiently guide the optimization process using gradient-based methods. We demonstrate, theoretically, that the GAN's ability to learn complex mappings from high-dimensional space to lower-dimensional space can significantly accelerate the optimization process compared to conventional techniques. The key formulation involves a generator network, G(s), which maps a quantum circuit (s) to a lower-dimensional latent space, and a discriminator network, D(z), which distinguishes between real and generated latent representations. The optimization process hinges on the adversarial training between G and D. We present a framework for this process, outlining the mathematical foundations and potential advantages. This work lays the groundwork for future research exploring GANs as a powerful tool for quantum circuit optimization.
This study presents a temperature-conditioned deep generative approach for efficiently generating spin configurations of the two-dimensional (2D) Ising model. The method employs a convolutional generator network, conditioned on spin states, temperature embeddings, and random noise, to generate thermodynamically accurate spin configurations on a 2D square lattice. Physics-based constraints, derived from magnetization, energy, and nearest-neighbor correlations obtained via Monte Carlo simulations, are integrated as auxiliary loss terms during training to ensure physical consistency. The model accurately captures phase transition behaviors near the critical temperature and supports the scalable generation of synthetic configurations for further analysis. Investigations across lattice sizes L=16, 32, and 64 demonstrate close alignment with Monte Carlo baselines, with generated configurations achieving mean absolute errors as low as 0.0016 for magnetization, 0.0063 for energy, and 0.0016 for correlation in the L=64 case. Phase classification using standard machine learning models further validates the quality of the generated data, with ensemble classifiers yielding F1 scores above 0.99. These findings highlight the proposed framework as a scalable, computationally efficient solution for generating spin configurations in an Ising model.