Physics – Quantum Physics
Scientific paper
2005-04-26
Physics
Quantum Physics
18 pages
Scientific paper
We show how a number of NP-complete as well as NP-hard problems can be reduced to the Sturm-Liouville eigenvalue problem in the quantum setting with queries. We consider power queries which are derived from the propagator of a system evolving with a Hamiltonian obtained from the discretization of the Sturm-Liouville operator. We show that the number of power queries as well the number of qubits needed to solve the problems studied in this paper is a low degree polynomial. The implementation of power queries by a polynomial number of elementary quantum gates is an open issue. If this problem is solved positively for the power queries used for the Sturm-Liouville eigenvalue problem then a quantum computer would be a very powerful computation device allowing us to solve NP-complete problems in polynomial time.
Papageorgiou Anargyros
Woźniakowski Henryk
No associations
LandOfFree
The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-199777