142 citations
- IBM Research - TokyoJP3 papers
- Kyoto UniversityJP3 papers
- Nara Institute of Science and TechnologyJP2 papers
- Osaka Prefecture UniversityJP2 papers
- Japan Science and Technology AgencyJP1 paper
- Nagoya UniversityJP1 paper
- NTT (Japan)JP1 paper
- Ritsumeikan UniversityJP1 paper
- UL Institute of Mathematics and Computer ScienceLV1 paper
- University of LatviaLV1 paper
- Yamagata UniversityJP1 paper
3 papers
quant-ph2009★ 3 cited
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi +4
This paper considers the query complexity of the functions in the family F_{N,M} of N-variable Boolean functions with onset size M, i.e., the number of inputs for which the functio…
quant-ph2007★ 6 cited
Unbounded-Error Classical and Quantum Communication Complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond +1
Since the seminal work of Paturi and Simon \cite[FOCS'84 & JCSS'86]{PS86}, the unbounded-error classical communication complexity of a Boolean function has been studied based on th…
quant-ph2006★ 142 cited
Quantum Network Coding
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura +2
Since quantum information is continuous, its handling is sometimes surprisingly harder than the classical counterpart. A typical example is cloning; making a copy of digital inform…