| GENERAL |
|
|
|
|
Quantum Partial Searching Algorithm of a Database with Several Target Items |
| ZHONG Pu-Cha, BAO Wan-Su, WEI Yun |
| Institute of Electronic Technology, The PLA Information Engineering University, Zhengzhou 450004 |
|
| Cite this article: |
|
ZHONG Pu-Cha, BAO Wan-Su, WEI Yun 2009 Chin. Phys. Lett. 26 020301 |
|
|
|
|
Abstract Choi and Korepin [{Quantum Information Processing} 6(2007)243] presented a quantum partial search algorithm of a database with several target items which can find a target block quickly when each target block contains the same number of target items. Actually, the number of target items in each target block is arbitrary. Aiming at this case, we give a condition to guarantee performance of the partial search algorithm to be performed and the number of queries to oracle of the algorithm to be minimized. In addition, by further numerical computing we come to the conclusion that the more uniform the distribution of target items, the smaller the number of queries.
|
| Keywords:
03.67.Lx
03.67.-a
89.20.Ff
|
|
|
Received: 06 October 2008
Published: 20 January 2009
|
|
| PACS: |
03.67.Lx
|
(Quantum computation architectures and implementations)
|
| |
03.67.-a
|
(Quantum information)
|
| |
89.20.Ff
|
(Computer science and technology)
|
|
|
|
|
|
[1] Grover L K 1996 The 28$^{th$ Annual Symposium onthe Theory of Computing (New York 22--24 May 1996)
[2] Zalka C 1999 Phys. Rev. A 60 2746
[3] Grover L K and Radhakrishnan J 2005 ACM Symp. onParallel Algorithms and Architectures (Las Vegas, Nevada, USA18--25 July 2005)
[4] Korepin V E and Grover L K 2006 Quantum InformationProcessing 5 5
[5] Korepin V E and Liao J F 2006 Quantum InformationProcessing 5 09
[6] Chio B S, Walker T A, Braunstein S L 2006 QuantumInformation Processing 6 1
[7] Choi B S and Korepin V E 2007 Quantum InformationProcessing 6 243 |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
