Physics – Quantum Physics
Scientific paper
2008-09-09
Physics
Quantum Physics
Eleven pages, two figures. A complexity analysis is included
Scientific paper
Several mathematical problems can be modeled as a search in a database. An example is the problem of finding the minimum of a function. Quantum algorithms for solving this problem have been proposed and all of them use the quantum search algorithm as a subroutine and several intermediate measurements are realized. In this work, it is proposed a new quantum algorithm for finding the minimum of a function in which quantum search is not used as a subroutine and only one measurement is needed. This is also named asymptotic quantum search. As an example, we propose a quantum algorithm based on asymptotic quantum search and quantum counting able to calculate a lower bound of the probability of finding a Diophantine equation with integer solution.
de Oliveira Joao Luzeilton
Ramos Rubens Viana
No associations
LandOfFree
Asymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the Probability of Finding a Diophantine Equation That Accepts Integer Solutions 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 Asymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the Probability of Finding a Diophantine Equation That Accepts Integer Solutions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the Probability of Finding a Diophantine Equation That Accepts Integer Solutions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-210646