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

Adversarial Markov Processes for Quantum Generative Machine Learning and Classical Optimization

Blake Anthony Wilson

Published Jan 1, 2024• 0 citations
Publisher

Abstract

My dissertation focuses on the analysis and development of algorithms for problems involving adversarial Markov processes (AMPs), including applications in hybrid quantum-classical generative machine learning, semiconductor authentication, and optimization.Markov processes are random processes whose state $\z_t \in S$ evolves to a future state $\z_{t + 1} \in S$ by sampling an adversarial distribution $p_\beta(\z_{t+1} \vert \z_t)$ that depends only on the current state $\z_t$ and a control parameter $\beta$ which is determined a priori. AMPs are an aggregated marginalization $q_\beta(\z_f) = \int_{\z_0} \Gamma_\beta(\z_f \vert \z_0)p(\z_0)$ of the Markov process $\Gamma_\beta = \sum_{\z_{f-1}}p_\beta(\z_{f} \vert \z_{f-1})...\sum_{\z_{1}}p_\beta(\z_{1} \vert \z_{0})$ coupled to a prior $p(\z_0)$. What makes the AMP adversarial is that our only control of $\Gamma_\beta$ is through $\beta$ and we are tasked with choosing the optimal $\beta$ under some problem constraints. For example, in the second chapter of my dissertation, we optimally solve for $\beta$ in three package delivery AMPs where a dispatcher must construct a package delivery plan that maximizes the expected reward for a robot delivering packages across multiple epochs.Each package has an associated reward for delivery and a probabilistic risk of failure given by some adversary in the environment. %Our goal is to maximize the expected reward by choosing the optimal package delivery plan, i.e., AMP control parameter $\beta$.We demonstrate how to use the structure of these AMPs to compute the optimal package delivery plan with the largest expected reward across both a finite and infinite number of epochs in $O(K + n\log n)$ time and $O(n)$ time, respectively, where $K$ is the number of epochs and $n$ is the number of packages. However, not all AMP problems are based on choosing the optimal $\beta$. Instead, $\beta$ can be adversarially chosen for us and we want to infer its value. For example, in Chapter 3, we infer the value of $\beta$ for a package authentication problem involving a mixed AMP where a manufacturer and a customer have to authenticate a semiconductor device using a physical unclonable function (PUF) based on the relative positions and radii of nanoparticles embedded on the packaging of a semiconductor device. Because the PUF's state space is intractable to infer $\beta$ explicitly, existing solutions used Hausdorff-inspired heuristics which work well for small perturbations in the nanoparticle positions.However, we show that under more difficult transformations, the Hausdorff heuristics can be reliably spoofed.To counteract this, we leverage a machine learning discriminator called RAPTOR to infer $\beta$ using attention networks.RAPTOR outperforms the Hausdorff, Procrustes, and average Hausdorff distance metrics, achieving a $40.6\%$, $37.3\%$, and $6.4\%$ total accuracy increase, respectively. In both Chapters 2 and 3, the AMPs are considered {\it adversaries} which we overcome using some algorithm.However, in Chapters 4 and 5, we demonstrate new learning techniques that use AMPs as a {\it resource} for generative machine learning. More specifically, the AMP parameter vector $\beta$ acts as an inverse temperature and/or energy function parameter for optimization and sampling using the AMPs.Specifically in Chapter 4, we demonstrate a quantum machine learning framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder (bVAE).Using the D-Wave Advantage hybrid sampler and simulated annealing as samplers, we demonstrate that by repeatedly sampling and retraining a surrogate QUBO (bVAE-QUBO), the samples generated by sampling and decoding the QUBO exhibit figures of merit exceeding those of its training set.Additionally, we demonstrate that the bVAE-QUBO framework is several times faster than previous methods with, at worst, a 1\% loss in quality. Building off of the latent optimization techniques from Chapter 4, in Chapter 5 we use an adversarial quantum autoencoder model (AQAM) to directly sample a Boltzmann distribution over neutral atoms using a quantum-enhanced Markov Chain Monte Carlo algorithm. We define the AMP loss function using an adversarial autoencoder approach and reparameterization trick which uses the AMP as a resource for training. Using 12-atom quantum simulations, we demonstrate that AQAM achieves a lower Renyi divergence with the ideal Boltzmann distribution and a larger spectral gap when compared to classical AMPs, thereby demonstrating a comparative advantage with AQAM over classical machine learning models.

