700 search results - page 48 / 140 » An Introduction to Quantum Computing |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
DAGSTUHL
2006
13 years 9 months ago
2006
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...
EUROCRYPT
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
COMPUTING
1999
13 years 7 months ago
1999
