5 search results - page 1 / 1 » Power, Puzzles and Properties of Entanglement |
MCU
2001
13 years 8 months ago
2001
COCO
2004
Springer
14 years 22 days ago
2004
Springer
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...
ACSAC
2009
IEEE
14 years 14 days ago
2009
IEEE
Abstract—Various cryptographic puzzle schemes are proposed as a defense mechanism against denial of service attack. But, all these puzzle schemes face a dilemma when there is a l...
STOC
2006
ACM
14 years 1 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
FLOPS
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...