Sciweavers

65 search results - page 9 / 13
» Quantum Entanglement and Communication Complexity
Sort
View
ICALP
2007
Springer
14 years 25 days ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 7 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
ISAAC
2007
Springer
105views Algorithms» more  ISAAC 2007»
14 years 25 days ago
Unbounded-Error Classical and Quantum Communication Complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...