Related papers: The Sturm-Liouville eigenvalue problem and NP-comp…
The quantum search problem is an important problem due to the fact that a general NP problem can be solved efficiently by an unsorted quantum search algorithm. Here it has been shown that the quantum search problem could be solved in…
Sturm-Liouville problems are abundant in the numerical treatment of scientific and engineering problems. In the present contribution, we present an efficient and highly accurate method for computing eigenvalues of singular Sturm-Liouville…
We present a new approach to compute eigenvalues and eigenvectors of locally definite multiparameter eigenvalue problems by its signed multiindex. The method has the interpretation of a semismooth Newton method applied to certain functions…
Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the…
There has been increasing interest in developing efficient quantum algorithms for hard classical problems. The Network Signal Coordination (NSC) problem is one such problem known to be NP complete. We implement Grover's search algorithm to…
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 article considers the initial boundary value problem for the heat equation with the time-dependent Sturm-Liouville operator with singular potentials. To obtain a solution by the method of separation of variables, the problem is reduced…
We study a second-order differential equation involving a quasi-derivative, leading to a non-self-adjoint Sturm--Liouville-type problem with four coefficient functions. To analyze this equation, we develop a generalized Pr\"ufer…
In this study, inverse nodal problem is solved for p-Laplacian Schr\"odinger equation with energy-dependent potential with the Drichlet conditions. Asymptotic estimates of eigenvalues, nodal points and nodal lengths are given by using…
It is difficult to calculate the energy levels and eigenstates of a large physical system on a classical computer because of the exponentially growing size of the Hilbert space. In this work, we experimentally demonstrate a quantum…
Quasi-degenerate eigenvalue problems are central to quantum chemistry and condensed-matter physics, where low-energy spectra often form manifolds of nearly degenerate states that determine physical properties. Standard quantum algorithms,…
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…
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…
Accurate computation of multiple eigenvalues of quantum Hamiltonians is essential in quantum chemistry, materials science, and molecular spectroscopy. Estimating excited-state energies is challenging for classical algorithms due to…
I study some possibilities of analytically solving a particular Sturm-Liouville problem with step-wise (piece-constant) coefficients with help of an iterative procedure mentioned in my previous paper (Green's function sum rules). I…
We consider a scattering problem generated by the Sturm-Liouville equation on a tree which consists of an equilateral compact subtree and a half-infinite lead attached to its root. We assume that the potential on the lead is identically…
A central problem in quantum computing is to identify computational tasks which can be solved substantially faster on a quantum computer than on any classical computer. By studying the hardest such tasks, known as BQP-complete problems, we…
The Traveling Salesman Problem (TSP) is a classical NP-hard problem that plays a crucial role in combinatorial optimization. In this paper, we are interested in the quantum search framework for the TSP because it has robust theoretical…
On the basis of the theory of Sturm--Liouville problem with distribution coefficients we get the infima and suprema of the first eigenvalue of the problem $-y" + (q-\lambda) y=0, y'(0) -k_0^2 y(0) = y'(1) + k_1^2 y(1) = 0$, where $q$…
QMA and QCMA are possible quantum analogues of the complexity class NP. In QCMA the verifier is a quantum program and the proof is classical. In contrast, in QMA the proof is also a quantum state. We show that two known QMA-complete…