Referenced Items are not available for this document.
We present a quantum algorithm solving the k-distinctness problem in a less number of queries than the previous algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler.
Published in:
Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on
Date of Conference: 20-23 Oct. 2012
- Page(s):
- 207 - 216
- ISSN :
- 0272-5428
- Print ISBN:
- 978-1-4673-4383-1
- INSPEC Accession Number:
- 13171390
- Conference Location :
- New Brunswick, NJ
- Digital Object Identifier :
- 10.1109/FOCS.2012.18
- 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.
