WKB Methods for Finite Difference Schrodinger Equations

• URL: http://arxiv.org/abs/2410.14628v2
• Date: Mon, 21 Oct 2024 09:37:06 GMT
• Title: WKB Methods for Finite Difference Schrodinger Equations
• Authors: Salvatore Baldino,
• Abstract summary: 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.
• Score: 0.0
• License:
• Abstract: In this thesis, we develop WKB techniques for the finite difference Schrodinger equation, following the construction of the WKB approach for the standard differential Schrodinger equation. In particular, we will develop an all-order WKB algorithm to get arbitrary hbar-corrections and construct a general quantum momentum, underlining the various properties of its coefficients and the quantities that will be used when constructing the quantization condition. In doing so, we discover the existence of additional periodic factors that need to be considered in order to obtain the most general solution to the problem at hand. We will then proceed to study the simplest non trivial example, the linear potential case and the Bessel functions, that provide a solution to the linear problem. After studying the resurgence properties of the Bessel functions from an analytical and numerical point of view, we will then proceed to use those results in order to build general connection formulae, allowing us to connect the local solutions defined on two sides of a turning point into a smooth solution on the whole real line. With those connection formulae, we will analyse a selection of problems, constructing the discrete spectrum of various finite difference Schrodinger problems and comparing our results with existing literature.

Related papers

• 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)
• A Theoretical Framework for an Efficient Normalizing Flow-Based Solution to the Electronic Schrodinger Equation [8.648660469053342]
  A central problem in quantum mechanics involves solving the Electronic Schrodinger Equation for a molecule or material. We propose a solution via an ansatz which is cheap to sample from, yet satisfies the requisite quantum mechanical properties.
  arXiv  Detail & Related papers  (2024-05-28T15:42:15Z)
• Study on a Quantization Condition and the Solvability of Schrödinger-type Equations [0.0]
  We study a quantization condition in relation to the solvability of Schr"odinger equations. The SWKB quantization condition provides quantizations of energy. We show explicit solutions of the Schr"odinger equations with the classical-orthogonal-polynomially quasi-exactly solvable potentials.
  arXiv  Detail & Related papers  (2024-03-29T14:56:34Z)
• Curve fitting on a quantum annealer for an advanced navigation method [0.0]
  We consider a function that approximates a given set of data points and is written as a finite linear combination of standardized functions. In a real-word use case, we discuss the problem to find an optimized speed profile for a vessel using the framework of dynamic programming.
  arXiv  Detail & Related papers  (2024-02-23T13:13:28Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• Qade: Solving Differential Equations on Quantum Annealers [0.0]
  We present a general method, called Qade, for solving differential equations using a quantum annealer. On current devices, Qade can solve systems of coupled partial differential equations that depend linearly on the solution and its derivatives.
  arXiv  Detail & Related papers  (2022-04-07T18:00:00Z)
• Message Passing Neural PDE Solvers [60.77761603258397]
  We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators. We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes. We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
  arXiv  Detail & Related papers  (2022-02-07T17:47:46Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• 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)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

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.