508 search results - page 14 / 102 » Quantum Computers |
ASPLOS
2006
ACM
14 years 3 months ago
2006
ACM
Quantum computing’s power comes from new algorithms that exploit quantum mechanical phenomena for computation. Quantum algorithms are different from...
ISCA
2006
IEEE
14 years 3 months ago
2006
IEEE
We show that the problem of communication in a quantum computer reduces to constructing reliable quantum channels by distributing high-fidelity EPR pairs. We develop analytical m...
CORR
2011
Springer
13 years 4 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...
STOC
1993
ACM
14 years 1 months 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...
EUROCRYPT
2000
Springer
14 years 1 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...