STACS
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...