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:1904.09602

Efficient Online Quantum Generative Adversarial Learning Algorithms with Applications

Yuxuan Du, Min-Hsiu Hsieh, Dacheng Tao

Published Apr 21, 2019• 16 citations
arXivHTMLPDF

Abstract

The exploration of quantum algorithms that possess quantum advantages is a central topic in quantum computation and quantum information processing. One potential candidate in this area is quantum generative adversarial learning (QuGAL), which conceptually has exponential advantages over classical adversarial networks. However, the corresponding learning algorithm remains obscured. In this paper, we propose the first quantum generative adversarial learning algorithm-- the quantum multiplicative matrix weight algorithm (QMMW)-- which enables the efficient processing of fundamental tasks. The computational complexity of QMMW is polynomially proportional to the number of training rounds and logarithmically proportional to the input size. The core concept of the proposed algorithm combines QuGAL with online learning. We exploit the implementation of QuGAL with parameterized quantum circuits, and numerical experiments for the task of entanglement test for pure state are provided to support our claims.

DOI
10.48550/arxiv.1904.09602

Related papers

Quantum Generative Adversarial Networks for learning and loading random distributions

Christa Zoufal, Aurélien Lucchi, Stefan Woerner

Abstract Quantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known methods require $${\mathcal{O}}\left({2}^{n}\right)$$ O 2 n gates to load an exact representation of a generic data structure into an $$n$$ n -qubit state. This scaling can easily predominate the complexity of a quantum algorithm and, thereby, impair potential quantum advantage. Our work presents a hybrid quantum-classical algorithm for efficient, approximate quantum state loading. More precisely, we use quantum Generative Adversarial Networks (qGANs) to facilitate efficient learning and loading of generic probability distributions - implicitly given by data samples - into quantum states. Through the interplay of a quantum channel, such as a variational quantum circuit, and a classical neural network, the qGAN can learn a representation of the probability distribution underlying the data samples and load it into a quantum state. The loading requires $${\mathcal{O}}\left(poly\left(n\right)\right)$$ O p o l y n gates and can thus enable the use of potentially advantageous quantum algorithms, such as Quantum Amplitude Estimation. We implement the qGAN distribution learning and loading method with Qiskit and test it using a quantum simulation as well as actual quantum processors provided by the IBM Q Experience. Furthermore, we employ quantum simulation to demonstrate the use of the trained quantum channel in a quantum finance application.

arXiv:1904.00043•npj Quantum Information•Nov 22, 2019•618 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

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

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

Generative Adversarial Networks for Quantum State Preparation

Jincheng Zhang

Quantum state preparation is a fundamental and often rate-limiting step in many quantum information processing tasks, including quantum computation, quantum communication, and quantum metrology. Traditional methods for preparing complex quantum states rely on iterative techniques, which can be computationally expensive and time-consuming. This paper proposes a novel approach leveraging Generative Adversarial Networks (GANs) to directly generate complex quantum states from classical inputs. The core idea is to train a GAN to learn the probability distribution of quantum states, effectively learning a mapping between classical data and corresponding quantum states. We formulate the problem as a minimax game between a generator and a discriminator, where the generator aims to produce realistic quantum states, and the discriminator aims to distinguish between generated and real quantum states. The mathematical formulation of this process is detailed below. We hypothesize that this approach will offer significant speedups compared to traditional state preparation methods, particularly for complex states. The success of this approach hinges on the ability of the GAN to accurately capture the intricate correlations inherent in quantum state distributions. This work provides a foundational framework for exploring the application of GANs in quantum state preparation and lays the groundwork for future research in this area.

•Sep 6, 2026•0 citations

Quantum Generative Adversarial Network: A Survey

Tong Li, Shibin Zhang, Jinyue Xia

