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

arXiv:2408.15597

Dissipation-driven quantum generative adversarial networks

He Wang, Jin Wang

Published Aug 28, 2024• 1 citation
arXivHTMLPDF

Abstract

Quantum machine learning holds the promise of harnessing quantum advantage to achieve speedup beyond classical algorithms. Concurrently, research indicates that dissipation can serve as an effective resource in quantum computation. In this paper, we introduce a novel dissipation-driven quantum generative adversarial network (DQGAN) architecture specifically tailored for generating classical data. Our DQGAN comprises two interacting networks: a generative network and a discriminative network, both constructed from qubits. The classical data is encoded into the input qubits of the input layer via strong tailored dissipation processes. This encoding scheme enables us to extract both the generated data and the classification results by measuring the observables of the steady state of the output qubits. The network coupling weight, i.e., the strength of the interaction Hamiltonian between layers, is iteratively updated during the training process. This training procedure closely resembles the training of conventional generative adversarial networks (GANs). By alternately updating the two networks, we foster adversarial learning until the equilibrium point is reached. Our preliminary numerical test on a simplified instance of the task substantiate the feasibility of our DQGAN model.

DOI
10.48550/arxiv.2408.15597

Related papers

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

Dissipative quantum generative adversarial networks

Kerstin Beer, Müller, Gabriel

Noisy intermediate-scale quantum (NISQ) devices build the first generation of quantum computers. Quantum neural networks (QNNs) gained high interest as one of the few suitable quantum algorithms to run on these NISQ devices. Most of the QNNs exploit supervised training algorithms with quantum states in form of pairs to learn their underlying relation. However, only little attention has been given to unsupervised training algorithms despite interesting applications where the quantum data does not occur in pairs. Here we propose an approach to unsupervised learning and reproducing characteristics of any given set of quantum states. We build a generative adversarial model using two dissipative quantum neural networks (DQNNs), leading to the dissipative quantum generative adversarial network (DQGAN). The generator DQNN aims to produce quantum states similar to the training data while the discriminator DQNN aims to distinguish the generator's output from the training data. We find that training both parts in a competitive manner results in a well trained generative DQNN. We see our contribution as a proof of concept for using DQGANs to learn and extend unlabeled training sets.

arXiv:2112.06088•Dec 11, 2021•14 citations

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 Networks (QGANs) for Data Augmentation

Jincheng Zhang

This paper investigates the application of Quantum Generative Adversarial Networks (QGANs) to data augmentation for machine learning. Traditional Generative Adversarial Networks (GANs) rely on classical neural networks, while this research explores leveraging quantum circuits as generators within a QGAN architecture. The core idea is to train a quantum generator to produce synthetic data samples, supplementing existing datasets with novel instances. The discriminator remains a classical neural network, tasked with distinguishing between real and generated data. We present a theoretical framework for this approach, outlining the mathematical formulation and key components. Specifically, we introduce the notation (x, s_1, s_2, ..., s_K) to represent data samples, generator states, and relevant parameters. The objective function for the QGAN is defined as minimizing the Jensen-Shannon divergence between the real and generated data distributions. The effectiveness of this approach is discussed, highlighting potential advantages and challenges. This work contributes to the emerging field of quantum machine learning and offers a novel strategy for improving the performance of machine learning models, particularly in scenarios with limited training data.

•Aug 31, 2026•0 citations

Quantum Computing and Generative AI‐Securing the Future of Information

Deeya Shalya, Rimon Ranjit Das, Gurpreet Kaur

Quantum computing changes the way computational problems can be solved by taking advantage of special qubit features such as superposition and entanglement. Owing to these features, a quantum computer can efficiently search through a large amount of solution space and therefore tackle problems that are otherwise too hard for classical computers. In the field of quantum machine learning (QML), Quantum Generative Adversarial Networks (QGANs) are coming to the forefront as a very productive area. QGANs are based on the experimentally successful classical Generative Adversarial Networks (GANs) and, therefore, utilize an adversarial approach, where a generator competes with a discriminator. The data-synthesizing unit called the generator tries to generate data samples that are statistically similar to the actual data, while the discriminator tries to tell the real data apart from any artificially created data samples. Such layers of adversarial-tuned feedback culminate in the improvement of the generator in making realistic simulated data. Even though a considerable amount of research is already published that substantiates the numerous prospects of quantum computing but still the practical implementation of it seems hypothetical. Even so, QGANs are likely to revolutionize many fields by making it possible to synthesize new and fascinating complex realistic data. This review work aims to serve as a valuable resource for researchers and practitioners interested in understanding the exciting field of QGANs and their potential contributions to the broader landscape of quantum machine learning.

