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 Conference on Information Fusion (FUSION)

A Quantum Algorithm for the Prediction Step of a Bayesian Recursion

Felix Govaers

Published Jul 8, 2024• 3 citations
Publisher

Abstract

The prediction step is a crucial element of the Bayesian recursion for target tracking and state estimation in general. Discrete representations of the probability density function (pdf) can deal with non-linear models and nonGaussian noise, however, the prediction step is challenging to solve on classical computers. In this paper, a novel concept of quantum simulation to solve the application of a continuous noise motion model to a pdf is presented. The pdf is prepared as the squared amplitudes for the basis states spanned by the number of used qubits. The number of required qubits grows linearly in the number of time steps to simulate in a prediction phase. One step performs a single Brownian motion, which is used to generate the diffusion of the Wiener increments. A drift function can be implemented based on a separate register, which holds the pdf on the velocity information for an adequate discretization. The approach will be visualized in terms of quantum circuits and evaluated based on a quantum simulator.

DOI
10.23919/fusion59988.2024.10706471

Related papers

Quantum Prediction of Transport Dynamics in Discretized State Spaces

Felix Govaers

We propose a gate-based quantum algorithm for the prediction step of Bayesian state estimation based on the Fokker-Planck equation on a discretized position-velocity state space. The probability density is encoded in the amplitudes of a quantum state, enabling a compact representation of high-dimensional distributions. Exploiting the circulant structure of finite-difference operators, the evolution is realized in the spectral domain using quantum Fourier transforms and phase rotations. A key result is that the drift component can be implemented exactly in amplitude space, leading to an accurate reproduction of the classical transport dynamics. In contrast, the diffusion term does not admit a linear representation in amplitude space due to the nonlinear relation between probability density and wave function. To enable a quantum implementation, we introduce a unitary surrogate based on a Wick rotation, transforming diffusion into a dispersive phase evolution. This yields a fully unitary propagation that can be implemented efficiently on a gate-based quantum computer. The proposed method is evaluated numerically for different scenarios and shows strong agreement with the exact solution of the Fokker-Planck equation. The approach demonstrates the potential of quantum computing for Bayesian state estimation, as the representable state space grows exponentially with the number of qubits. This allows the efficient representation and propagation of probability densities that would otherwise require complex tensor decompositions on classical hardware, making the method a promising candidate for high-dimensional filtering problems.

quant-pharXiv:2604.24161•Apr 28, 2026•0 citations

A Quantum Algorithm for the Diffusion Step of Grid-based Filter

Yeongkwon Choe, Chan Gook Park, Jindřich Duník +3 more

We propose a simple quantum algorithm for implementing the diffusion step of grid-based Bayesian filters. The method encodes the advected state density and the process noise density into quantum registers and realizes diffusion using a quantum Fourier transform--based adder. This avoids the explicit convolution required in classical implementations and the repeated coin-flip operations used in quantum random walk approaches. Numerical simulations using a gate-based quantum computing simulator confirm that the proposed approach reproduces the desired probability densities while requiring significantly fewer quantum gates and much shallower circuit depth.

arXiv:2603.00741•Feb 28, 2026•1 citation

Quantum algorithm for solving high-dimensional linear stochastic differential equations via amplitude encoding of the noise term

Koichi Miyamoto

This work studies quantum algorithms to solve high-dimensional stochastic differential equations (SDEs) $\mathrm{d} \mathbf{X}_t = A(t) \mathbf{X}_t \mathrm{d} t + B(t) \mathrm{d} \mathbf{W}_t$. Aiming for a speed-up in the dimension $N$ of $\mathbf{X}_t$, we generate quantum states that encode $\mathbf{X}_t$ in the amplitudes, while most of the existing quantum methods for SDEs employ binary encoding. A key challenge is the amplitude encoding of the noise term, and we address this by utilizing the quantum circuit implementation of a pseudorandom number generator (PRNG). We propose two methods: the Dyson series-based method and the Euler-Maruyama (EM)-based method. In the former, we express the noise term via the Dyson series approximation of the time evolution operator, while in the latter, it is approximated using the EM time discretization. Both methods use the quantum linear systems solver to generate the amplitude-encoding state of $\mathbf{X}_t$, making only ${\rm polylog}(N)$ queries to the PRNG circuit and the block-encodings of $A$ and $B$. Additionally, going beyond state preparation, we present methods to estimate expectations of functions of $\mathbf{X}_t$ using the state.

quant-pharXiv:2604.24133•Apr 28, 2026•1 citation

Quantum-enhanced analysis of discrete stochastic processes

Carsten Blank, Daniel K. Park, Francesco Petruccione

