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

International Joint Conference on Neural Networks (IJCNN)

On a Possible Quantum Variational Autoencoder Circuit

Sayantan Pramanik, M Girish Chandra

Published Jul 18, 2021• 1 citation
Publisher

Abstract

Generative Models have always attracted the attention of Machine Learning research community; they are useful and also generally harder than their discriminative counterparts. In these models, we would be looking into learning the probability distribution of the input and sampling from that to generate new data samples. Since quantum computing and algorithms are inherently random, they can facilitate a natural framework in this situation. But, getting a suitable gate circuit to achieve the requisite quantum state which by repeated preparation and measurement leads to the sought-after data samples is not trivial. In this paper, we propose a quantum circuit which has a flavor of Variational Autoencoder with the usual visible and hidden nodes for input data and latent distribution. The encoder portion comprises of a suitably chosen parameterized phase ansatz and Inverse Quantum Fourier Transform blocks. Depending on whether the measurement is carried out on the hidden nodes or not, the decoder circuit, which is just not the inverse of the encoder in our case, is configured. The Kullback-Leibler Divergence is used train the circuit towards the required input distribution. Numerical results presented demonstrate the correct functionality of the approach.

DOI
10.1109/ijcnn52387.2021.9533801

Related papers

Quantum Generative Modeling using Parameterized Quantum Circuits

Soumyadip Sarkar

Quantum generative models use the intrinsic probabilistic nature of quantum mechanics to learn and reproduce complex probability distributions. In this paper, we present an implementation of a 3-qubit quantum circuit Born machine trained to model a 3-bit Gaussian distribution using a Kullback-Leibler (KL) divergence loss and parameter-shift gradient optimization. The variational quantum circuit consists of layers of parameterized rotations and entangling gates, and is optimized such that the Born rule output distribution closely matches the target distribution. We detail the mathematical formulation of the model distribution, the KL divergence cost function, and the parameter-shift rule for gradient evaluation. Training results on a statevector simulator show that the KL divergence is minimized to near zero, and the final generated distribution aligns quantitatively with the target probabilities. We analyze the convergence behavior and discuss the implications for scalability and quantum advantage. Our results demonstrate the feasibility of small-scale quantum generative learning and provide insight into the training dynamics of quantum circuit models.

arXiv:2303.16955•Mar 25, 2023•0 citations

Adversarial training of quantum Born machine

Haozhen Situ, Zhimin He, Lvzhou Li +1 more

Generative adversarial network (GAN) is an effective machine learning framework to train unsupervised generative models, and has drawn lots of attention in recent years. In the meantime, there are some researches that use parameterized quantum circuits to generate simple patterns. In this paper, we present a quantum version of GAN, where parameterized quantum circuits are trained by an adversarial discriminator, to generate new samples that follows the probability distribution of a given training dataset. Two families of quantum circuits, both composed of simple one-qubit rotation and two-qubit controlled-phase gates, are considered. The parameters are learned through classical gradient descent optimization. The results of a small-scale proof-of-principle numerical experiment demonstrate that quantum circuits can be trained in an adversarial way for generative tasks.

•Jul 3, 2018•4 citations

Protocols for trainable and differentiable quantum generative modeling

Oleksandr Kyriienko, Annie E. Paine, Vincent E. Elfving

We propose an approach for learning probability distributions as differentiable quantum circuits (DQC) that enable efficient quantum generative modeling (QGM) and synthetic data generation. Contrary to existing QGM approaches, we perform training of a DQC-based model, where data is encoded in a latent space with the proposed phase feature map of exponential capacity. This is followed by a trainable quantum circuit, forming the model. We then map the trained model to the bit basis using a fixed unitary transformation, in this case corresponding to a quantum Fourier transform circuit. It allows fast sampling from parametrized distributions using a single-shot readout. Importantly, latent space training provides models that are automatically differentiable, and we show how samples from solutions of stochastic differential equations (SDEs) can be accessed by solving stationary and time-dependent Fokker-Planck equations with a quantum protocol. Our approach opens a route to multidimensional generative modeling with qubit registers explicitly correlated via a (fixed) entangling layer. In this case quantum computers can offer advantage as efficient samplers, which perform complex inverse transform sampling enabled by the fundamental laws of quantum mechanics. On a technical side the advances are multiple, as we introduce the phase feature map, analyze its properties, and develop frequency-taming techniques that include qubitwise training and feature map sparsification. Published by the American Physical Society 2024

