Exact Quantum Query Complexity of \text EXACT_k, l^n.
Lecture Notes in Computer Science(2017)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要