DOI
10.25394/pgs.25686078

Related papers

Quantum Algorithms for Reinforcement Learning with a Generative Model

Daochen Wang, Aarthi Sundaram, Robin Kothari +2 more

Reinforcement learning studies how an agent should interact with an environment to maximize its cumulative reward. A standard way to study this question abstractly is to ask how many samples an agent needs from the environment to learn an optimal policy for a $γ$-discounted Markov decision process (MDP). For such an MDP, we design quantum algorithms that approximate an optimal policy ($π^*$), the optimal value function ($v^*$), and the optimal $Q$-function ($q^*$), assuming the algorithms can access samples from the environment in quantum superposition. This assumption is justified whenever there exists a simulator for the environment; for example, if the environment is a video game or some other program. Our quantum algorithms, inspired by value iteration, achieve quadratic speedups over the best-possible classical sample complexities in the approximation accuracy ($ε$) and two main parameters of the MDP: the effective time horizon ($\frac{1}{1-γ}$) and the size of the action space ($A$). Moreover, we show that our quantum algorithm for computing $q^*$ is optimal by proving a matching quantum lower bound.

arXiv:2112.08451•Dec 15, 2021•20 citations

Quantum Algorithms for Matrix Problems and Machine Learning

Sathyawageeswar Subramanian

This dissertation presents a study of quantum algorithms for problems that can be posed as matrix function tasks. In Chapter 1 we demonstrate a simple unifying framework for implementing of smooth functions of matrices on a quantum computer. This framework captures a variety of problems that can be solved by evaluating properties of some function of a matrix, and we identify speedups over classical algorithms for some problem classes. The analysis combines ideas from the classical theory of function approximation with the quantum algorithmic primitive of implementing linear combinations of unitary operators. In Chapter 2 we continue this study by looking at the role of sparsity of input matrices in constructing efficient quantum algorithms. We show that classically pre-processing an input matrix by spectral sparsification can be profitable for quantum Hamiltonian simulation algorithms, without compromising the simulation error or complexity. Such preprocessing incurs a one time cost linear in the size of the matrix, but can be exploited to exponentially speed up subsequent subroutines such as inversion. In Chapter 3, we give an application of this theory of matrix functions to the problem of estimating the Renyi entropy of an unknown quantum state. We combine matrix function techniques with mixed state quantum computation in the one-clean qubit model, and are able to bound of the expected runtime of our algorithm in terms of the unknown target quantity. In addition to the theme of analysing the complexity of our algorithms, we also identify instances that are of practical relevance, leading us to some problems of machine learning. In Chapter 4 we investigate kernel based learning methods using random features. We work with the QRAM input model suitable for big data, and show how matrix functions and the quantum Fourier transform can be used to devise a quantum algorithm for sampling random features that are optimised for given input data and choice of kernel. We obtain a potential exponential speedup over the best known classical algorithm even without explicit assumptions of sparsity or low rank. Finally in Chapter 5 we consider the technique of beamsearch decoding used in natural language processing. We work in the query model, and show how quantum search with advice can be used to construct a quantum search decoder that can find the optimal parse (which may for instance be a best translation, or text-to-speech transcript) at least quadratically faster than the best known classical algorithms, and obtain super-quadratic speedups in the expected runtime.

•Jul 24, 2020•0 citations

329Chapter 17 Quantum GANs: Revolutionizing data encoding for next-generation quantum applications

Samaya Pillai, Pankaj Pathak, N. A. Natraj +2 more

