Solution of the Probabilistic Lambert Problem: Connections with Optimal Mass Transport, Schrödinger Bridge and Reaction-Diffusion PDEs
- URL: http://arxiv.org/abs/2401.07961v4
- Date: Thu, 03 Oct 2024 14:35:40 GMT
- Title: Solution of the Probabilistic Lambert Problem: Connections with Optimal Mass Transport, Schrödinger Bridge and Reaction-Diffusion PDEs
- Authors: Alexis M. H. Teter, Iman Nodozi, Abhishek Halder,
- Abstract summary: The Lambert problem originated in orbital mechanics.
It concerns with determining the initial velocity for a boundary value problem involving the dynamical constraint due to gravitational potential with additional time horizon and endpoint position constraints.
We consider a probabilistic variant of the Lambert problem where the knowledge of the endpoint constraints in position vectors are replaced by the knowledge of their respective joint probability density functions.
- Score: 0.44241702149260353
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Lambert problem originated in orbital mechanics. It concerns with determining the initial velocity for a boundary value problem involving the dynamical constraint due to gravitational potential with additional time horizon and endpoint position constraints. Its solution has application in transferring a spacecraft from a given initial to a given terminal position within prescribed flight time via velocity control. We consider a probabilistic variant of the Lambert problem where the knowledge of the endpoint constraints in position vectors are replaced by the knowledge of their respective joint probability density functions. We show that the Lambert problem with endpoint joint probability density constraints is a generalized optimal mass transport (OMT) problem, thereby connecting this classical astrodynamics problem with a burgeoning area of research in modern stochastic control and stochastic machine learning. This newfound connection allows us to rigorously establish the existence and uniqueness of solution for the probabilistic Lambert problem. The same connection also helps to numerically solve the probabilistic Lambert problem via diffusion regularization, i.e., by leveraging further connection of the OMT with the Schr\"odinger bridge problem (SBP). This also shows that the probabilistic Lambert problem with additive dynamic process noise is a generalized SBP, and can be solved numerically using the so-called Schr\"odinger factors, as we do in this work. Our analysis leads to solving a system of reaction-diffusion PDEs where the gravitational potential appears as the reaction rate.
Related papers
- Exact solvability of the Gross-Pitaevskii equation for bound states subjected to general potentials [0.0]
We show that the Gross-Pitaevskii (GP) equation can be mapped to a first-order non-autonomous dynamical system.
For the benefit of the reader, we comment on the difference between the integrability of a quantum system and the solvability of the wave equation.
arXiv Detail & Related papers (2025-02-10T03:12:56Z) - WKB Methods for Finite Difference Schrodinger Equations [0.0]
We will develop an all-order WKB algorithm to get arbitrary hbar-corrections and construct a general quantum momentum.
We will then study the simplest non trivial example, the linear potential case and the Bessel functions.
With those connection formulae, we will analyse a selection of problems, constructing the discrete spectrum of various finite difference Schrodinger problems.
arXiv Detail & Related papers (2024-10-18T17:30:10Z) - Weyl Calculus and Exactly Solvable Schrödinger Bridges with Quadratic State Cost [3.820235868126608]
We explain how ideas from Weyl calculus in quantum mechanics, specifically the Weyl operator and the Weyl symbol, can help determine such Markov kernels.
We illustrate these ideas by explicitly finding the Markov kernel for the case of quadratic state cost via Weyl calculus.
arXiv Detail & Related papers (2024-07-21T19:05:30Z) - An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem [49.1574468325115]
We analyse the ability of quantum D-Wave annealers to find the maximum clique on a graph, expressed as a QUBO problem.
We propose a decomposition algorithm for the complementary maximum independent set problem, and a graph generation algorithm to control the number of nodes, the number of cliques, the density, the connectivity indices and the ratio of the solution size to the number of other nodes.
arXiv Detail & Related papers (2024-06-11T04:40:05Z) - Real-time dynamics of false vacuum decay [49.1574468325115]
We investigate false vacuum decay of a relativistic scalar field in the metastable minimum of an asymmetric double-well potential.
We employ the non-perturbative framework of the two-particle irreducible (2PI) quantum effective action at next-to-leading order in a large-N expansion.
arXiv Detail & Related papers (2023-10-06T12:44:48Z) - Anti-crossings occurrence as exponentially closing gaps in Quantum
Annealing [0.0]
We use a perturbative expansion to derive a condition for the occurrence of an avoided level crossing during the annealing process.
We show that no exponentially small gaps arise for regular bipartite graphs, implying that QA can efficiently solve MaxCut in that case.
arXiv Detail & Related papers (2023-04-25T14:42:20Z) - Quantum space-time marginal problem: global causal structure from local
causal information [0.0]
We study the relationship between local causal information and global causal structure.
A space-time marginal problem is proposed to infer global causal structures.
We show that there almost always exists a solution in this case.
arXiv Detail & Related papers (2023-03-22T14:57:08Z) - Learning to Solve PDE-constrained Inverse Problems with Graph Networks [51.89325993156204]
In many application domains across science and engineering, we are interested in solving inverse problems with constraints defined by a partial differential equation (PDE)
Here we explore GNNs to solve such PDE-constrained inverse problems.
We demonstrate computational speedups of up to 90x using GNNs compared to principled solvers.
arXiv Detail & Related papers (2022-06-01T18:48:01Z) - Quantum dynamics corresponding to chaotic BKL scenario [62.997667081978825]
Quantization smears the gravitational singularity avoiding its localization in the configuration space.
Results suggest that the generic singularity of general relativity can be avoided at quantum level.
arXiv Detail & Related papers (2022-04-24T13:32:45Z) - 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) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z) - Function approximation by neural nets in the mean-field regime: Entropic regularization and controlled McKean-Vlasov dynamics [7.1822457112352955]
We consider the problem of function approximation by two-layer neural nets with random weights that are "nearly Gaussian"
We show that the problem can be phrased as global minimization of a free energy functional on the space of paths over probability measures on the weights.
arXiv Detail & Related papers (2020-02-05T20:50:33Z) - Einselection from incompatible decoherence channels [62.997667081978825]
We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators.
We show that Fock states remain the most robust states to decoherence up to a critical coupling.
arXiv Detail & Related papers (2020-01-29T14:15:19Z)
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.