11547 search results - page 51 / 2310 » Quantum computing and communication |
138
click to vote
FOCS
2009
IEEE
15 years 10 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...
136
click to vote
DAGSTUHL
2006
15 years 5 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...
155
click to vote
EUROCRYPT
2011
Springer
14 years 7 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...
93
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We demonstrate a two-player communication problem that can be solved in the oneway quantum model by a 0-error protocol of cost O (log n) but requires exponentially more communicat...
121
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...