Related papers: Solution of quantum eigenvalue problems by means o…
Schroedinger developed an operator method for solving quantum mechanics. While this technique is overshadowed by his more familiar differential equation approach, it has found wide application as an illustration of supersymmetric quantum…
In this paper we investigate a minimization problem related to the principal eigenvalue of the $s$-wave Schr\"{o}dinger operator. The operator depends nonlinearly on the eigenparameter. We prove the existence of a solution for the…
Quantum simulation is known to be capable of simulating certain dynamical systems in continuous time -- Schrodinger's equations being the most direct and well-known -- more efficiently than classical simulation. Any linear dynamical system…
It is well known in classical mechanics that, the frequencies of a periodic system can be obtained rather easily through the action variable, without completely solving the equation of motion. The equivalent quantum action variable…
Estimating the eigenvalues of non-normal matrices is a foundational problem with far-reaching implications, from modeling non-Hermitian quantum systems to analyzing complex fluid dynamics. Yet, this task remains beyond the reach of standard…
We present a semidefinite program (SDP) algorithm to find eigenvalues of Schr\"{o}dinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the…
By using a real matrix translation, we propose a coupled eigenvalue problem for octonionic operators. In view of possible applications in quantum mechanics, we also discuss the hermiticity of such operators. Previous difficulties in…
The aim of this paper is to develop an algebraic multigrid method to solve eigenvalue problems based on the combination of the multilevel correction scheme and the algebraic multigrid method for linear equations. Our approach uses the…
A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to…
We use a classical result of Hildebrandt to establish simple conditions for the absence of eigenvalues of non-selfadjoint discrete and continuous Schr\"odinger operators on the boundary of their numerical range.
This paper summarizes a research program that has been underway for a decade. The objective is to find a fast and accurate scheme for solving quantum problems which does not involve a Monte Carlo algorithm. We use an alternative strategy…
Courses on undergraduate quantum mechanics usually focus on solutions of the Schr\"odinger equation for several simple one-dimensional examples. When the notion of a Hilbert space is introduced only academic examples are used, such as the…
In a previous article we have shown how one can employ Artificial Neural Networks (ANNs) in order to solve non-homogeneous ordinary and partial differential equations. In the present work we consider the solution of eigenvalue problems for…
In this paper, a quantum dot mathematical model based on a two-dimensional Schr\"odinger equation assuming the 1/r inter-electronic potential is revisited. Generally, it is argued that the solutions of this model obtained by solving a…
Many problems in linear algebra -- such as those arising from non-Hermitian physics and differential equations -- can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. However, the existing Quantum…
The time dependent complex Schr\"odinger equation with cubic nonlinearity is solved by constructing differential quadrature algorithm based on sinc functions. Reduction to a coupled system of real equations enables to approach the space…
Quasi-Exactly Solvable Schr\"odinger Equations occupy an intermediate place between exactly-solvable (e.g. the harmonic oscillator and Coulomb problems etc) and non-solvable ones. Their major property is an explicit knowledge of several…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
We study a Fermi Hamilton operator $\hat K$ which does not commute with the number operator $\hat N$. The eigenvalue problem and the Schr\"odinger equation is solved. Entanglement is also discussed. Furthermore the Lie algebra generated by…
In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical…