An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract)


This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target keyword in an ordered list of the ith block. Apart from much studied polynomial and adversary methods for quantum… (More)
DOI: 10.1007/978-3-540-28629-5_65


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics