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, which is a natural generalization of the ordered search problem. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our argument shows that the multiple-block ordered search needs a large number of nonadaptive oracle queries on a black-box model of quantum computation that is also supplemented with advice. Our argument is also applied to the notions of computational complexity theory: quantum truth-table reducibility and quantum truth-table autoreducibility. © Springer-Verlag 2004.
CITATION STYLE
Nishimura, H., & Yamakami, T. (2004). An algorithmic argument for nonadaptive query complexity lower bounds on advised quantum computation (extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3153, 827–838. https://doi.org/10.1007/978-3-540-28629-5_65
Mendeley helps you to discover research relevant for your work.