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

Simple item page
dc.creatorRamos, R. V.
dc.creatorde Oliveira, J. L.
dc.date2008-09-09
dc.date2008-10-07
dc.date.accessioned2026-07-07T10:07:39Z
dc.date.available2026-07-07T10:07:39Z
dc.descriptionSeveral 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.
dc.descriptionEleven pages, two figures. A complexity analysis is included
dc.identifierhttps://arxiv.org/abs/0809.1538
dc.identifierhttp://arxiv.org/abs/0809.1538
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170712
dc.subjectQuantum Physics
dc.titleAsymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the Probability of Finding a Diophantine Equation That Accepts Integer Solutions
dc.typetext

Files

Collections

arXiv