• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Quantum Algorithms for Element Distinctness (2001)

Cached

  • Download as a PDF

Download Links

  • [www.lri.fr]
  • [www.liafa.jussieu.fr]
  • [www.liafa.univ-paris-diderot.fr]
  • [www.liafa.jussieu.fr]
  • [www.liafa.univ-paris-diderot.fr]
  • [www.brics.dk]
  • [www.cwi.nl]
  • [homepages.cwi.nl]
  • [homepages.cwi.nl]
  • [www.lri.fr]
  • [www.liafa.jussieu.fr]
  • [www.liafa.jussieu.fr]
  • [www.liafa.univ-paris-diderot.fr]
  • [www.cpsc.ucalgary.ca]
  • [www.lri.fr]
  • [www.liafa.jussieu.fr]
  • [www.liafa.univ-paris-diderot.fr]
  • [www.liafa.jussieu.fr]
  • [www.liafa.univ-paris-diderot.fr]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Harry Buhrman , Christoph Dürr , Mark Heiligman , Peter Høyer , Frédéric Magniez , Miklos Santha , Ronald Wolf
Venue:SIAM Journal of Computing
Citations:74 - 9 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Buhrman01quantumalgorithms,
    author = {Harry Buhrman and Christoph Dürr and Mark Heiligman and Peter Høyer and Frédéric Magniez and Miklos Santha and Ronald Wolf},
    title = {Quantum Algorithms for Element Distinctness},
    booktitle = {SIAM Journal of Computing},
    year = {2001},
    pages = {131--137}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an O(N 3/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. 1

Keyphrases

quantum algorithm    element distinctness    present several application    quantum amplitude amplification    comparison complexity model    derive bound    element distinctness problem    unordered function    upper bound    related problem    classical complexity   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University