Quantum generative adversarial networks (QGANs) represent a significant advancement at the intersection of quantum computing and machine learning, offering novel approaches to data encoding and generation for next-generation quantum applications. This chapter provides a comprehensive examination of QGANs, exploring their fundamental architecture, implementation strategies, and potential applications. We detail how QGANs leverage quantum physics principles to potentially outperform classical generative adversarial networks (GANs), particularly in scenarios requiring quantum data processing and quantum-enhanced computations. The study outlines the critical differences between classical GANs and QGANs, focusing on their unique quantum circuit-based generator quantum circuit-based generator and discriminator components. We present an in-depth analysis of quantum data encoding techniques, including state representation, preparation methods, and various encoding scheme encoding scheme s such as amplitude, basis, and phase encoding. The chapter also addresses the challenges in QGAN implementation, discussing scalability issues, noise management, and resource optimization strategies. Special attention is given to training methodologies, including hybrid quantum-classical approaches and specialized loss functions for quantum systems. Furthermore, we explore practical applications across multiple domains, including quantum machine learning, quantum simulation, and quantum cryptography. Real-world case studies in financial modeling financial modeling , healthcare, and cybersecurity demonstrate the practical potential of QGANs. The chapter concludes by identifying future research directions and opportunities for advancing QGAN technology, emphasizing the importance of interdisciplinary collaboration in developing more sophisticated and practical quantum computing solutions.

De Gruyter eBooks•Aug 9, 2025•0 citations

How to enhance quantum generative adversarial learning of noisy information

Paolo Braccia, Filippo Caruso, Leonardo Banchi

Abstract Quantum machine learning is where nowadays machine learning (ML) meets quantum information science. In order to implement this new paradigm for novel quantum technologies, we still need a much deeper understanding of its underlying mechanisms, before proposing new algorithms to feasibly address real problems. In this context, quantum generative adversarial learning is a promising strategy to use quantum devices for quantum estimation or generative ML tasks. However, the convergence behaviours of its training process, which is crucial for its practical implementation on quantum processors, have not been investigated in detail yet. Indeed here we show how different training problems may occur during the optimization process, such as the emergence of limit cycles. The latter may remarkably extend the convergence time in the scenario of mixed quantum states playing a crucial role in the already available noisy intermediate scale quantum devices. Then, we propose new strategies to achieve a faster convergence in any operating regime. Our results pave the way for new experimental demonstrations of such hybrid classical-quantum protocols allowing to evaluate the potential advantages over their classical counterparts.

arXiv:2012.05996•New Journal of Physics•Apr 14, 2021•19 citations

Machine learning framework for quantum sampling of highly constrained, continuous optimization problems

Blake A. Wilson, Zhaxylyk A. Kudyshev, Alexander V. Kildishev +3 more

In recent years, there is growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine. The factorization machine is trained as a low-dimensional, binary surrogate model for the continuous design space and sampled using various QUBO samplers. Using the D-Wave Advantage hybrid sampler and simulated annealing, we demonstrate that by repeated resampling and retraining of the factorization machine, our framework finds designs that exhibit figures of merit exceeding those of its training set. We showcase the framework's performance on two inverse design problems by optimizing (i) thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering. This technique can be further scaled to leverage future developments in quantum optimization to solve advanced inverse design problems for science and engineering applications.

arXiv:2105.02396•Applied Physics Reviews•Dec 1, 2021•41 citations

Quantum-classical generative models for machine learning

Marcello Benedetti

The combination of quantum and classical computational resources towards more effective algorithms is one of the most promising research directions in computer science. In such a hybrid framework, existing quantum computers can be used to their fullest extent and for practical applications. Generative modeling is one of the applications that could benefit the most, either by speeding up the underlying sampling methods or by unlocking more general models. In this work, we design a number of hybrid generative models and validate them on real hardware and datasets. The quantum-assisted Boltzmann machine is trained to generate realistic artificial images on quantum annealers. Several challenges in state-of-the-art annealers shall be overcome before one can assess their actual performance. We attack some of the most pressing challenges such as the sparse qubit-to-qubit connectivity, the unknown effective-temperature, and the noise on the control parameters. In order to handle datasets of realistic size and complexity, we include latent variables and obtain a more general model called the quantum-assisted Helmholtz machine. In the context of gate-based computers, the quantum circuit Born machine is trained to encode a target probability distribution in the wavefunction of a set of qubits. We implement this model on a trapped ion computer using low-depth circuits and native gates. We use the generative modeling performance on the canonical Bars-and-Stripes dataset to design a benchmark for hybrid systems. It is reasonable to expect that quantum data, i.e., datasets of wavefunctions, will become available in the future. We derive a quantum generative adversarial network that works with quantum data. Here, two circuits are optimized in tandem: one tries to generate suitable quantum states, the other tries to distinguish between target and generated states.