Wiley eBooks•Jan 16, 2026•0 citations

Quantum neural networks

Kerstin Beer

Quantum computing is one of the most exciting research areas of the last decades. At the same time, methods of machine learning have started to dominate science, industry and our everyday life. In this thesis we combine these two essential research topics of the 21st century and introduce dissipative quantum neural networks (DQNNs), which are designed for fully quantum learning tasks, are capable of universal quantum computation and have low memory requirements while training. We start the discussion of this interdisciplinary topic by introducing artificial neural networks, which are a very common tool in classical machine learning. Next, we give an overview on quantum information. Here we focus on quantum algorithms and circuits, which are used to implement quantum neural networks. Moreover, we explain the opportunities and challenges arising with today's quantum computers. The discussion of the architecture and training algorithm of the DQNNs forms the core of this work. These networks are optimised with training data pairs in form of input and desired output states and therefore can be used for characterising unknown or untrusted quantum devices. We not only demonstrate the generalisation behaviour of these quantum neural networks using classical simulations, but also implement them successfully on actual quantum computers. To understand the ultimate limits for such quantum machine learning methods, we discuss the quantum no free lunch theorem, which describes a bound on the probability that a quantum device, which can be modelled as a unitary process and is optimised with quantum examples, gives an incorrect output for a random input. This gives us a tool to review the learning behaviour of quantum neural networks in general and the DQNNs in particular. Moreover we expand the area of applications of DQNNs in two directions. In the first case, we include additional information beyond just the training data pairs: since quantum devices are always structured, the resulting data is always structured as well. We modify the DQNN's training algorithm such that knowledge about the graph-structure of the training data pairs is included in the training process and show that this can lead to better generalisation behaviour. Both the original DQNN and the DQNN including graph structure are trained with data pairs in order to characterise an underlying relation. However, in the second extension of the algorithm we aim to learn characteristics of a set of quantum states in order to extend it to quantum states which have similar properties. Therefore we build a generative adversarial model where two DQNNs, called the generator and discriminator, are trained in a competitive way. Overall, we observe that DQNNs can not only be trained efficiently but also, similar to their classical counterparts, modified to suit different applications.