arXiv:2202.08253•Physical Review Research•Sep 12, 2024•43 citations

Variational Quantum Generators: Generative Adversarial Quantum Machine Learning for Continuous Distributions

Jonathan Romero, Alán Aspuru‐Guzik

Abstract A hybrid quantum–classical approach to model continuous classical probability distributions using a variational quantum circuit is proposed. The architecture of this quantum generator consists of a quantum circuit that encodes a classical random variable into a quantum state and a parameterized quantum circuit trained to mimic the target distribution. The model allows for easy interfacing with a classical function, such as a neural network, and is trained using an adversarial learning approach. It is shown that the quantum generator is able to learn using either a classical neural network or a variational quantum circuit as the discriminator model. This implementation takes advantage of automatic differentiation tools to perform the optimization of the variational circuits employed. The framework presented here for the design and implementation of the variational quantum generators can serve as a blueprint for designing hybrid quantum–classical models for other machine learning tasks.

arXiv:1901.00848•Advanced Quantum Technologies•Dec 3, 2020•210 citations

Interpretable representation learning of quantum data enabled by probabilistic variational autoencoders

Paulin de Schoulepnikoff, Gorka Muñoz-Gil, Hendrik Poulsen Nautrup +1 more

Interpretable machine learning is rapidly becoming a crucial tool for scientific discovery. Among existing approaches, variational autoencoders (VAEs) have shown promise in extracting the hidden physical features of some input data, with no supervision nor prior knowledge of the system at study. Yet the ability of VAEs to create meaningful, interpretable representations relies on their accurate approximation of the underlying probability distribution of their input. When dealing with quantum data, VAEs must hence account for its intrinsic randomness and complex correlations. While VAEs have been previously applied to quantum data, they have often neglected its probabilistic nature, hindering the extraction of meaningful physical descriptors. Here we demonstrate that two key modifications enable VAEs to learn physically meaningful latent representations: a decoder capable of faithfully reproducing the probability distributions of quantum states and a probabilistic loss tailored to this task. Using benchmark quantum spin models, we identify regimes where standard methods fail while the representations learned by our approach remain meaningful and interpretable. Applied to experimental data from Rydberg atom arrays, the model autonomously uncovers the phase structure without access to prior labels, Hamiltonian details, or knowledge of relevant order parameters, highlighting its potential as an unsupervised and interpretable tool for the study of quantum systems.

