Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Acta Physica Sinica

Quantum generative models for data generation

Tai‐Ping Sun, Yu-Chun Wu, Guo‐Ping Guo

Published Jan 1, 2021• 1 citation
Publisher

Abstract

In recent years, many generation-based machine learning algorithms such as generative adversarial networks, Boltzmann machine, auto-encoder, etc. are widely used in data generation and probability distribution simulation. On the other hand, the combined algorithms of quantum computation and classical machine learning algorithms are proposed in various styles. Especially, there exist many relevant researches about quantum generative models, which are regarded as the branch of quantum machine learning. Quantum generative models are hybrid quantum-classical algorithms, in which parameterized quantum circuits are introduced to obtain the cost function of the task as well as its gradient, and then classical optimization algorithms are used to find the optima. Compared with its classical counterpart, quantum generative models map the data stream to high-dimensional Hilbert space with parameterized quantum circuits. In the mapping space, data features are easier to learn, which can surpass classical generative models in some tasks. Besides, quantum generative models are potential to realize the quantum advantage in noisy intermediate-scale quantum devices.

DOI
10.7498/aps.70.20210930

Related papers

Quantum generative adversarial network for generating discrete data

Haozhen Situ, Zhimin He, Lvzhou Li +1 more

Quantum machine learning has recently attracted much attention from the community of quantum computing. In this paper, we explore the ability of generative adversarial networks (GANs) based on quantum computing. More specifically, we propose a quantum GAN for generating classical discrete distribution, which has a classical-quantum hybrid architecture and is composed of a parameterized quantum circuit as the generator and a classical neural network as the discriminator. The parameterized quantum circuit only consists of simple one-qubit rotation gates and two-qubit controlled-phase gates that are available in current quantum devices. Our scheme has the following characteristics and potential advantages: (i) It is intrinsically capable of generating discrete data (e.g., text data), while classical GANs are clumsy for this task due to the vanishing gradient problem. (ii) Our scheme avoids the input/output bottlenecks embarrassing most of the existing quantum learning algorithms that either require to encode the classical input data into quantum states, or output a quantum state corresponding to the solution instead of giving the solution itself, which inevitably compromises the speedup of the quantum algorithm. (iii) The probability distribution implicitly given by data samples can be loaded into a quantum state, which may be useful for some further applications.

•Jul 3, 2018•17 citations

Quantum generative adversarial network for discrete data

Haozhen Situ, Zhimin He, Yuyi Wang +2 more

Quantum machine learning has recently attracted much attention from the community of quantum computing. In this paper, we explore the ability of generative adversarial networks (GANs) based on quantum computing. More specifically, we propose a quantum GAN for generating classical discrete distribution, which has a classical-quantum hybrid architecture and is composed of a parameterized quantum circuit as the generator and a classical neural network as the discriminator. The parameterized quantum circuit only consists of simple one-qubit rotation gates and two-qubit controlled-phase gates that are available in current quantum devices. Our scheme has the following characteristics and potential advantages: (i) It is intrinsically capable of generating discrete data (e.g., text data), while classical GANs are clumsy for this task due to the vanishing gradient problem. (ii) Our scheme avoids the input/output bottlenecks embarrassing most of the existing quantum learning algorithms that either require to encode the classical input data into quantum states, or output a quantum state corresponding to the solution instead of giving the solution itself, which inevitably compromises the speedup of the quantum algorithm. (iii) The probability distribution implicitly given by data samples can be loaded into a quantum state, which may be useful for some further applications.

•Jul 3, 2018•2 citations

Generative Quantum Machine Learning

Christa Zoufal

