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

Loading Probability Distributions in a Quantum circuit

Kalyan Dasgupta, Binoy Paine

Published Aug 29, 2022• 14 citations
arXivHTMLPDF

Abstract

Quantum circuits generating probability distributions has applications in several areas. Areas like finance require quantum circuits that can generate distributions that mimic some given data pattern. Hamiltonian simulations require circuits that can initialize the wave function of a physical quantum system. These wave functions, in several cases, are identical to some very well known probability distributions. In this paper we discuss ways to construct parameterized quantum circuits that can generate both symmetric as well as asymmetric distributions. We follow the trajectory of quantum states as single and two qubit operations get applied to the system, and find out the best possible way to arrive at the desired distribution. The parameters are optimized by a variational solver. We present results from both simulators as well as real IBM quantum hardwares.

DOI
10.48550/arxiv.2208.13372

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

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

Quantum state preparation for bell-shaped probability distributions using deconvolution methods

Kiratholly Nandakumar Madhav Sharma, Camille de Valk, Ankur Raina +1 more

Quantum systems are a natural choice for generating probability distributions due to the phenomena of quantum measurements. The data that we observe in nature from various physical phenomena can be modelled using quantum circuits. To load this data, which is mostly in the form of a probability distribution, we present a hybrid classical-quantum approach. The classical pre-processing step is based on the concept of deconvolution of discrete signals. We use the Jensen-Shannon distance as the cost function to quantify the closeness of the outcome from the classical step and the target distribution. The chosen cost function is symmetric and allows us to perform the deconvolution step using any appropriate optimization algorithm. The output from the deconvolution step is used to construct the quantum circuit required to load the given probability distribution, leading to an overall reduction in circuit depth. The deconvolution step splits a bell-shaped probability mass function into smaller probability mass functions, and this paves the way for parallel data processing in quantum hardware, which consists of a quantum adder circuit as the penultimate step before measurement. We tested the algorithm on IBM Quantum simulators and on the IBMQ Kolkata quantum computer, having a 27-qubit quantum processor. We validated the hybrid Classical-Quantum algorithm by loading two different distributions of bell shape. Specifically, we loaded 7 and 15-element PMF for (i) Standard Normal distribution and (ii) Laplace distribution.

arXiv:2310.05044•Oct 8, 2023•2 citations

Efficient quantum loading of probability distributions through Feynman propagators

Elie Alhajjar, Jesse T. Geneson, Anupam Prakash +1 more

We present quantum algorithms for the loading of probability distributions using Hamiltonian simulation for one dimensional Hamiltonians of the form ${\hat H}= Δ+ V(x) \mathbb{I}$. We consider the potentials $V(x)$ for which the Feynman propagator is known to have an analytically closed form and utilize these Hamiltonians to load probability distributions including the normal, Laplace and Maxwell-Boltzmann into quantum states. We also propose a variational method for probability distribution loading based on constructing a coarse approximation to the distribution in the form of a `ladder state' and then projecting onto the ground state of a Hamiltonian chosen to have the desired probability distribution as ground state. These methods extend the suite of techniques available for the loading of probability distributions, and are more efficient than general purpose data loading methods used in quantum machine learning.

arXiv:2311.13702•Nov 22, 2023•3 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

On a Possible Quantum Variational Autoencoder Circuit

Sayantan Pramanik, M Girish Chandra

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.

International Joint Conference on Neural Networks (IJCNN)•Jul 18, 2021•1 citation
Quantum circuits generating probability distributions has applications in several areas. Areas like finance require quantum circuits that can generate distributions that mimic some given data pattern. Hamiltonian simulations require circuits that can initialize the wave function of a physical quantum system. These wave functions, in several cases, are identical to some very well known probability distributions. In this paper we discuss ways to construct parameterized quantum circuits that can generate both symmetric as well as asymmetric distributions. We follow the trajectory of quantum states as single and two qubit operations get applied to the system, and find out the best possible way to arrive at the desired distribution. The parameters are optimized by a variational solver. We present results from both simulators as well as real IBM quantum hardwares.
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.
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.
Quantum systems are a natural choice for generating probability distributions due to the phenomena of quantum measurements. The data that we observe in nature from various physical phenomena can be modelled using quantum circuits. To load this data, which is mostly in the form of a probability distribution, we present a hybrid classical-quantum approach. The classical pre-processing step is based on the concept of deconvolution of discrete signals. We use the Jensen-Shannon distance as the cost function to quantify the closeness of the outcome from the classical step and the target distribution. The chosen cost function is symmetric and allows us to perform the deconvolution step using any appropriate optimization algorithm. The output from the deconvolution step is used to construct the quantum circuit required to load the given probability distribution, leading to an overall reduction in circuit depth. The deconvolution step splits a bell-shaped probability mass function into smaller probability mass functions, and this paves the way for parallel data processing in quantum hardware, which consists of a quantum adder circuit as the penultimate step before measurement. We tested the algorithm on IBM Quantum simulators and on the IBMQ Kolkata quantum computer, having a 27-qubit quantum processor. We validated the hybrid Classical-Quantum algorithm by loading two different distributions of bell shape. Specifically, we loaded 7 and 15-element PMF for (i) Standard Normal distribution and (ii) Laplace distribution.
We present quantum algorithms for the loading of probability distributions using Hamiltonian simulation for one dimensional Hamiltonians of the form H^=Δ+V(x)I{\hat H}= Δ+ V(x) \mathbb{I}H^=Δ+V(x)I. We consider the potentials V(x)V(x)V(x) for which the Feynman propagator is known to have an analytically closed form and utilize these Hamiltonians to load probability distributions including the normal, Laplace and Maxwell-Boltzmann into quantum states. We also propose a variational method for probability distribution loading based on constructing a coarse approximation to the distribution in the form of a `ladder state' and then projecting onto the ground state of a Hamiltonian chosen to have the desired probability distribution as ground state. These methods extend the suite of techniques available for the loading of probability distributions, and are more efficient than general purpose data loading methods used in quantum machine learning.
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.
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.