Solving Caldeira-Leggett Model by Inchworm Method with Frozen Gaussian Approximation

• URL: http://arxiv.org/abs/2408.01039v1
• Date: Fri, 2 Aug 2024 06:23:02 GMT
• Title: Solving Caldeira-Leggett Model by Inchworm Method with Frozen Gaussian Approximation
• Authors: Geshuo Wang, Siyao Yang, Zhenning Cai,
• Abstract summary: We use frozen Gaussian approximation to approximate the wave function as a wave packet in integral form. The desired reduced density operator is then written as a Dyson series. The inchworm method formulates the series as an integro-differential equation of "full propagators"
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an algorithm that combines the inchworm method and the frozen Gaussian approximation to simulate the Caldeira-Leggett model in which a quantum particle is coupled with thermal harmonic baths. In particular, we are interested in the real-time dynamics of the reduced density operator. In our algorithm, we use frozen Gaussian approximation to approximate the wave function as a wave packet in integral form. The desired reduced density operator is then written as a Dyson series, which is the series expression of path integrals in quantum mechanics of interacting systems. To compute the Dyson series, we further approximate each term in the series using Gaussian wave packets, and then employ the idea of the inchworm method to accelerate the convergence of the series. The inchworm method formulates the series as an integro-differential equation of "full propagators", and rewrites the infinite series on the right-hand side using these full propagators, so that the number of terms in the sum can be significantly reduced, and faster convergence can be achieved. The performance of our algorithm is verified numerically by various experiments.

Related papers

• von Mises Quasi-Processes for Bayesian Circular Regression [57.88921637944379]
  We explore a family of expressive and interpretable distributions over circle-valued random functions. The resulting probability model has connections with continuous spin models in statistical physics. For posterior inference, we introduce a new Stratonovich-like augmentation that lends itself to fast Markov Chain Monte Carlo sampling.
  arXiv  Detail & Related papers  (2024-06-19T01:57:21Z)
• Iterated Schrödinger bridge approximation to Wasserstein Gradient Flows [1.5561923713703105]
  We introduce a novel discretization scheme for Wasserstein gradient flows that involves successively computing Schr"odinger bridges with the same marginals. The proposed scheme has two advantages: one, it avoids the use of the score function, and, two, it is amenable to particle-based approximations using the Sinkhorn algorithm.
  arXiv  Detail & Related papers  (2024-06-16T07:23:26Z)
• Family of Gaussian wavepacket dynamics methods from the perspective of a nonlinear Schr\"odinger equation [0.0]
  We show that several well-known Gaussian wavepacket dynamics methods, such as Heller's original thawed Gaussian approximation or Coalson and Karplus's variational Gaussian approximation, fit into this framework. We study such a nonlinear Schr"odinger equation in general.
  arXiv  Detail & Related papers  (2023-02-20T19:01:25Z)
• The Curse of Unrolling: Rate of Differentiating Through Optimization [35.327233435055305]
  Un differentiation approximates the solution using an iterative solver and differentiates it through the computational path. We show that we can either 1) choose a large learning rate leading to a fast convergence but accept that the algorithm may have an arbitrarily long burn-in phase or 2) choose a smaller learning rate leading to an immediate but slower convergence.
  arXiv  Detail & Related papers  (2022-09-27T09:27:29Z)
• An efficient approximation for accelerating convergence of the numerical power series. Results for the 1D Schr\"odinger's equation [0.0]
  The numerical matrix Numerov algorithm is used to solve the stationary Schr"odinger equation for central Coulomb potentials. An efficient approximation for accelerating the convergence is proposed.
  arXiv  Detail & Related papers  (2021-11-22T17:39:36Z)
• Scalable Variational Gaussian Processes via Harmonic Kernel Decomposition [54.07797071198249]
  We introduce a new scalable variational Gaussian process approximation which provides a high fidelity approximation while retaining general applicability. We demonstrate that, on a range of regression and classification problems, our approach can exploit input space symmetries such as translations and reflections. Notably, our approach achieves state-of-the-art results on CIFAR-10 among pure GP models.
  arXiv  Detail & Related papers  (2021-06-10T18:17:57Z)
• A hybrid classical-quantum approach to solve the heat equation using quantum annealers [0.0]
  We show that the errors and chain break fraction are, on average, greater on the 2000Q system. Unlike the classical Gauss-Seidel method, the errors of the quantum solutions level off after a few iterations. This is partly a result of the span of the real number line available from the mapping of the chosen size of the set of qubit states.
  arXiv  Detail & Related papers  (2021-06-08T13:04:34Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• Quantum Algorithm for Smoothed Particle Hydrodynamics [0.0]
  We present a quantum computing algorithm for the smoothed particle hydrodynamics (SPH) method. Error convergence is exponentially fast in the number of qubits. We extend the method to solve the one-dimensional advection and partial diffusion differential equations.
  arXiv  Detail & Related papers  (2020-06-11T18:28:24Z)
• The Convergence Indicator: Improved and completely characterized parameter bounds for actual convergence of Particle Swarm Optimization [68.8204255655161]
  We introduce a new convergence indicator that can be used to calculate whether the particles will finally converge to a single point or diverge. Using this convergence indicator we provide the actual bounds completely characterizing parameter regions that lead to a converging swarm.
  arXiv  Detail & Related papers  (2020-06-06T19:08:05Z)
• Gaussianization Flows [113.79542218282282]
  We propose a new type of normalizing flow model that enables both efficient iteration of likelihoods and efficient inversion for sample generation. Because of this guaranteed expressivity, they can capture multimodal target distributions without compromising the efficiency of sample generation.
  arXiv  Detail & Related papers  (2020-03-04T08:15:06Z)

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.