The goal of generative machine learning is to model the probability distribution underlying a given data set. This probability distribution helps to characterize the generation process of the data samples. While classical generative machine learning is solely based on classical resources, generative quantum machine learning can also employ quantum resources - such as parameterized quantum channels and quantum operators - to learn and sample from the probability model of interest. Applications of generative (quantum) models are multifaceted. The trained model can generate new samples that are compatible with the given data and extend the data set. Additionally, learning a model for the generation process of a data set may provide interesting information about the corresponding properties. With the help of quantum resources, the respective generative models have access to functions that are difficult to evaluate with a classical computer and may improve the performance or lead to new insights. Furthermore, generative quantum machine learning can be applied to efficient, approximate loading of classical data into a quantum state which may help to avoid - potentially exponentially - expensive, exact quantum data loading. The aim of this doctoral thesis is to develop new generative quantum machine learning algorithms, demonstrate their feasibility, and analyze their performance. Additionally, we outline their potential application to efficient, approximate quantum data loading. More specifically, we introduce a quantum generative adversarial network and a quantum Boltzmann machine implementation, both of which can be realized with parameterized quantum circuits. These algorithms are compatible with first-generation quantum hardware and, thus, enable us to study proof of concept implementations not only with numerical quantum simulations but also real quantum hardware available today.

arXiv:2111.12738•Jan 1, 2021•32 citations

LatentQGAN: A Hybrid QGAN with Classical Convolutional Autoencoder

Alexis Vieloszynski, Soumaya Cherkaoui, Ola Suleiman Ahmad +4 more

Quantum machine learning consists in taking advantage of quantum computations to generate classical data. A potential application of quantum machine learning is to harness the power of quantum computers for generating classical data, a process essential to a multitude of applications such as enriching training datasets, anomaly detection, and risk management in finance. Given the success of Generative Adversarial Networks in classical image generation, the development of its quantum versions has been actively conducted. However, existing implementations on quantum computers often face significant challenges, such as scalability and training convergence issues. To address these issues, we propose LatentQGAN, a novel quantum model that uses a hybrid quantum-classical GAN coupled with an auto-encoder. Although it was initially designed for image generation, the LatentQGAN approach holds potential for broader application across various practical data generation tasks. Experimental outcomes on both classical simulators and noisy intermediate scale quantum computers have demonstrated significant performance enhancements over existing quantum methods, alongside a significant reduction in quantum resources overhead.

arXiv:2409.14622•IEEE World Forum on Internet of Things (WF-IoT)•Nov 10, 2024•13 citations

Recent Advances for Quantum Neural Networks in Generative Learning

Jinkai Tian, Xiaoyu Sun, Yuxuan Du +11 more

Quantum computers are next-generation devices that hold promise to perform calculations beyond the reach of classical computers. A leading method towards achieving this goal is through quantum machine learning, especially quantum generative learning. Due to the intrinsic probabilistic nature of quantum mechanics, it is reasonable to postulate that quantum generative learning models (QGLMs) may surpass their classical counterparts. As such, QGLMs are receiving growing attention from the quantum physics and computer science communities, where various QGLMs that can be efficiently implemented on near-term quantum machines with potential computational advantages are proposed. In this paper, we review the current progress of QGLMs from the perspective of machine learning. Particularly, we interpret these QGLMs, covering quantum circuit Born machines, quantum generative adversarial networks, quantum Boltzmann machines, and quantum variational autoencoders, as the quantum extension of classical generative learning models. In this context, we explore their intrinsic relations and their fundamental differences. We further summarize the potential applications of QGLMs in both conventional machine learning tasks and quantum physics. Last, we discuss the challenges and further research directions for QGLMs.

arXiv:2206.03066•IEEE Transactions on Pattern Analysis and Machine Intelligence•May 1, 2023•148 citations

Quantum Generative Models

Hamid D. Ismail

