Quantum lower bounds by polynomials.

We examine the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1}N in the black-box model. We show that the exponential quantum speed-up obtained for partial functions (i.e., problems involving a promise on the input) by Deutsch and Jozsa, Si...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the ACM 48, 4 (2001).
1. Verfasser:	Beals, Robert
Format:	Artikel
Sprache:	English
Schlagworte:	Theory of computation. Computation by abstract devices. Models of computation. Analysis of algorithms and problem complexity. Algorithms. Performance. Theory.