Wavelet Quantum Search Algorithm with Partial Information

Simple item page
dc.creatorPark, Sangwoong
dc.creatorBae, Joonwoo
dc.creatorKwon, Younghun
dc.date2003-03-05
dc.date2003-03-06
dc.date.accessioned2026-07-07T06:06:16Z
dc.date.available2026-07-07T06:06:16Z
dc.descriptionIt is questionable that Grover algorithm may be more valuable than a classical one, when a partial information is given in a unstructured database. In this letter, to consider quantum search when a partial information is given, we replace the Fourier transform in the Grover algorithm with the Haar wavelet transform. We then, given a partial information $L$ to a unstructured database of size $N$, show that there is the improved speedup, $O(\sqrt{N/L})$.
dc.description7 pages, 2 figures, Plain latex; some typos corrected
dc.identifierhttps://arxiv.org/abs/quant-ph/0303025
dc.identifierhttp://arxiv.org/abs/quant-ph/0303025
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90914
dc.subjectQuantum Physics
dc.titleWavelet Quantum Search Algorithm with Partial Information
dc.typetext

Files

Collections

arXiv