•Nov 28, 2019•3 citations
My dissertation focuses on the analysis and development of algorithms for problems involving adversarial Markov processes (AMPs), including applications in hybrid quantum-classical generative machine learning, semiconductor authentication, and optimization.Markov processes are random processes whose state \zt∈S\z_t \in S\zt​∈S evolves to a future state \zt+1∈S\z_{t + 1} \in S\zt+1​∈S by sampling an adversarial distribution pβ(\zt+1∣\zt)p_\beta(\z_{t+1} \vert \z_t)pβ​(\zt+1​∣\zt​) that depends only on the current state \zt\z_t\zt​ and a control parameter β\betaβ which is determined a priori. AMPs are an aggregated marginalization qβ(\zf)=∫\z0Γβ(\zf∣\z0)p(\z0)q_\beta(\z_f) = \int_{\z_0} \Gamma_\beta(\z_f \vert \z_0)p(\z_0)qβ​(\zf​)=∫\z0​​Γβ​(\zf​∣\z0​)p(\z0​) of the Markov process Γβ=∑\zf−1pβ(\zf∣\zf−1)...∑\z1pβ(\z1∣\z0)\Gamma_\beta = \sum_{\z_{f-1}}p_\beta(\z_{f} \vert \z_{f-1})...\sum_{\z_{1}}p_\beta(\z_{1} \vert \z_{0})Γβ​=∑\zf−1​​pβ​(\zf​∣\zf−1​)...∑\z1​​pβ​(\z1​∣\z0​) coupled to a prior p(\z0)p(\z_0)p(\z0​). What makes the AMP adversarial is that our only control of Γβ\Gamma_\betaΓβ​ is through β\betaβ and we are tasked with choosing the optimal β\betaβ under some problem constraints. For example, in the second chapter of my dissertation, we optimally solve for β\betaβ in three package delivery AMPs where a dispatcher must construct a package delivery plan that maximizes the expected reward for a robot delivering packages across multiple epochs.Each package has an associated reward for delivery and a probabilistic risk of failure given by some adversary in the environment. %Our goal is to maximize the expected reward by choosing the optimal package delivery plan, i.e., AMP control parameter β\betaβ.We demonstrate how to use the structure of these AMPs to compute the optimal package delivery plan with the largest expected reward across both a finite and infinite number of epochs in O(K+nlog⁡n)O(K + n\log n)O(K+nlogn) time and O(n)O(n)O(n) time, respectively, where KKK is the number of epochs and nnn is the number of packages. However, not all AMP problems are based on choosing the optimal β\betaβ. Instead, β\betaβ can be adversarially chosen for us and we want to infer its value. For example, in Chapter 3, we infer the value of β\betaβ for a package authentication problem involving a mixed AMP where a manufacturer and a customer have to authenticate a semiconductor device using a physical unclonable function (PUF) based on the relative positions and radii of nanoparticles embedded on the packaging of a semiconductor device. Because the PUF's state space is intractable to infer β\betaβ explicitly, existing solutions used Hausdorff-inspired heuristics which work well for small perturbations in the nanoparticle positions.However, we show that under more difficult transformations, the Hausdorff heuristics can be reliably spoofed.To counteract this, we leverage a machine learning discriminator called RAPTOR to infer β\betaβ using attention networks.RAPTOR outperforms the Hausdorff, Procrustes, and average Hausdorff distance metrics, achieving a 40.6%40.6\%40.6%, 37.3%37.3\%37.3%, and 6.4%6.4\%6.4% total accuracy increase, respectively. In both Chapters 2 and 3, the AMPs are considered {\it adversaries} which we overcome using some algorithm.However, in Chapters 4 and 5, we demonstrate new learning techniques that use AMPs as a {\it resource} for generative machine learning. More specifically, the AMP parameter vector β\betaβ acts as an inverse temperature and/or energy function parameter for optimization and sampling using the AMPs.Specifically in Chapter 4, we demonstrate a quantum machine learning framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder (bVAE).Using the D-Wave Advantage hybrid sampler and simulated annealing as samplers, we demonstrate that by repeatedly sampling and retraining a surrogate QUBO (bVAE-QUBO), the samples generated by sampling and decoding the QUBO exhibit figures of merit exceeding those of its training set.Additionally, we demonstrate that the bVAE-QUBO framework is several times faster than previous methods with, at worst, a 1% loss in quality. Building off of the latent optimization techniques from Chapter 4, in Chapter 5 we use an adversarial quantum autoencoder model (AQAM) to directly sample a Boltzmann distribution over neutral atoms using a quantum-enhanced Markov Chain Monte Carlo algorithm. We define the AMP loss function using an adversarial autoencoder approach and reparameterization trick which uses the AMP as a resource for training. Using 12-atom quantum simulations, we demonstrate that AQAM achieves a lower Renyi divergence with the ideal Boltzmann distribution and a larger spectral gap when compared to classical AMPs, thereby demonstrating a comparative advantage with AQAM over classical machine learning models.
Reinforcement learning studies how an agent should interact with an environment to maximize its cumulative reward. A standard way to study this question abstractly is to ask how many samples an agent needs from the environment to learn an optimal policy for a γγγ-discounted Markov decision process (MDP). For such an MDP, we design quantum algorithms that approximate an optimal policy (π∗π^*π∗), the optimal value function (v∗v^*v∗), and the optimal QQQ-function (q∗q^*q∗), assuming the algorithms can access samples from the environment in quantum superposition. This assumption is justified whenever there exists a simulator for the environment; for example, if the environment is a video game or some other program. Our quantum algorithms, inspired by value iteration, achieve quadratic speedups over the best-possible classical sample complexities in the approximation accuracy (εεε) and two main parameters of the MDP: the effective time horizon (11−γ\frac{1}{1-γ}1−γ1​) and the size of the action space (AAA). Moreover, we show that our quantum algorithm for computing q∗q^*q∗ is optimal by proving a matching quantum lower bound.
This dissertation presents a study of quantum algorithms for problems that can be posed as matrix function tasks. In Chapter 1 we demonstrate a simple unifying framework for implementing of smooth functions of matrices on a quantum computer. This framework captures a variety of problems that can be solved by evaluating properties of some function of a matrix, and we identify speedups over classical algorithms for some problem classes. The analysis combines ideas from the classical theory of function approximation with the quantum algorithmic primitive of implementing linear combinations of unitary operators. In Chapter 2 we continue this study by looking at the role of sparsity of input matrices in constructing efficient quantum algorithms. We show that classically pre-processing an input matrix by spectral sparsification can be profitable for quantum Hamiltonian simulation algorithms, without compromising the simulation error or complexity. Such preprocessing incurs a one time cost linear in the size of the matrix, but can be exploited to exponentially speed up subsequent subroutines such as inversion. In Chapter 3, we give an application of this theory of matrix functions to the problem of estimating the Renyi entropy of an unknown quantum state. We combine matrix function techniques with mixed state quantum computation in the one-clean qubit model, and are able to bound of the expected runtime of our algorithm in terms of the unknown target quantity. In addition to the theme of analysing the complexity of our algorithms, we also identify instances that are of practical relevance, leading us to some problems of machine learning. In Chapter 4 we investigate kernel based learning methods using random features. We work with the QRAM input model suitable for big data, and show how matrix functions and the quantum Fourier transform can be used to devise a quantum algorithm for sampling random features that are optimised for given input data and choice of kernel. We obtain a potential exponential speedup over the best known classical algorithm even without explicit assumptions of sparsity or low rank. Finally in Chapter 5 we consider the technique of beamsearch decoding used in natural language processing. We work in the query model, and show how quantum search with advice can be used to construct a quantum search decoder that can find the optimal parse (which may for instance be a best translation, or text-to-speech transcript) at least quadratically faster than the best known classical algorithms, and obtain super-quadratic speedups in the expected runtime.
Quantum generative adversarial networks (QGANs) represent a significant advancement at the intersection of quantum computing and machine learning, offering novel approaches to data encoding and generation for next-generation quantum applications. This chapter provides a comprehensive examination of QGANs, exploring their fundamental architecture, implementation strategies, and potential applications. We detail how QGANs leverage quantum physics principles to potentially outperform classical generative adversarial networks (GANs), particularly in scenarios requiring quantum data processing and quantum-enhanced computations. The study outlines the critical differences between classical GANs and QGANs, focusing on their unique quantum circuit-based generator quantum circuit-based generator and discriminator components. We present an in-depth analysis of quantum data encoding techniques, including state representation, preparation methods, and various encoding scheme encoding scheme s such as amplitude, basis, and phase encoding. The chapter also addresses the challenges in QGAN implementation, discussing scalability issues, noise management, and resource optimization strategies. Special attention is given to training methodologies, including hybrid quantum-classical approaches and specialized loss functions for quantum systems. Furthermore, we explore practical applications across multiple domains, including quantum machine learning, quantum simulation, and quantum cryptography. Real-world case studies in financial modeling financial modeling , healthcare, and cybersecurity demonstrate the practical potential of QGANs. The chapter concludes by identifying future research directions and opportunities for advancing QGAN technology, emphasizing the importance of interdisciplinary collaboration in developing more sophisticated and practical quantum computing solutions.
Abstract Quantum machine learning is where nowadays machine learning (ML) meets quantum information science. In order to implement this new paradigm for novel quantum technologies, we still need a much deeper understanding of its underlying mechanisms, before proposing new algorithms to feasibly address real problems. In this context, quantum generative adversarial learning is a promising strategy to use quantum devices for quantum estimation or generative ML tasks. However, the convergence behaviours of its training process, which is crucial for its practical implementation on quantum processors, have not been investigated in detail yet. Indeed here we show how different training problems may occur during the optimization process, such as the emergence of limit cycles. The latter may remarkably extend the convergence time in the scenario of mixed quantum states playing a crucial role in the already available noisy intermediate scale quantum devices. Then, we propose new strategies to achieve a faster convergence in any operating regime. Our results pave the way for new experimental demonstrations of such hybrid classical-quantum protocols allowing to evaluate the potential advantages over their classical counterparts.
In recent years, there is growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine. The factorization machine is trained as a low-dimensional, binary surrogate model for the continuous design space and sampled using various QUBO samplers. Using the D-Wave Advantage hybrid sampler and simulated annealing, we demonstrate that by repeated resampling and retraining of the factorization machine, our framework finds designs that exhibit figures of merit exceeding those of its training set. We showcase the framework's performance on two inverse design problems by optimizing (i) thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering. This technique can be further scaled to leverage future developments in quantum optimization to solve advanced inverse design problems for science and engineering applications.
The combination of quantum and classical computational resources towards more effective algorithms is one of the most promising research directions in computer science. In such a hybrid framework, existing quantum computers can be used to their fullest extent and for practical applications. Generative modeling is one of the applications that could benefit the most, either by speeding up the underlying sampling methods or by unlocking more general models. In this work, we design a number of hybrid generative models and validate them on real hardware and datasets. The quantum-assisted Boltzmann machine is trained to generate realistic artificial images on quantum annealers. Several challenges in state-of-the-art annealers shall be overcome before one can assess their actual performance. We attack some of the most pressing challenges such as the sparse qubit-to-qubit connectivity, the unknown effective-temperature, and the noise on the control parameters. In order to handle datasets of realistic size and complexity, we include latent variables and obtain a more general model called the quantum-assisted Helmholtz machine. In the context of gate-based computers, the quantum circuit Born machine is trained to encode a target probability distribution in the wavefunction of a set of qubits. We implement this model on a trapped ion computer using low-depth circuits and native gates. We use the generative modeling performance on the canonical Bars-and-Stripes dataset to design a benchmark for hybrid systems. It is reasonable to expect that quantum data, i.e., datasets of wavefunctions, will become available in the future. We derive a quantum generative adversarial network that works with quantum data. Here, two circuits are optimized in tandem: one tries to generate suitable quantum states, the other tries to distinguish between target and generated states.