6533b7d4fe1ef96bd1261d11

RESEARCH PRODUCT

Quantum Query Complexity for Some Graph Problems

Oksana ScegulnajaLelde LaceAndrej DubrovskyRusins FreivaldsAija Berzina

subject

CombinatoricsQuantum queryGraph (abstract data type)Computer Science::Computational ComplexityUpper and lower boundsMathematics

description

The paper [4] 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 [1] 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.

yearjournalcountryeditionlanguage
2004-01-01
https://doi.org/10.1007/978-3-540-24618-3_11