Abstract Discrete stochastic processes (DSP) are instrumental for modeling the dynamics of probabilistic systems and have a wide spectrum of applications in science and engineering. DSPs are usually analyzed via Monte-Carlo methods since the number of realizations increases exponentially with the number of time steps, and importance sampling is often required to reduce the variance. We propose a quantum algorithm for calculating the characteristic function of a DSP, which completely defines its probability distribution, using the number of quantum circuit elements that grows only linearly with the number of time steps. The quantum algorithm reduces the Monte-Carlo sampling to a Bernoulli trial while taking all stochastic trajectories into account. This approach guarantees the optimal variance without the need for importance sampling. The algorithm can be further furnished with the quantum amplitude estimation algorithm to provide quadratic speed-up in sampling. The Fourier approximation can be used to estimate an expectation value of any integrable function of the random variable. Applications in finance and correlated random walks are presented. Proof-of-principle experiments are performed using the IBM quantum cloud platform.

arXiv:2008.06443•npj Quantum Information•Aug 9, 2021•29 citations

A QUANTUM APPROXIMATION ALGORITHM FOR COVARIANCE OF RANDOM VARIABLES

Michal Koren, OR PERETZ

Quantum computing is a promising emerging field in computational science, attracting significant international research interest. Data representation is crucial to the success of machine learning models, and covariance analysis to determine relationships between pairs of random variables is an essential step in exploratory data analysis. Here we introduce a novel quantum algorithm for covariance approximation and its circuit implementation for discrete-value vectors. The algorithm leverages vital components of quantum computing, including amplitude encoding, the Grover diffusion algorithm for amplitude amplification and the quantum Fourier transform. As a core innovation, we utilize two quantum states and their properties of superposition product states to estimate the covariance between input vectors. Evaluating the quantum algorithm’s performance over five discrete-value distributions, we found high levels of agreement between the classical and quantum computations, with maximum average errors averaging 0.153. Furthermore, the analysis revealed additional applications of the Grover diffusion operator to solve problems.

Quantum Journal of Engineering Science and Technology•Sep 30, 2024•0 citations

A quantum spectral method for simulating stochastic processes, with applications to Monte Carlo

Adam Bouland, Aditi Dandapani, Anupam Prakash

Stochastic processes play a fundamental role in physics, mathematics, engineering and finance. One potential application of quantum computation is to better approximate properties of stochastic processes. For example, quantum algorithms for Monte Carlo estimation combine a quantum simulation of a stochastic process with amplitude estimation to improve mean estimation. In this work we study quantum algorithms for simulating stochastic processes which are compatible with Monte Carlo methods. We introduce a new ``analog'' quantum representation of stochastic processes, in which the value of the process at time t is stored in the amplitude of the quantum state, enabling an exponentially efficient encoding of process trajectories. We show that this representation allows for highly efficient quantum algorithms for simulating certain stochastic processes, using spectral properties of these processes combined with the quantum Fourier transform. In particular, we show that we can simulate $T$ timesteps of fractional Brownian motion using a quantum circuit with gate complexity $\text{polylog}(T)$, which coherently prepares the superposition over Brownian paths. We then show this can be combined with quantum mean estimation to create end to end algorithms for estimating certain time averages over processes in time $O(\text{polylog}(T)ε^{-c})$ where $3/2

