/Quantum lower bounds by polynomials (via Qpute.com)
Quantum lower bounds by polynomials

Quantum lower bounds by polynomials (via Qpute.com)


We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions (i.e. problems involving a promise on the input) by Deutsch and Jozsa and by Simon cannot be obtained for any total function: if a quantum algorithm computes some total Boolean function f with bounded-error using T black-box queries then there is a… CONTINUE READING


This is a syndicated post. Read the original post at Source link .