Quantum-enhanced analysis of discrete stochastic processes

• URL: http://arxiv.org/abs/2008.06443v1
• Date: Fri, 14 Aug 2020 16:07:35 GMT
• Title: Quantum-enhanced analysis of discrete stochastic processes
• Authors: Carsten Blank and Daniel K. Park and Francesco Petruccione
• Abstract summary: We propose a quantum algorithm for calculating the characteristic function of a Discrete processes (DSP) It completely defines its probability distribution, using the number of quantum circuit elements that grows only linearly with the number of time steps. The algorithm takes all trajectories into account and hence eliminates the need of importance sampling.
• Score: 0.8057006406834467
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Discrete stochastic processes (DSP) are instrumental for modelling 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 takes all stochastic trajectories into account and hence eliminates the need of importance sampling. The algorithm can be further furnished with the quantum amplitude estimation algorithm to provide quadratic speed-up in sampling. Both of these strategies improve variance beyond classical capabilities. The quantum method can be combined with Fourier approximation to estimate an expectation value of any integrable function of the random variable. Applications in finance and correlated random walks are presented to exemplify the usefulness of our results. Proof-of-principle experiments are performed using the IBM quantum cloud platform.

Related papers

• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quadratic Advantage with Quantum Randomized Smoothing Applied to Time-Series Analysis [0.0]
  We present an analysis of quantum randomized smoothing, how data encoding and perturbation modeling approaches can be matched to achieve meaningful robustness certificates. We show how constrained $k$-distant Hamming weight perturbations are a suitable noise distribution here, and elucidate how they can be constructed on a quantum computer. This may allow quantum computers to efficiently scale randomized smoothing to more complex tasks beyond the reach of classical methods.
  arXiv  Detail & Related papers  (2024-07-25T13:15:16Z)
• Quantum-Assisted Hilbert-Space Gaussian Process Regression [0.0]
  We propose a space approximation-based quantum algorithm for Gaussian process regression. Our method consists of a combination of classical basis function expansion with quantum computing techniques.
  arXiv  Detail & Related papers  (2024-02-01T12:13:35Z)
• Full-counting statistics of particle distribution on a digital quantum computer [0.0]
  Full-counting statistics (FCS) provides a powerful framework to access the statistical information of a system from the characteristic function. We propose a quantum algorithm for FCS that can obtain both the particle distribution and cumulants of interacting systems. The algorithm suggests an avenue for studying full-counting statistics on quantum computers.
  arXiv  Detail & Related papers  (2023-08-02T16:19:52Z)
• A quantum spectral method for simulating stochastic processes, with applications to Monte Carlo [4.134846879110833]
  We introduce a new analog'' quantum representation of processes, in which the value of the process at time t is stored in the amplitude of the quantum state. We show that we can simulate $T$ timesteps of fractional Brownian motion using a quantum circuit with gate complexity $textpolylog(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(textpolylog(Tepsilon
  arXiv  Detail & Related papers  (2023-03-12T17:54:38Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Quantum Quantile Mechanics: Solving Stochastic Differential Equations for Generating Time-Series [19.830330492689978]
  We propose a quantum algorithm for sampling from a solution of differential equations (SDEs) We represent the quantile function for an underlying probability distribution and extract samples as expectation values. We test the method by simulating the Ornstein-Uhlenbeck process and sampling at times different from the initial point.
  arXiv  Detail & Related papers  (2021-08-06T16:14:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.