Exact Quantum Search By Parallel Unitary Discrimination Schemes

Amer Physical Soc
Publication Type:
Journal Article
Physical Review A, 2008, 78 (1), pp. 1 - 8
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2008004783OK.pdf189.87 kB
Adobe PDF
We study the unsorted database search problem with items N from the viewpoint of unitary discrimination. Instead of considering the famous O(root N) Grover bounded-error algorithm for the original problem, we seek the results for the exact algorithms, i.
Please use this identifier to cite or link to this item: