Constant-Time Quantum Algorithm For The Unstructured Search Problem

Simple item page
dc.creatorYounes, Ahmed
dc.date2008-11-26
dc.date.accessioned2026-07-07T12:04:28Z
dc.date.available2026-07-07T12:04:28Z
dc.descriptionGiven an item and a list of values of size $N$. It is required to decide if such item exists in the list. Classical computer can search for the item in O(N). The best known quantum algorithm can do the job in $O(\sqrt{N})$. In this paper, a quantum algorithm will be proposed that can search an unstructured list in O(1) to get the YES/NO answer with certainty.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/0811.4247
dc.identifierhttp://arxiv.org/abs/0811.4247
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/208144
dc.subjectQuantum Physics
dc.titleConstant-Time Quantum Algorithm For The Unstructured Search Problem
dc.typetext

Files

Collections

arXiv