Sciweavers

20831 search results - page 25 / 4167
» Quantum Computation and Information
Sort
View
EUROCRYPT
2005
Springer
14 years 2 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
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...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
11 years 11 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
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...
François Le Gall
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
14 years 21 days ago
Quantum complexity theory
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...
Ethan Bernstein, Umesh V. Vazirani
UC
2007
Springer
14 years 2 months ago
Taming Non-compositionality Using New Binders
We propose an extension of the traditional λ-calculus in which terms are used to control an outside computing device (quantum computer, DNA computer...). We introduce two new bind...
Frédéric Prost