Quantum Query Complexity for Some Graph Problems
The paper  by H. Buhrman and R. de Wolf contains an impressive survey of solved and open problems in quantum query complexity, including many graph problems. We use recent results by A.Ambainis  to prove higher lower bounds for some of these problems. Some of our new lower bounds do not close the gap between the best upper and lower bounds. We prove in these cases that it is impossible to provide a better application of Ambainis’ technique for these problems.
Unable to display preview. Download preview PDF.
- 2.Ambainis, A.: Personal communication (2003)Google Scholar
- 6.Grover, L.: A Fast Quantum Mechanical Algorithm for Database Search. In: Proceedings of the 28th ACM symposium on Theory of Computing, pp. 212–219 (1996)Google Scholar
- 7.Gruska, J.: Quantum Computing. McGraw-Hill, New York (1999)Google Scholar