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

Efficient quantum loading of probability distributions through Feynman propagators

Elie Alhajjar, Jesse T. Geneson, Anupam Prakash, Nicolas Robles

Published Nov 22, 2023• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2311.13702

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

Learning hard quantum distributions with variational autoencoders

Andrea Rocchetto, Edward Grant, Sergii Strelchuk +2 more

Abstract The exact description of many-body quantum systems represents one of the major challenges in modern physics, because it requires an amount of computational resources that scales exponentially with the size of the system. Simulating the evolution of a state, or even storing its description, rapidly becomes intractable for exact classical algorithms. Recently, machine learning techniques, in the form of restricted Boltzmann machines, have been proposed as a way to efficiently represent certain quantum states with applications in state tomography and ground state estimation. Here, we introduce a practically usable deep architecture for representing and sampling from probability distributions of quantum states. Our representation is based on variational auto-encoders, a type of generative model in the form of a neural network. We show that this model is able to learn efficient representations of states that are easy to simulate classically and can compress states that are not classically tractable. Specifically, we consider the learnability of a class of quantum states introduced by Fefferman and Umans. Such states are provably hard to sample for classical computers, but not for quantum ones, under plausible computational complexity assumptions. The good level of compression achieved for hard states suggests these methods can be suitable for characterizing states of the size expected in first generation quantum hardware.

arXiv:1710.00725•npj Quantum Information•Jun 22, 2018•86 citations

Loading Probability Distributions in a Quantum circuit

Kalyan Dasgupta, Binoy Paine

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.

arXiv:2208.13372•Aug 29, 2022•14 citations

Boltzmann machine learning with a variational quantum algorithm

Yuta Shingu, Yuya Seki, Shohei Watabe +5 more

A Boltzmann machine is a powerful tool for modeling probability distributions that govern the training data. A thermal equilibrium state is typically used for the Boltzmann machine learning to obtain a suitable probability distribution. The Boltzmann machine learning consists of calculating the gradient of the loss function given in terms of the thermal average, which is the most time-consuming procedure. Here, we propose a method to implement the Boltzmann machine learning by using noisy intermediate-scale quantum devices. We prepare an initial pure state that contains all possible computational basis states with the same amplitude, and we apply a variational imaginary time simulation. Readout of the state after the evolution in the computational basis approximates the probability distribution of the thermal equilibrium state that is used for the Boltzmann machine learning. We perform the numerical simulations of our scheme and confirm that the Boltzmann machine learning works well. Our scheme leads to a significant step toward an efficient machine learning using quantum hardware.

arXiv:2007.00876•Physical Review A•Sep 16, 2021•31 citations

Hamiltonian-based data loading with shallow quantum circuits

Bojia Duan, Chang‐Yu Hsieh

Data loading with shallow quantum circuits is a highly desirable ingredient for efficient execution of many quantum algorithms before large-scale quantum error corrections with full fault tolerance become readily available. The need for efficient data loading is especially urgent for the study of quantum machine learning. In this work, we propose a protocol that only uses a parameterized shallow quantum circuit without ancilla qubits for loading data into the amplitude of a quantum state with high fidelity. We term this data-loading method Hamiltonian-based data loading (HDL), which comprises two stages. First, the HDL algorithm identifies a Hamiltonian $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}$ whose unique ground state $|\ensuremath{\psi}\ensuremath{\rangle}$ represents the normalized data $\stackrel{P\vec}{x}$ in the form of amplitude encoding. Next, the target state is reconstructed with a parameterized quantum circuit by utilizing methods like variational quantum eigensolver to minimize energy. In this work, we provide three convincing examples to demonstrate the effectiveness of HDL for loading an $N$-dimensional classical data with minimal quantum resources ($O[\mathrm{poly}({log}_{2}N)]$-depth quantum circuit without ancilla qubits). Our approach is particularly useful for quantum hardware without large-scale error corrections, and shall benefit the development of quantum machine learning algorithms.

Physical Review A•Nov 18, 2022•8 citations
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.
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.
Abstract The exact description of many-body quantum systems represents one of the major challenges in modern physics, because it requires an amount of computational resources that scales exponentially with the size of the system. Simulating the evolution of a state, or even storing its description, rapidly becomes intractable for exact classical algorithms. Recently, machine learning techniques, in the form of restricted Boltzmann machines, have been proposed as a way to efficiently represent certain quantum states with applications in state tomography and ground state estimation. Here, we introduce a practically usable deep architecture for representing and sampling from probability distributions of quantum states. Our representation is based on variational auto-encoders, a type of generative model in the form of a neural network. We show that this model is able to learn efficient representations of states that are easy to simulate classically and can compress states that are not classically tractable. Specifically, we consider the learnability of a class of quantum states introduced by Fefferman and Umans. Such states are provably hard to sample for classical computers, but not for quantum ones, under plausible computational complexity assumptions. The good level of compression achieved for hard states suggests these methods can be suitable for characterizing states of the size expected in first generation quantum hardware.
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.
A Boltzmann machine is a powerful tool for modeling probability distributions that govern the training data. A thermal equilibrium state is typically used for the Boltzmann machine learning to obtain a suitable probability distribution. The Boltzmann machine learning consists of calculating the gradient of the loss function given in terms of the thermal average, which is the most time-consuming procedure. Here, we propose a method to implement the Boltzmann machine learning by using noisy intermediate-scale quantum devices. We prepare an initial pure state that contains all possible computational basis states with the same amplitude, and we apply a variational imaginary time simulation. Readout of the state after the evolution in the computational basis approximates the probability distribution of the thermal equilibrium state that is used for the Boltzmann machine learning. We perform the numerical simulations of our scheme and confirm that the Boltzmann machine learning works well. Our scheme leads to a significant step toward an efficient machine learning using quantum hardware.
Data loading with shallow quantum circuits is a highly desirable ingredient for efficient execution of many quantum algorithms before large-scale quantum error corrections with full fault tolerance become readily available. The need for efficient data loading is especially urgent for the study of quantum machine learning. In this work, we propose a protocol that only uses a parameterized shallow quantum circuit without ancilla qubits for loading data into the amplitude of a quantum state with high fidelity. We term this data-loading method Hamiltonian-based data loading (HDL), which comprises two stages. First, the HDL algorithm identifies a Hamiltonian $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}$ whose unique ground state $|\ensuremath{\psi}\ensuremath{\rangle}$ represents the normalized data $\stackrel{P\vec}{x}$ in the form of amplitude encoding. Next, the target state is reconstructed with a parameterized quantum circuit by utilizing methods like variational quantum eigensolver to minimize energy. In this work, we provide three convincing examples to demonstrate the effectiveness of HDL for loading an NNN-dimensional classical data with minimal quantum resources (O[poly(log2N)]O[\mathrm{poly}({log}_{2}N)]O[poly(log2​N)]-depth quantum circuit without ancilla qubits). Our approach is particularly useful for quantum hardware without large-scale error corrections, and shall benefit the development of quantum machine learning algorithms.