Paper Info
Title
Exact Quantum Query Complexity of \text EXACT_k, l^n.
Abstract
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.
Year
DOI
Venue
2017
10.1007/978-3-319-51963-0_19
Lecture Notes in Computer Science
Field
DocType
Volume
Quantum,Discrete mathematics,Combinatorics,Upper and lower bounds,Oracle,Black box,Mathematics
Conference
10139
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
7
3
Name
Order
Citations
PageRank
Andris Ambainis12000183.24
Janis Iraids2186.14
Daniel Nagaj3575.84