Generative adversarial network (GAN) is one of the most promising methods for unsupervised learning in recent years. GAN works via adversarial training concept and has shown excellent performance in the fields image synthesis, image super-resolution, video generation, image translation, etc. Compared with classical algorithms, quantum algorithms have their unique advantages in dealing with complex tasks, quantum machine learning (QML) is one of the most promising quantum algorithms with the rapid development of quantum technology. Specifically, Quantum generative adversarial network (QGAN) has shown the potential exponential quantum speedups in terms of performance. Meanwhile, QGAN also exhibits some problems, such as barren plateaus, unstable gradient, model collapse, absent complete scientific evaluation system, etc. How to improve the theory of QGAN and apply it that have attracted some researcher. In this paper, we comprehensively and deeply review recently proposed GAN and QAGN models and their applications, and we discuss the existing problems and future research trends of QGAN.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2020•28 citations
The exploration of quantum algorithms that possess quantum advantages is a central topic in quantum computation and quantum information processing. One potential candidate in this area is quantum generative adversarial learning (QuGAL), which conceptually has exponential advantages over classical adversarial networks. However, the corresponding learning algorithm remains obscured. In this paper, we propose the first quantum generative adversarial learning algorithm-- the quantum multiplicative matrix weight algorithm (QMMW)-- which enables the efficient processing of fundamental tasks. The computational complexity of QMMW is polynomially proportional to the number of training rounds and logarithmically proportional to the input size. The core concept of the proposed algorithm combines QuGAL with online learning. We exploit the implementation of QuGAL with parameterized quantum circuits, and numerical experiments for the task of entanglement test for pure state are provided to support our claims.
Abstract Quantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known methods require O(2n){\mathcal{O}}\left({2}^{n}\right)O(2n) O 2 n gates to load an exact representation of a generic data structure into an nnn n -qubit state. This scaling can easily predominate the complexity of a quantum algorithm and, thereby, impair potential quantum advantage. Our work presents a hybrid quantum-classical algorithm for efficient, approximate quantum state loading. More precisely, we use quantum Generative Adversarial Networks (qGANs) to facilitate efficient learning and loading of generic probability distributions - implicitly given by data samples - into quantum states. Through the interplay of a quantum channel, such as a variational quantum circuit, and a classical neural network, the qGAN can learn a representation of the probability distribution underlying the data samples and load it into a quantum state. The loading requires O(poly(n)){\mathcal{O}}\left(poly\left(n\right)\right)O(poly(n)) O p o l y n gates and can thus enable the use of potentially advantageous quantum algorithms, such as Quantum Amplitude Estimation. We implement the qGAN distribution learning and loading method with Qiskit and test it using a quantum simulation as well as actual quantum processors provided by the IBM Q Experience. Furthermore, we employ quantum simulation to demonstrate the use of the trained quantum channel in a quantum finance application.
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 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.
Quantum state preparation is a fundamental and often rate-limiting step in many quantum information processing tasks, including quantum computation, quantum communication, and quantum metrology. Traditional methods for preparing complex quantum states rely on iterative techniques, which can be computationally expensive and time-consuming. This paper proposes a novel approach leveraging Generative Adversarial Networks (GANs) to directly generate complex quantum states from classical inputs. The core idea is to train a GAN to learn the probability distribution of quantum states, effectively learning a mapping between classical data and corresponding quantum states. We formulate the problem as a minimax game between a generator and a discriminator, where the generator aims to produce realistic quantum states, and the discriminator aims to distinguish between generated and real quantum states. The mathematical formulation of this process is detailed below. We hypothesize that this approach will offer significant speedups compared to traditional state preparation methods, particularly for complex states. The success of this approach hinges on the ability of the GAN to accurately capture the intricate correlations inherent in quantum state distributions. This work provides a foundational framework for exploring the application of GANs in quantum state preparation and lays the groundwork for future research in this area.
Generative adversarial network (GAN) is one of the most promising methods for unsupervised learning in recent years. GAN works via adversarial training concept and has shown excellent performance in the fields image synthesis, image super-resolution, video generation, image translation, etc. Compared with classical algorithms, quantum algorithms have their unique advantages in dealing with complex tasks, quantum machine learning (QML) is one of the most promising quantum algorithms with the rapid development of quantum technology. Specifically, Quantum generative adversarial network (QGAN) has shown the potential exponential quantum speedups in terms of performance. Meanwhile, QGAN also exhibits some problems, such as barren plateaus, unstable gradient, model collapse, absent complete scientific evaluation system, etc. How to improve the theory of QGAN and apply it that have attracted some researcher. In this paper, we comprehensively and deeply review recently proposed GAN and QAGN models and their applications, and we discuss the existing problems and future research trends of QGAN.