Correspondence between open bosonic systems and stochastic differential
equations
- URL: http://arxiv.org/abs/2302.01962v2
- Date: Fri, 30 Jun 2023 22:42:29 GMT
- Title: Correspondence between open bosonic systems and stochastic differential
equations
- Authors: Alexander Engel and Scott E. Parker
- Abstract summary: We show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment.
A particular system with the form of a discrete nonlinear Schr"odinger equation is analyzed in more detail.
- Score: 77.34726150561087
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Bosonic mean-field theories can approximate the dynamics of systems of $n$
bosons provided that $n \gg 1$. We show that there can also be an exact
correspondence at finite $n$ when the bosonic system is generalized to include
interactions with the environment and the mean-field theory is replaced by a
stochastic differential equation. When the $n \to \infty$ limit is taken, the
stochastic terms in this differential equation vanish, and a mean-field theory
is recovered. Besides providing insight into the differences between the
behavior of finite quantum systems and their classical limits given by $n \to
\infty$, the developed mathematics can provide a basis for quantum algorithms
that solve some stochastic nonlinear differential equations. We discuss
conditions on the efficiency of these quantum algorithms, with a focus on the
possibility for the complexity to be polynomial in the log of the stochastic
system size. A particular system with the form of a stochastic discrete
nonlinear Schr\"{o}dinger equation is analyzed in more detail.
Related papers
- Fourier Neural Differential Equations for learning Quantum Field
Theories [57.11316818360655]
A Quantum Field Theory is defined by its interaction Hamiltonian, and linked to experimental data by the scattering matrix.
In this paper, NDE models are used to learn theory, Scalar-Yukawa theory and Scalar Quantum Electrodynamics.
The interaction Hamiltonian of a theory can be extracted from network parameters.
arXiv Detail & Related papers (2023-11-28T22:11:15Z) - The Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) Equation for
Two-Dimensional Systems [62.997667081978825]
Open quantum systems can obey the Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) equation.
We exhaustively study the case of a Hilbert space dimension of $2$.
arXiv Detail & Related papers (2022-04-16T07:03:54Z) - Decimation technique for open quantum systems: a case study with
driven-dissipative bosonic chains [62.997667081978825]
Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics.
We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function.
We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
arXiv Detail & Related papers (2022-02-15T19:00:09Z) - Exact solutions of interacting dissipative systems via weak symmetries [77.34726150561087]
We analytically diagonalize the Liouvillian of a class Markovian dissipative systems with arbitrary strong interactions or nonlinearity.
This enables an exact description of the full dynamics and dissipative spectrum.
Our method is applicable to a variety of other systems, and could provide a powerful new tool for the study of complex driven-dissipative quantum systems.
arXiv Detail & Related papers (2021-09-27T17:45:42Z) - Differential Equation Based Path Integral for System-Bath Dynamics [0.0]
We propose the differential equation based path integral (DEBPI) method to simulate the real-time evolution of open quantum systems.
New numerical schemes can be derived by discretizing these differential equations.
It is numerically verified that in certain cases, by selecting appropriate systems and applying suitable numerical schemes, the memory cost required in the i-QuAPI method can be significantly reduced.
arXiv Detail & Related papers (2021-07-22T15:06:22Z) - 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) - Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables.
In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
arXiv Detail & Related papers (2021-02-18T20:55:04Z) - Solving non-linear Kolmogorov equations in large dimensions by using
deep learning: a numerical comparison of discretization schemes [16.067228939231047]
Non-linear partial differential Kolmogorov equations are successfully used to describe a wide range of time dependent phenomena.
Deep learning has been introduced to solve these equations in high-dimensional regimes.
We show that, for some discretization schemes, improvements in the accuracy are possible without affecting the observed computational complexity.
arXiv Detail & Related papers (2020-12-09T07:17:26Z) - Solving nonlinear differential equations with differentiable quantum
circuits [21.24186888129542]
We propose a quantum algorithm to solve systems of nonlinear differential equations.
We use automatic differentiation to represent function derivatives in an analytical form as differentiable quantum circuits.
We show how this approach can implement a spectral method for solving differential equations in a high-dimensional feature space.
arXiv Detail & Related papers (2020-11-20T13:21:11Z) - Efficient quantum algorithm for dissipative nonlinear differential
equations [1.1988695717766686]
We develop a quantum algorithm for dissipative quadratic $n$-dimensional ordinary differential equations.
Our algorithm has complexity $T2 qmathrmpoly(log T, log n, log 1/epsilon)/epsilon$, where $T$ is the evolution time, $epsilon$ is the allowed error, and $q$ measures decay of the solution.
arXiv Detail & Related papers (2020-11-06T04:27:00Z)
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.