Journal
SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE
Volume 10139, Issue -, Pages 243-255Publisher
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1007/978-3-319-51963-0_19
Keywords
-
Categories
Funding
- ERC Advanced Grant MQC
- Latvian State Research Programme NexIT Project [1]
- EU FP7 project QALGO
- People Programme (Marie Curie Actions) EU's 7th Framework Programme under REA grant [609427]
- Slovak Academy of Sciences
- Slovak Research and Development Agency [APVV-14-0878 QETWORK]
Ask authors/readers for more resources
In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly k or 1 of the n input bits given by an oracle are 1. We find an optimal algorithm (for some cases), and a nontrivial general lower and upper bound on the minimum number of queries to the black box.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