arXiv:2303.06719•Mar 12, 2023•9 citations
The prediction step is a crucial element of the Bayesian recursion for target tracking and state estimation in general. Discrete representations of the probability density function (pdf) can deal with non-linear models and nonGaussian noise, however, the prediction step is challenging to solve on classical computers. In this paper, a novel concept of quantum simulation to solve the application of a continuous noise motion model to a pdf is presented. The pdf is prepared as the squared amplitudes for the basis states spanned by the number of used qubits. The number of required qubits grows linearly in the number of time steps to simulate in a prediction phase. One step performs a single Brownian motion, which is used to generate the diffusion of the Wiener increments. A drift function can be implemented based on a separate register, which holds the pdf on the velocity information for an adequate discretization. The approach will be visualized in terms of quantum circuits and evaluated based on a quantum simulator.
We propose a gate-based quantum algorithm for the prediction step of Bayesian state estimation based on the Fokker-Planck equation on a discretized position-velocity state space. The probability density is encoded in the amplitudes of a quantum state, enabling a compact representation of high-dimensional distributions. Exploiting the circulant structure of finite-difference operators, the evolution is realized in the spectral domain using quantum Fourier transforms and phase rotations. A key result is that the drift component can be implemented exactly in amplitude space, leading to an accurate reproduction of the classical transport dynamics. In contrast, the diffusion term does not admit a linear representation in amplitude space due to the nonlinear relation between probability density and wave function. To enable a quantum implementation, we introduce a unitary surrogate based on a Wick rotation, transforming diffusion into a dispersive phase evolution. This yields a fully unitary propagation that can be implemented efficiently on a gate-based quantum computer. The proposed method is evaluated numerically for different scenarios and shows strong agreement with the exact solution of the Fokker-Planck equation. The approach demonstrates the potential of quantum computing for Bayesian state estimation, as the representable state space grows exponentially with the number of qubits. This allows the efficient representation and propagation of probability densities that would otherwise require complex tensor decompositions on classical hardware, making the method a promising candidate for high-dimensional filtering problems.
We propose a simple quantum algorithm for implementing the diffusion step of grid-based Bayesian filters. The method encodes the advected state density and the process noise density into quantum registers and realizes diffusion using a quantum Fourier transform--based adder. This avoids the explicit convolution required in classical implementations and the repeated coin-flip operations used in quantum random walk approaches. Numerical simulations using a gate-based quantum computing simulator confirm that the proposed approach reproduces the desired probability densities while requiring significantly fewer quantum gates and much shallower circuit depth.
This work studies quantum algorithms to solve high-dimensional stochastic differential equations (SDEs) dXt=A(t)Xtdt+B(t)dWt\mathrm{d} \mathbf{X}_t = A(t) \mathbf{X}_t \mathrm{d} t + B(t) \mathrm{d} \mathbf{W}_tdXt​=A(t)Xt​dt+B(t)dWt​. Aiming for a speed-up in the dimension NNN of Xt\mathbf{X}_tXt​, we generate quantum states that encode Xt\mathbf{X}_tXt​ in the amplitudes, while most of the existing quantum methods for SDEs employ binary encoding. A key challenge is the amplitude encoding of the noise term, and we address this by utilizing the quantum circuit implementation of a pseudorandom number generator (PRNG). We propose two methods: the Dyson series-based method and the Euler-Maruyama (EM)-based method. In the former, we express the noise term via the Dyson series approximation of the time evolution operator, while in the latter, it is approximated using the EM time discretization. Both methods use the quantum linear systems solver to generate the amplitude-encoding state of Xt\mathbf{X}_tXt​, making only polylog(N){\rm polylog}(N)polylog(N) queries to the PRNG circuit and the block-encodings of AAA and BBB. Additionally, going beyond state preparation, we present methods to estimate expectations of functions of Xt\mathbf{X}_tXt​ using the state.
Abstract Discrete stochastic processes (DSP) are instrumental for modeling the dynamics of probabilistic systems and have a wide spectrum of applications in science and engineering. DSPs are usually analyzed via Monte-Carlo methods since the number of realizations increases exponentially with the number of time steps, and importance sampling is often required to reduce the variance. We propose a quantum algorithm for calculating the characteristic function of a DSP, which completely defines its probability distribution, using the number of quantum circuit elements that grows only linearly with the number of time steps. The quantum algorithm reduces the Monte-Carlo sampling to a Bernoulli trial while taking all stochastic trajectories into account. This approach guarantees the optimal variance without the need for importance sampling. The algorithm can be further furnished with the quantum amplitude estimation algorithm to provide quadratic speed-up in sampling. The Fourier approximation can be used to estimate an expectation value of any integrable function of the random variable. Applications in finance and correlated random walks are presented. Proof-of-principle experiments are performed using the IBM quantum cloud platform.
Quantum computing is a promising emerging field in computational science, attracting significant international research interest. Data representation is crucial to the success of machine learning models, and covariance analysis to determine relationships between pairs of random variables is an essential step in exploratory data analysis. Here we introduce a novel quantum algorithm for covariance approximation and its circuit implementation for discrete-value vectors. The algorithm leverages vital components of quantum computing, including amplitude encoding, the Grover diffusion algorithm for amplitude amplification and the quantum Fourier transform. As a core innovation, we utilize two quantum states and their properties of superposition product states to estimate the covariance between input vectors. Evaluating the quantum algorithm’s performance over five discrete-value distributions, we found high levels of agreement between the classical and quantum computations, with maximum average errors averaging 0.153. Furthermore, the analysis revealed additional applications of the Grover diffusion operator to solve problems.
Stochastic processes play a fundamental role in physics, mathematics, engineering and finance. One potential application of quantum computation is to better approximate properties of stochastic processes. For example, quantum algorithms for Monte Carlo estimation combine a quantum simulation of a stochastic process with amplitude estimation to improve mean estimation. In this work we study quantum algorithms for simulating stochastic processes which are compatible with Monte Carlo methods. We introduce a new ``analog'' quantum representation of stochastic processes, in which the value of the process at time t is stored in the amplitude of the quantum state, enabling an exponentially efficient encoding of process trajectories. We show that this representation allows for highly efficient quantum algorithms for simulating certain stochastic processes, using spectral properties of these processes combined with the quantum Fourier transform. In particular, we show that we can simulate TTT timesteps of fractional Brownian motion using a quantum circuit with gate complexity polylog(T)\text{polylog}(T)polylog(T), which coherently prepares the superposition over Brownian paths. We then show this can be combined with quantum mean estimation to create end to end algorithms for estimating certain time averages over processes in time O(polylog(T)ε−c)O(\text{polylog}(T)ε^{-c})O(polylog(T)ε−c) where $3/2