This chapter develops quantum generative models as a distinct paradigm within quantum machine learning (QML), emphasizing distribution learning and sampling rather than prediction. It begins by showing how quantum states naturally define probability distributions through the Born rule, thereby making sampling an intrinsic physical process rather than an auxiliary computational step. On this foundation, this chapter presents three principal frameworks: Quantum circuit Born machines (QCBMs), quantum generative adversarial networks (QGANs), and quantum Boltzmann machines (QBMs). QCBMs are introduced as the most direct and conceptually transparent generative models based on parameterized quantum circuits; QGANs extend adversarial learning into the quantum domain through generator–discriminator competition; and QBMs connect generative modeling to quantum statistical mechanics through Gibbs states and quantum Hamiltonians. This chapter compares these models in terms of expressivity, training stability, and hardware feasibility, highlighting the recurring tension between representational richness and practical trainability. It also examines key application areas, including synthetic data generation, scientific distribution learning, quantum simulation, and hybrid classical-quantum pipelines, while emphasizing major open challenges such as noise, sampling overhead, limited hardware scalability, and the absence of clearly demonstrated quantum advantage. Taken together, this chapter establishes generative modeling as a central pillar of QML.

CRC Press eBooks•Nov 4, 2026•0 citations
In recent years, many generation-based machine learning algorithms such as generative adversarial networks, Boltzmann machine, auto-encoder, etc. are widely used in data generation and probability distribution simulation. On the other hand, the combined algorithms of quantum computation and classical machine learning algorithms are proposed in various styles. Especially, there exist many relevant researches about quantum generative models, which are regarded as the branch of quantum machine learning. Quantum generative models are hybrid quantum-classical algorithms, in which parameterized quantum circuits are introduced to obtain the cost function of the task as well as its gradient, and then classical optimization algorithms are used to find the optima. Compared with its classical counterpart, quantum generative models map the data stream to high-dimensional Hilbert space with parameterized quantum circuits. In the mapping space, data features are easier to learn, which can surpass classical generative models in some tasks. Besides, quantum generative models are potential to realize the quantum advantage in noisy intermediate-scale quantum devices.
Quantum machine learning has recently attracted much attention from the community of quantum computing. In this paper, we explore the ability of generative adversarial networks (GANs) based on quantum computing. More specifically, we propose a quantum GAN for generating classical discrete distribution, which has a classical-quantum hybrid architecture and is composed of a parameterized quantum circuit as the generator and a classical neural network as the discriminator. The parameterized quantum circuit only consists of simple one-qubit rotation gates and two-qubit controlled-phase gates that are available in current quantum devices. Our scheme has the following characteristics and potential advantages: (i) It is intrinsically capable of generating discrete data (e.g., text data), while classical GANs are clumsy for this task due to the vanishing gradient problem. (ii) Our scheme avoids the input/output bottlenecks embarrassing most of the existing quantum learning algorithms that either require to encode the classical input data into quantum states, or output a quantum state corresponding to the solution instead of giving the solution itself, which inevitably compromises the speedup of the quantum algorithm. (iii) The probability distribution implicitly given by data samples can be loaded into a quantum state, which may be useful for some further applications.
Quantum machine learning has recently attracted much attention from the community of quantum computing. In this paper, we explore the ability of generative adversarial networks (GANs) based on quantum computing. More specifically, we propose a quantum GAN for generating classical discrete distribution, which has a classical-quantum hybrid architecture and is composed of a parameterized quantum circuit as the generator and a classical neural network as the discriminator. The parameterized quantum circuit only consists of simple one-qubit rotation gates and two-qubit controlled-phase gates that are available in current quantum devices. Our scheme has the following characteristics and potential advantages: (i) It is intrinsically capable of generating discrete data (e.g., text data), while classical GANs are clumsy for this task due to the vanishing gradient problem. (ii) Our scheme avoids the input/output bottlenecks embarrassing most of the existing quantum learning algorithms that either require to encode the classical input data into quantum states, or output a quantum state corresponding to the solution instead of giving the solution itself, which inevitably compromises the speedup of the quantum algorithm. (iii) The probability distribution implicitly given by data samples can be loaded into a quantum state, which may be useful for some further applications.
The goal of generative machine learning is to model the probability distribution underlying a given data set. This probability distribution helps to characterize the generation process of the data samples. While classical generative machine learning is solely based on classical resources, generative quantum machine learning can also employ quantum resources - such as parameterized quantum channels and quantum operators - to learn and sample from the probability model of interest. Applications of generative (quantum) models are multifaceted. The trained model can generate new samples that are compatible with the given data and extend the data set. Additionally, learning a model for the generation process of a data set may provide interesting information about the corresponding properties. With the help of quantum resources, the respective generative models have access to functions that are difficult to evaluate with a classical computer and may improve the performance or lead to new insights. Furthermore, generative quantum machine learning can be applied to efficient, approximate loading of classical data into a quantum state which may help to avoid - potentially exponentially - expensive, exact quantum data loading. The aim of this doctoral thesis is to develop new generative quantum machine learning algorithms, demonstrate their feasibility, and analyze their performance. Additionally, we outline their potential application to efficient, approximate quantum data loading. More specifically, we introduce a quantum generative adversarial network and a quantum Boltzmann machine implementation, both of which can be realized with parameterized quantum circuits. These algorithms are compatible with first-generation quantum hardware and, thus, enable us to study proof of concept implementations not only with numerical quantum simulations but also real quantum hardware available today.
Quantum machine learning consists in taking advantage of quantum computations to generate classical data. A potential application of quantum machine learning is to harness the power of quantum computers for generating classical data, a process essential to a multitude of applications such as enriching training datasets, anomaly detection, and risk management in finance. Given the success of Generative Adversarial Networks in classical image generation, the development of its quantum versions has been actively conducted. However, existing implementations on quantum computers often face significant challenges, such as scalability and training convergence issues. To address these issues, we propose LatentQGAN, a novel quantum model that uses a hybrid quantum-classical GAN coupled with an auto-encoder. Although it was initially designed for image generation, the LatentQGAN approach holds potential for broader application across various practical data generation tasks. Experimental outcomes on both classical simulators and noisy intermediate scale quantum computers have demonstrated significant performance enhancements over existing quantum methods, alongside a significant reduction in quantum resources overhead.
Quantum computers are next-generation devices that hold promise to perform calculations beyond the reach of classical computers. A leading method towards achieving this goal is through quantum machine learning, especially quantum generative learning. Due to the intrinsic probabilistic nature of quantum mechanics, it is reasonable to postulate that quantum generative learning models (QGLMs) may surpass their classical counterparts. As such, QGLMs are receiving growing attention from the quantum physics and computer science communities, where various QGLMs that can be efficiently implemented on near-term quantum machines with potential computational advantages are proposed. In this paper, we review the current progress of QGLMs from the perspective of machine learning. Particularly, we interpret these QGLMs, covering quantum circuit Born machines, quantum generative adversarial networks, quantum Boltzmann machines, and quantum variational autoencoders, as the quantum extension of classical generative learning models. In this context, we explore their intrinsic relations and their fundamental differences. We further summarize the potential applications of QGLMs in both conventional machine learning tasks and quantum physics. Last, we discuss the challenges and further research directions for QGLMs.
This chapter develops quantum generative models as a distinct paradigm within quantum machine learning (QML), emphasizing distribution learning and sampling rather than prediction. It begins by showing how quantum states naturally define probability distributions through the Born rule, thereby making sampling an intrinsic physical process rather than an auxiliary computational step. On this foundation, this chapter presents three principal frameworks: Quantum circuit Born machines (QCBMs), quantum generative adversarial networks (QGANs), and quantum Boltzmann machines (QBMs). QCBMs are introduced as the most direct and conceptually transparent generative models based on parameterized quantum circuits; QGANs extend adversarial learning into the quantum domain through generator–discriminator competition; and QBMs connect generative modeling to quantum statistical mechanics through Gibbs states and quantum Hamiltonians. This chapter compares these models in terms of expressivity, training stability, and hardware feasibility, highlighting the recurring tension between representational richness and practical trainability. It also examines key application areas, including synthetic data generation, scientific distribution learning, quantum simulation, and hybrid classical-quantum pipelines, while emphasizing major open challenges such as noise, sampling overhead, limited hardware scalability, and the absence of clearly demonstrated quantum advantage. Taken together, this chapter establishes generative modeling as a central pillar of QML.