abstraction and quantum computation Alessandra Di Pierro1 Dipartimento di Informatica University of Pisa Pisa, Italy Herbert Wiklicky2 Department of Computing Imperial College Lond...
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
It has been said that quantum cryptography in general o ers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, ...
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...