Wavelet quantum search algorithm with partial information

Sangwoong Park, Joonwoo Bae and Younghun Kwon

Chaos, Solitons & Fractals, 2007, vol. 32, issue 4, 1371-1374

Abstract: It is questionable that Grover algorithm may be more efficient than classical one, when partial information is given in an unstructured database. In this letter, we propose to use the Haar wavelet transformation in the Grover algorithm, to consider partial information. Given a partial information L to an unstructured database of size N, we show the improved speedup, O(N/L). The speedup originates in the preparation of the initial state W†|k〉, which provides a superposition of N/L states and L determines which state has to be chosen as ∣k〉.

Date: 2007
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077905009148
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:32:y:2007:i:4:p:1371-1374

DOI: 10.1016/j.chaos.2005.09.054

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().