Improved quantum algorithm for calculating eigenvalues of differential operators and its application to estimating the decay rate of the perturbation distribution tail in stochastic inflation

• URL: http://arxiv.org/abs/2410.02276v1
• Date: Thu, 3 Oct 2024 07:56:20 GMT
• Title: Improved quantum algorithm for calculating eigenvalues of differential operators and its application to estimating the decay rate of the perturbation distribution tail in stochastic inflation
• Authors: Koichi Miyamoto, Yuichiro Tada,
• Abstract summary: We propose a quantum algorithm for estimating the first eigenvalue of a differential operator $mathcalL$ on $mathbbRd$. We then consider the application of our method to a problem in a theoretical framework for cosmic inflation known as quantum inflation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum algorithms for scientific computing and their applications have been studied actively. In this paper, we propose a quantum algorithm for estimating the first eigenvalue of a differential operator $\mathcal{L}$ on $\mathbb{R}^d$ and its application to cosmic inflation theory. A common approach for this eigenvalue problem involves applying the finite-difference discretization to $\mathcal{L}$ and computing the eigenvalues of the resulting matrix, but this method suffers from the curse of dimensionality, namely the exponential complexity with respect to $d$. Our first contribution is the development of a new quantum algorithm for this task, leveraging recent quantum singular value transformation-based methods. Given a trial function that overlaps well with the eigenfunction, our method runs with query complexity scaling as $\widetilde{O}(d^3/\epsilon^2)$ with $d$ and estimation accuracy $\epsilon$, which is polynomial in $d$ and shows an improvement over existing quantum algorithms. Then, we consider the application of our method to a problem in a theoretical framework for cosmic inflation known as stochastic inflation, specifically calculating the eigenvalue of the adjoint Fokker--Planck operator, which is related to the decay rate of the tail of the probability distribution for the primordial density perturbation. We numerically see that in some cases, simple trial functions overlap well with the first eigenfunction, indicating our method is promising for this problem.

Related papers

• Computable entanglement cost [4.642647756403864]
  We consider the problem of computing the entanglement cost of preparing noisy quantum states under quantum operations with positive partial transpose (PPT) A previously claimed solution to this problem is shown to be incorrect. We construct instead an alternative solution in the form of two hierarchies of semi-definite programs that converge to the true value of the entanglement cost from above and from below. Our main result establishes that this convergence happens exponentially fast, thus yielding an efficient algorithm that approximates the cost up to an additive error $varepsilon$ in time.
  arXiv  Detail & Related papers  (2024-05-15T18:00:01Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Alternatives to a nonhomogeneous partial differential equation quantum algorithm [52.77024349608834]
  We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
  arXiv  Detail & Related papers  (2022-05-11T14:29:39Z)
• The complexity of quantum support vector machines [1.7887848708497243]
  Quantum support vector machines employ quantum circuits to define the kernel function. We show that the dual problem can be solved in $O(M4.67/varepsilon2)$ quantum circuit evaluations.
  arXiv  Detail & Related papers  (2022-02-28T19:01:17Z)
• Quantum algorithms for the generalized eigenvalue problem [6.111964049119244]
  generalized eigenvalue (GE) problems are of particular importance in various areas of science engineering and machine learning. We present a variational quantum algorithm for finding the desired generalized eigenvalue of the GE problem, $mathcalA|psirangle=lambdamathcalB|psirangle$, by choosing suitable loss functions. We numerically implement our algorithms to conduct a 2-qubit simulation and successfully find the generalized eigenvalues of the matrix pencil $(mathcalA,,mathcalB)$
  arXiv  Detail & Related papers  (2021-12-05T12:12:49Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer [0.0]
  We present explicit expressions for the central piece of a variational method developed by Shi et al. We derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and subroutine operators. We present a simple gradient-descent-based algorithm that can be used as an optimization in combination with imaginary time evolution.
  arXiv  Detail & Related papers  (2021-05-27T10:31:45Z)
• Machine Learning Universal Bosonic Functionals [0.0]
  A functional theory for bosonic ground states establishes the existence of a universal functional $mathcalF[gamma]$ that recovers quantum correlations exactly. For the Bose-Hubbard model, we present a comparison between our approach and Quantum Monte Carlo.
  arXiv  Detail & Related papers  (2021-04-07T15:53:10Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

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.