Related papers: A Lower Bound for the Sturm-Liouville Eigenvalue P…
In this paper, we consider a wave equation on a bounded domain with a Sturm-Liouville operator with a singular intermediate coefficient and a singular potential. To obtain and evaluate the solution, the method of separation of variables is…
Quantum computers have an exponential speed-up advantage over classical computers. One of the most prominent utilities of quantum computers is their ability to study complex quantum systems in various fields using quantum computational…
This article is devoted to the regular fractional Sturm--Liouville eigenvalue problem. Applying methods of fractional variational analysis we prove existence of countable set of orthogonal solutions and corresponding eigenvalues. Moreover,…
This paper focuses on the study of Sturm-Liouville eigenvalue problems. In the classical Chebyshev collocation method, the Sturm-Liouville problem is discretized to a generalized eigenvalue problem where the functions represent interpolants…
Quantum information science currently poses a troubling contradiction. It can be summarized as: (1) To factor efficiently, quantum computers must perform exponentially precise energy estimation. (2) Exponentially precise energy estimation…
Accurately solving the Schr\"odinger equation remains a central challenge in computational physics, chemistry, and materials science. Here, we propose an alternative eigenvalue problem based on a system's autocorrelation function, avoiding…
We present a quantum computing formulation to address a challenging problem in the development of probabilistic learning on manifolds (PLoM). It involves solving the spectral problem of the high-dimensional Fokker-Planck (FKP) operator,…
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…
This paper explores the complexity associated with solving the inverse Sturm-Liouville problem with Robin boundary conditions: given a sequence of eigenvalues and a sequence of norming constants, how many limits does a universal algorithm…
In this paper we suggest a natural interpretation of the de Broglie-Bohm quantum potential, as the energy due to the oscillating electromagnetic field (virtual photon) coupled with moving charged particle. Generalization of the…
Bound states of the power-law and logarithmic potentials are calculated using a generalized pseudospectral method. The solution of the single-particle Schr\"odinger equation in a nonuniform and optimal spatial discretization offers accurate…
In the present paper, motivated by point interaction, we propose a new and explicit approach to inverse Sturm-Liouville eigenvalue problems under Dirichlet boundary. More precisely, when a given Sturm-Liouville eigenvalue problem with the…
We consider Sturm-Liouville operators with measure-valued weight and potential, and positive, bounded diffusion coefficient which is bounded away from zero. By means of a local periodicity condition, which can be seen as a quantitative…
Grover's algorithm is one of the most famous algorithms which explicitly demonstrates how the quantum nature can be utilized to accelerate the searching process. In this work, Grover's quantum search problem is mapped to a time-optimal…
We consider the quantum decoding problem. It consists in recovering a codeword given a superposition of noisy versions of this codeword. By measuring the superposition, we get back to the classical decoding problem. It appears for the first…
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers_cannot_…
Probably the simplest and most frequently used way to illustrate the power of quantum computing is to solve the so-called {\it Deutsch's problem}. Consider a Boolean function $f: \{0,1\} \to \{0,1\}$ and suppose that we have a (classical)…
Although quantum computers are capable of solving problems like factoring exponentially faster than the best-known classical algorithms, determining the resources responsible for their computational power remains unclear. An important class…
The paper is denoted to the initial-boundary value problem for the wave equation with the Sturm-Liouville operator with irregular (distributive) potentials. To obtain a solution to the equation, the separation method and asymptotics of the…
A classical computer simulating Schrodinger dynamics of a quantum system requires resources which scale exponentially with the size of the system, and is regarded as inefficient for such purposes. However, a quantum computer made up of a…