65 search results - page 10 / 13 » Quantum Entanglement and Communication Complexity |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
SIAMCOMP
2008
13 years 6 months ago
2008
FOCS
2003
IEEE
13 years 12 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
COCO
2008
Springer
13 years 8 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
COCOON
2005
Springer
14 years 3 days ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...