arXiv:2205.08154•Jan 1, 2022•24 citations
Quantum machine learning holds the promise of harnessing quantum advantage to achieve speedup beyond classical algorithms. Concurrently, research indicates that dissipation can serve as an effective resource in quantum computation. In this paper, we introduce a novel dissipation-driven quantum generative adversarial network (DQGAN) architecture specifically tailored for generating classical data. Our DQGAN comprises two interacting networks: a generative network and a discriminative network, both constructed from qubits. The classical data is encoded into the input qubits of the input layer via strong tailored dissipation processes. This encoding scheme enables us to extract both the generated data and the classification results by measuring the observables of the steady state of the output qubits. The network coupling weight, i.e., the strength of the interaction Hamiltonian between layers, is iteratively updated during the training process. This training procedure closely resembles the training of conventional generative adversarial networks (GANs). By alternately updating the two networks, we foster adversarial learning until the equilibrium point is reached. Our preliminary numerical test on a simplified instance of the task substantiate the feasibility of our DQGAN model.
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.
Noisy intermediate-scale quantum (NISQ) devices build the first generation of quantum computers. Quantum neural networks (QNNs) gained high interest as one of the few suitable quantum algorithms to run on these NISQ devices. Most of the QNNs exploit supervised training algorithms with quantum states in form of pairs to learn their underlying relation. However, only little attention has been given to unsupervised training algorithms despite interesting applications where the quantum data does not occur in pairs. Here we propose an approach to unsupervised learning and reproducing characteristics of any given set of quantum states. We build a generative adversarial model using two dissipative quantum neural networks (DQNNs), leading to the dissipative quantum generative adversarial network (DQGAN). The generator DQNN aims to produce quantum states similar to the training data while the discriminator DQNN aims to distinguish the generator's output from the training data. We find that training both parts in a competitive manner results in a well trained generative DQNN. We see our contribution as a proof of concept for using DQGANs to learn and extend unlabeled training sets.
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.
This paper investigates the application of Quantum Generative Adversarial Networks (QGANs) to data augmentation for machine learning. Traditional Generative Adversarial Networks (GANs) rely on classical neural networks, while this research explores leveraging quantum circuits as generators within a QGAN architecture. The core idea is to train a quantum generator to produce synthetic data samples, supplementing existing datasets with novel instances. The discriminator remains a classical neural network, tasked with distinguishing between real and generated data. We present a theoretical framework for this approach, outlining the mathematical formulation and key components. Specifically, we introduce the notation (x, s_1, s_2, ..., s_K) to represent data samples, generator states, and relevant parameters. The objective function for the QGAN is defined as minimizing the Jensen-Shannon divergence between the real and generated data distributions. The effectiveness of this approach is discussed, highlighting potential advantages and challenges. This work contributes to the emerging field of quantum machine learning and offers a novel strategy for improving the performance of machine learning models, particularly in scenarios with limited training data.
Quantum computing changes the way computational problems can be solved by taking advantage of special qubit features such as superposition and entanglement. Owing to these features, a quantum computer can efficiently search through a large amount of solution space and therefore tackle problems that are otherwise too hard for classical computers. In the field of quantum machine learning (QML), Quantum Generative Adversarial Networks (QGANs) are coming to the forefront as a very productive area. QGANs are based on the experimentally successful classical Generative Adversarial Networks (GANs) and, therefore, utilize an adversarial approach, where a generator competes with a discriminator. The data-synthesizing unit called the generator tries to generate data samples that are statistically similar to the actual data, while the discriminator tries to tell the real data apart from any artificially created data samples. Such layers of adversarial-tuned feedback culminate in the improvement of the generator in making realistic simulated data. Even though a considerable amount of research is already published that substantiates the numerous prospects of quantum computing but still the practical implementation of it seems hypothetical. Even so, QGANs are likely to revolutionize many fields by making it possible to synthesize new and fascinating complex realistic data. This review work aims to serve as a valuable resource for researchers and practitioners interested in understanding the exciting field of QGANs and their potential contributions to the broader landscape of quantum machine learning.
Quantum computing is one of the most exciting research areas of the last decades. At the same time, methods of machine learning have started to dominate science, industry and our everyday life. In this thesis we combine these two essential research topics of the 21st century and introduce dissipative quantum neural networks (DQNNs), which are designed for fully quantum learning tasks, are capable of universal quantum computation and have low memory requirements while training. We start the discussion of this interdisciplinary topic by introducing artificial neural networks, which are a very common tool in classical machine learning. Next, we give an overview on quantum information. Here we focus on quantum algorithms and circuits, which are used to implement quantum neural networks. Moreover, we explain the opportunities and challenges arising with today's quantum computers. The discussion of the architecture and training algorithm of the DQNNs forms the core of this work. These networks are optimised with training data pairs in form of input and desired output states and therefore can be used for characterising unknown or untrusted quantum devices. We not only demonstrate the generalisation behaviour of these quantum neural networks using classical simulations, but also implement them successfully on actual quantum computers. To understand the ultimate limits for such quantum machine learning methods, we discuss the quantum no free lunch theorem, which describes a bound on the probability that a quantum device, which can be modelled as a unitary process and is optimised with quantum examples, gives an incorrect output for a random input. This gives us a tool to review the learning behaviour of quantum neural networks in general and the DQNNs in particular. Moreover we expand the area of applications of DQNNs in two directions. In the first case, we include additional information beyond just the training data pairs: since quantum devices are always structured, the resulting data is always structured as well. We modify the DQNN's training algorithm such that knowledge about the graph-structure of the training data pairs is included in the training process and show that this can lead to better generalisation behaviour. Both the original DQNN and the DQNN including graph structure are trained with data pairs in order to characterise an underlying relation. However, in the second extension of the algorithm we aim to learn characteristics of a set of quantum states in order to extend it to quantum states which have similar properties. Therefore we build a generative adversarial model where two DQNNs, called the generator and discriminator, are trained in a competitive way. Overall, we observe that DQNNs can not only be trained efficiently but also, similar to their classical counterparts, modified to suit different applications.