17 citations
4 papers · 1 filter
Unbounded-error One-way Classical and Quantum Communication Complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond +1
This paper studies the gap between quantum one-way communication complexity and its classical counterpart , under the {\em unbounded-error} setting, i.e., it is enough…
Quantum Network Coding for General Graphs
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond +1
Network coding is often explained by using a small network model called Butterfly. In this network, there are two flow paths, s_1 to t_1 and s_2 to t_2, which share a single bottle…
(4,1)-Quantum Random Access Coding Does Not Exist
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura +2
An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis, Nayak, Ta-shma and Vazirani in ACM Symp. on Theory of Computing 1999, is the following communication system:…
Robust Quantum Algorithms for Oracle Identification
Andris Ambainis, Kazuo Iwama, Akinori Kawachi +2
The oracle identification problem (OIP) was introduced by Ambainis et al. \cite{AIKMRY04}. It is given as a set of oracles and a blackbox oracle . Our task is to figure…