Asymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the P.pdfVIP

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 R. V. Ramos and J. L. de Oliveira rubens@deti.ufc.br jluzeilton @deti.ufc.br Dep artment of Teleinf ormatic Engineering, Federal University of Ceara Camp us do Pici, C. P. 6007, 60455-740, Fortaleza, Brazil. 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 u se 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 u sed 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. Keywords: Quantum algorithms, quantum search, optimization, Diophantine equations. 1. Introduction The Grover ’s quantum search algorithm is an important result in quantum computation that proves that quantum superposition can speed-up the task of finding a specific value within an unordered database. The quantum search is proved to use O(N 1/2) operations of the oracle (in comparison with the O(N) operations of the best classical algorithm), indicating a quadratic speed-up [1-3]. Several mathematical problems can be modeled as a search, like the problem of fi