Related papers: Solution of quantum eigenvalue problems by means o…
We discuss the automatic solution of the multichannel Schr\"odinger equation. The proposed approach is based on the use of a CP method for which the step size is not restricted by the oscillations in the solution. Moreover, this CP method…
We propose a framework to solve non-linear and history-dependent mechanical problems based on a hybrid classical computer -- quantum annealer approach. Quantum Computers are anticipated to solve particular operations exponentially faster.…
We discuss the (right) eigenvalue equation for $\mathbb{H}$, $\mathbb{C}$ and $\mathbb{R}$ linear quaternionic operators. The possibility to introduce an isomorphism between these operators and real/complex matrices allows to translate the…
The accurate computation of ground and excited states of many-fermion quantum systems is one of the most consequential, contemporary challenges in the physical and computational sciences whose solution stands to benefit significantly from…
The polynomial solution of the Schrodinger equation for the Pseudoharmonic potential is found for any arbitrary angular momentum $l$. The exact bound-state energy eigenvalues and the corresponding eigen functions are analytically…
Quantum computers are known for their potential to achieve up-to-exponential speedup compared to classical computers for certain problems. To exploit the advantages of quantum computers, we propose quantum algorithms for linear stochastic…
For nonrelativistic Hamiltonians which are shape invariant, analytic expressions for the eigenvalues and eigenvectors can be derived using the well known method of supersymmetric quantum mechanics. Most of these Hamiltonians also possess…
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm,…
Using operator ordering techniques based on BCH-like relations of the su(1,1) Lie algebra and a time-splitting approach,we present an alternative method of solving the dynamics of a time-dependent quantum harmonic oscillator for any initial…
The stationary 1D Schr\"odinger equation with a polynomial potential $V(q)$ of degree N is reduced to a system of exact quantization conditions of Bohr-Sommerfeld form. They arise from bilinear (Wronskian) functional relations pairing…
We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme, where its solution is encoded into certain set of suitable basis functions. We…
Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems $Hv = \lambda v$, such as those occurring in quantum chemistry. It is natural to ask whether the same technique can be applied to…
In this paper, we consider the operator properties of various phononic eigenvalue problems. We aim to answer some fundamental questions about the eigenvalues and eigenvectors of phononic operators. These include questions about the…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
We report a new analytical method for solution of a wide class of second-order differential equations with eigenvalues replaced by arbitrary functions. Such classes of problems occur frequently in Quantum Mechanics and Optics. This approach…
We develop a quantum algorithm for linear algebraic equations $ A\bb{x} = \bb{b} $ from the perspective of Schr\"odingerization-form problems, which are characterized by a system of linear convection equations in one higher dimension. When…
We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…
We present a simple recipe to construct exactly and quasi-exactly solvable Hamiltonians in one-dimensional `discrete' quantum mechanics, in which the Schr\"{o}dinger equation is a difference equation. It reproduces all the known ones whose…
We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…
Quantum subspace methods (QSMs) are a class of quantum computing algorithms where the time-independent Schrodinger equation for a quantum system is projected onto a subspace of the underlying Hilbert space. This projection transforms the…