arXiv:2506.11982•Physical Review A•Nov 11, 2025•12 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 Models have always attracted the attention of Machine Learning research community; they are useful and also generally harder than their discriminative counterparts. In these models, we would be looking into learning the probability distribution of the input and sampling from that to generate new data samples. Since quantum computing and algorithms are inherently random, they can facilitate a natural framework in this situation. But, getting a suitable gate circuit to achieve the requisite quantum state which by repeated preparation and measurement leads to the sought-after data samples is not trivial. In this paper, we propose a quantum circuit which has a flavor of Variational Autoencoder with the usual visible and hidden nodes for input data and latent distribution. The encoder portion comprises of a suitably chosen parameterized phase ansatz and Inverse Quantum Fourier Transform blocks. Depending on whether the measurement is carried out on the hidden nodes or not, the decoder circuit, which is just not the inverse of the encoder in our case, is configured. The Kullback-Leibler Divergence is used train the circuit towards the required input distribution. Numerical results presented demonstrate the correct functionality of the approach.
Quantum generative models use the intrinsic probabilistic nature of quantum mechanics to learn and reproduce complex probability distributions. In this paper, we present an implementation of a 3-qubit quantum circuit Born machine trained to model a 3-bit Gaussian distribution using a Kullback-Leibler (KL) divergence loss and parameter-shift gradient optimization. The variational quantum circuit consists of layers of parameterized rotations and entangling gates, and is optimized such that the Born rule output distribution closely matches the target distribution. We detail the mathematical formulation of the model distribution, the KL divergence cost function, and the parameter-shift rule for gradient evaluation. Training results on a statevector simulator show that the KL divergence is minimized to near zero, and the final generated distribution aligns quantitatively with the target probabilities. We analyze the convergence behavior and discuss the implications for scalability and quantum advantage. Our results demonstrate the feasibility of small-scale quantum generative learning and provide insight into the training dynamics of quantum circuit models.
Generative adversarial network (GAN) is an effective machine learning framework to train unsupervised generative models, and has drawn lots of attention in recent years. In the meantime, there are some researches that use parameterized quantum circuits to generate simple patterns. In this paper, we present a quantum version of GAN, where parameterized quantum circuits are trained by an adversarial discriminator, to generate new samples that follows the probability distribution of a given training dataset. Two families of quantum circuits, both composed of simple one-qubit rotation and two-qubit controlled-phase gates, are considered. The parameters are learned through classical gradient descent optimization. The results of a small-scale proof-of-principle numerical experiment demonstrate that quantum circuits can be trained in an adversarial way for generative tasks.
We propose an approach for learning probability distributions as differentiable quantum circuits (DQC) that enable efficient quantum generative modeling (QGM) and synthetic data generation. Contrary to existing QGM approaches, we perform training of a DQC-based model, where data is encoded in a latent space with the proposed phase feature map of exponential capacity. This is followed by a trainable quantum circuit, forming the model. We then map the trained model to the bit basis using a fixed unitary transformation, in this case corresponding to a quantum Fourier transform circuit. It allows fast sampling from parametrized distributions using a single-shot readout. Importantly, latent space training provides models that are automatically differentiable, and we show how samples from solutions of stochastic differential equations (SDEs) can be accessed by solving stationary and time-dependent Fokker-Planck equations with a quantum protocol. Our approach opens a route to multidimensional generative modeling with qubit registers explicitly correlated via a (fixed) entangling layer. In this case quantum computers can offer advantage as efficient samplers, which perform complex inverse transform sampling enabled by the fundamental laws of quantum mechanics. On a technical side the advances are multiple, as we introduce the phase feature map, analyze its properties, and develop frequency-taming techniques that include qubitwise training and feature map sparsification. Published by the American Physical Society 2024
Abstract A hybrid quantum–classical approach to model continuous classical probability distributions using a variational quantum circuit is proposed. The architecture of this quantum generator consists of a quantum circuit that encodes a classical random variable into a quantum state and a parameterized quantum circuit trained to mimic the target distribution. The model allows for easy interfacing with a classical function, such as a neural network, and is trained using an adversarial learning approach. It is shown that the quantum generator is able to learn using either a classical neural network or a variational quantum circuit as the discriminator model. This implementation takes advantage of automatic differentiation tools to perform the optimization of the variational circuits employed. The framework presented here for the design and implementation of the variational quantum generators can serve as a blueprint for designing hybrid quantum–classical models for other machine learning tasks.
Interpretable machine learning is rapidly becoming a crucial tool for scientific discovery. Among existing approaches, variational autoencoders (VAEs) have shown promise in extracting the hidden physical features of some input data, with no supervision nor prior knowledge of the system at study. Yet the ability of VAEs to create meaningful, interpretable representations relies on their accurate approximation of the underlying probability distribution of their input. When dealing with quantum data, VAEs must hence account for its intrinsic randomness and complex correlations. While VAEs have been previously applied to quantum data, they have often neglected its probabilistic nature, hindering the extraction of meaningful physical descriptors. Here we demonstrate that two key modifications enable VAEs to learn physically meaningful latent representations: a decoder capable of faithfully reproducing the probability distributions of quantum states and a probabilistic loss tailored to this task. Using benchmark quantum spin models, we identify regimes where standard methods fail while the representations learned by our approach remain meaningful and interpretable. Applied to experimental data from Rydberg atom arrays, the model autonomously uncovers the phase structure without access to prior labels, Hamiltonian details, or knowledge of relevant order parameters, highlighting its potential as an unsupervised and interpretable tool for the study of quantum systems.
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.