Access the full text.
Sign up today, get DeepDyve free for 14 days.
V. Korepin (2005)
Optimization of Partial SearchArXiv, abs/quant-ph/0503238
(2006)
Quantum Information Processing 5 1 p
(1998)
Fortsch.Phys
V. Korepin, Lov Grover (2005)
Simple Algorithm for Partial Quantum SearchQuantum Information Processing, 5
Lov Grover (1996)
A fast quantum mechanical algorithm for database search
Charles Bennett, Ethan Bernstein, G. Brassard, U. Vazirani (1997)
Strengths and Weaknesses of Quantum ComputingSIAM J. Comput., 26
V. Korepin, J.E. Liao (2005)
Quest for Fast Partial Search AlgorithmQuantum Information Processing, 5
(2000)
Phys. Rev. A
(1996)
Symp. of Theory of Computing
(2002)
AMS, Contemporary Mathematics Series Millenium Volume 305 p 53 (Preprint quant-ph/0005055
Michel Boyer, G. Brassard, P. Hoeyer, A. Tapp (1996)
Tight bounds on quantum searchingProtein Science, 46
Lov Grover, J. Radhakrishnan (2004)
Is partial quantum search of a database any easier?
Byung-Soo Choi, Thomas Walker, S. Braunstein (2006)
Sure Success Partial SearchQuantum Information Processing, 6
(2005)
ACM Symp. on Parallel Algorithms and Architectures
(2005)
J. Phys. A: Math. Gen
(1997)
SIAM J. Computing
Guo Guang-can (2008)
Quantum Partial Search of a Database with Several Target Items——All the target itemsare asymmetrically divided into two target block
(2006)
Braunstein
We consider unstructured database separated into blocks of equal size. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We present a fast quantum algorithm, which finds one of the target blocks. The algorithm uses the same oracle, which the main Grover algorithm does. We study the simplest case, when each target block has the same number of target items. Our algorithm is based on Boyer, Brassard, Hoyer, and Tapp algorithm of searching database with several target items and on Grover–Radhakrishnan algorithm of partial search. We minimize the number of queries to the oracle. We analyze the algorithm for blocks of large size. In next publications we shall consider more general case when the number of target items is different in different target blocks.
Quantum Information Processing – Springer Journals
Published: Aug 22, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.