Referenced Items are not available for this document.
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hoyer, and Tapp (1998), and imply an O(N3/4 log N) quantum upper bound for the element distinctness problem in the comparison complexity model. This contrasts with Θ(N log N) classical complexity. We also prove a lower bound of Ω(√N) comparisons for this problem and derive bounds for a number of related problems
Published in:
Computational Complexity, 16th Annual IEEE Conference on, 2001.
Date of Conference: 2001
- Page(s):
- 131 - 137
- Meeting Date :
- 18 Jun 2001-21 Jun 2001
- Print ISBN:
- 0-7695-1053-1
- INSPEC Accession Number:
- 6998452
- Conference Location :
- Chicago, IL
- Digital Object Identifier :
- 10.1109/CCC.2001.933880
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
