508 search results - page 15 / 102 » Poly-locality in quantum computing |
EUROCRYPT
2005
Springer
14 years 2 months ago
2005
Springer
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
FOCS
2004
IEEE
14 years 10 days ago
2004
IEEE
STOC
1993
ACM
14 years 20 days ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...