TBA Equations and Quantization Conditions
- URL: http://arxiv.org/abs/2008.13680v3
- Date: Mon, 31 May 2021 09:52:30 GMT
- Title: TBA Equations and Quantization Conditions
- Authors: Yoan Emery
- Abstract summary: We develop a graphical procedure due to Toledo to study the wall-crossing behavior of the TBA equations.
We compute the quantum corrections to the all-order WKB periods in many examples.
In particular, we show how this method can be used to determine resonances in potentials.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: It has been recently realized that, in the case of polynomial potentials, the
exact WKB method can be reformulated in terms of a system of TBA equations. In
this paper we study this method in various examples. We develop a graphical
procedure due to Toledo, which provides a fast and simple way to study the
wall-crossing behavior of the TBA equations. When complemented with exact
quantization conditions, the TBA equations can be used to solve spectral
problems exactly in Quantum Mechanics. We compute the quantum corrections to
the all-order WKB periods in many examples, as well as the exact spectrum for
many potentials. In particular, we show how this method can be used to
determine resonances in unbounded potentials.
Related papers
- 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) - A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states.
It is executable on current (hybrid) quantum hardware and does not depend on quantum memory.
We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
arXiv Detail & Related papers (2024-05-29T14:40:24Z) - 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) - Depth analysis of variational quantum algorithms for heat equation [0.0]
We consider three approaches to solve the heat equation on a quantum computer.
An exponential number of Pauli products in the Hamiltonian decomposition does not allow for the quantum speed up to be achieved.
The ansatz tree approach exploits an explicit form of the matrix what makes it possible to achieve an advantage over classical algorithms.
arXiv Detail & Related papers (2022-12-23T14:46:33Z) - Variational Quantum Solutions to the Advection-Diffusion Equation for
Applications in Fluid Dynamics [0.0]
We present one method to perform fluid dynamics calculations that takes advantage of quantum computing.
We find that reliable solutions of the equation can be obtained on even the noisy quantum computers available today.
arXiv Detail & Related papers (2022-08-24T21:29:46Z) - Near-term quantum algorithm for computing molecular and materials
properties based on recursive variational series methods [44.99833362998488]
We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices.
We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
arXiv Detail & Related papers (2022-06-20T16:33:23Z) - 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) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Variational Adiabatic Gauge Transformation on real quantum hardware for
effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
We introduce the Variational Adiabatic Gauge Transformation (VAGT)
VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit.
The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
arXiv Detail & Related papers (2021-11-16T20:50:08Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - 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)
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.