Related papers: The Sturm-Liouville eigenvalue problem and NP-comp…
Most studies of PT-symmetric quantum-mechanical Hamiltonians have considered the Schroedinger eigenvalue problem on an infinite domain. This paper examines the consequences of imposing the boundary conditions on a finite domain. As is the…
We consider a recently discovered representation for the general solution of the Sturm-Liouville equation as a spectral parameter power series (SPPS). The coefficients of the power series are given in terms of a particular solution of the…
We study asymptotics of eigenvalues, eigenfunctions and norming constants of singular energy-dependent Sturm--Liouville equations with complex-valued potentials. The analysis essentially exploits the integral representation of solutions,…
In this study, the theorem on necessary and sufficient conditions for the solvability of inverse problem for Sturm-Liouville operator with discontinuous coefficient is proved and the algorithm of reconstruction of potential from spectral…
In this paper, we further Meirong Zhang, et al.'s work by computing the number of weighted eigenvalues for Sturm-Liouville equations, equipped with general integrable potentials and Dirac weights, under Dirichlet boundary condition. We show…
In the present review we deal with the recently introduced method of spectral parameter power series (SPPS) and show how its application leads to an explicit form of the characteristic equation for different eigenvalue problems involving…
A method for approximate solution of spectral problems for Sturm-Liouville equations based on the construction of the Delsarte transmutation operators is presented. In fact the problem of numerical approximation of solutions and eigenvalues…
In this study, we consider a boundary value problem generated by the Sturm-Liouville problem with a frozen argument and with non-separated boundary conditions on a time scale. Firstly, we present some solutions and characteristic function…
If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting…
In the paper we propose a direct method for recovering the Sturm-Liouville potential from the Weyl-Titchmarsh $m$-function given on a countable set of points. We show that using the Fourier-Legendre series expansion of the transmutation…
Grover's algorithm can solve NP-complete problems on quantum computers faster than all the known algorithms on classical computers. However, Grover's algorithm still needs exponential time. Due to the BBBV theorem, Grover's algorithm is…
Quantum signal processing (QSP) and the quantum singular value transformation (QSVT) are pivotal tools for simplifying the development of quantum algorithms. These techniques leverage polynomial transformations on the eigenvalues or…
The question of whether or not quantum computers can efficiently solve NP-complete problems is open, although indications are that BQP does not contain NP. Still, many of these problems are natural candidates for solution on quantum…
In this paper, the inverse Sturm-Liouville problem with distribution potential and with polynomials of the spectral parameter in one of the boundary conditions is considered. We for the first time prove local solvability and stability of…
In this paper, we numerically investigate an inverse problem of recovering the potential term in a fractional Sturm-Liouville problem from one spectrum. The qualitative behaviors of the eigenvalues and eigenfunctions are discussed, and…
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 characterize singularity of the $n$-th eigenvalue of self-adjoint discrete Sturm-Liouville problems in any dimension. For a fixed Sturm-Liouville equation, we completely characterize singularity of the $n$-th eigenvalue.…
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's…
This paper deals with the computation of the eigenvalues of two-parameter Sturm- Liouville (SL) problems using the Regularized Sampling Method, a method which has been effective in computing the eigenvalues of broad classes of SL problems…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…