Exact quantum query complexity for total Boolean functions
Quantum Physics
2007-05-23 v2
Abstract
We will show that if there exists a quantum query algorithm that exactly computes some total Boolean function f by making T queries, then there is a classical deterministic algorithm A that exactly computes f making O(T^3) queries. The best know bound previously was O(T^4) due to Beals et al.
Keywords
Cite
@article{arxiv.quant-ph/0403168,
title = {Exact quantum query complexity for total Boolean functions},
author = {Gatis Midrijanis},
journal= {arXiv preprint arXiv:quant-ph/0403168},
year = {2007}
}
Comments
5 pages, corrected grammar, some comments added