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...

Ful tanımlama

Detaylı Bibliyografya

Yayımlandı:	Journal of the ACM 48, 4 (2001).
Yazar:	Beals, Robert
Materyal Türü:	Makale
Dil:	İngilizce
Konular:	Theory of computation. Computation by abstract devices. Models of computation. Analysis of algorithms and problem complexity. Algorithms. Performance. Theory.