Related papers: The Sturm-Liouville eigenvalue problem and NP-comp…
The arithmetic problem of factoring an integer $N$ can be translated into the physics of a quantum device, a result that supports P\'olya's and Hilbert's conjecture to prove Riemann's hypothesis. The energies of this system, being…
We present a polynomial-time quantum algorithm for obtaining the energy spectrum of a physical system, i.e. the differences between the eigenvalues of the system's Hamiltonian, provided that the spectrum of interest contains at most a…
Variational quantum algorithms are proposed to solve relevant computational problems on near term quantum devices. Popular versions are variational quantum eigensolvers and quantum ap- proximate optimization algorithms that solve ground…
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the…
This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of…
Quantum computers promise a great computational advantage over classical computers, yet currently available quantum devices have only a limited amount of qubits and a high level of noise, limiting the size of problems that can be solved…
We propose a quantum-classical hybrid algorithm of the power method, here dubbed as quantum power method, to evaluate $\hat{\cal H}^n |\psi\rangle$ with quantum computers, where $n$ is a nonnegative integer, $\hat{\cal H}$ is a…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
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,…
This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining qubits are initially in the totally mixed state. No…
We investigate the power of quantum computers when they are required to return an answer that is guaranteed correct after a time that is upper-bounded by a polynomial in the worst case. In an oracle setting, it is shown that such machines…
We study the distribution of the Sturm-Liouville eigenvalues of a potential with finitely many singularities. There is an asymptotically periodical structure on this class of eigenvalues as described by the entire function theory. We…
This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for quantum computers. In particular, under any hidden-variable theory…
In this paper, we study spectral problems for the Sturm-Liouville operator with arbitrary complexvalued potential q(x) and two-point boundary conditions. All types of mentioned boundary conditions are considered. We ivestigate in detail the…
Estimating the eigenstate properties of quantum systems is a long-standing, challenging problem for both classical and quantum computing. Existing universal quantum algorithms typically rely on ideal and efficient query models (e.g. time…
This paper deals with the Sturm-Liouville problem that feature distribution potential, polynomial dependence on the spectral parameter in the first boundary condition, and analytical dependence, in the second one. We study an inverse…
We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we…
There is a widespread view that the human brain is so complex that it cannot be efficiently simulated by universal Turing machines. During the last decades the question has therefore been raised whether we need to consider quantum effects…
We use the theory of entire functions of finite order to prove a universal spectral dependence of the blowup/decay rate of solutions of the Sturm-Liouville eigenvalue equation for problems with Schatten $p$-class resolvents. The general…
A new version of the piecewise approximation (Pruess) method is developed for calculating eigenvalues of Sturm-Liouville problems. The usual piecewise constant or piecewise linear potential approximations are replaced by translates of…