Hirotada Kobayashi

Last updated: 09/10/28 17:58

Name	Hirotada Kobayashi
e-mail	hirotadanii.ac.jp
Affiliation	National Institute of Informatics
Section	Principles of Informatics Research Division
Degree	PhD in science

Research keyword

quantum computing(2) , interactive proof systems(1) , quantum algorithms(1) , entanglement(1) , quantum information theory(2) , theoretical cryptology(1) , quantum cryptography(1) , hidden subgroup problems(1)

Research area

Informatics / Fundamental theory of informatics(32) /

Career

Plain Text

Apr 2005

Researcher, National Institute of Informatics

Apr 2002

Mar 2005

Researcher, Quantum Computation and Information Project, Exploratory Research for Advanced Technology, Japan Science and Technology Agency

Papers

Plain Text

Orcacularization and two-prover one-round interactive proofs against non-local strategies

Tsuyoshi Ito, Hirotada Kobayashi, and Keiji Matsumoto

24th Annual IEEE Conference on Computational Complexity 217-228 Jul 2009 [Refereed]

General scheme for perfect quantum network coding with free classical communication

Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, and Martin Rötteler

Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Part I 622-633 Jul 2009 [Refereed]

Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur?

Hirotada Kobayashi, Keiji Matsumoto, and Tomoyuki Yamakami

Chicago Journal of Theoretical Computer Science Jul 2009 [Refereed]

Using entanglement in quantum multi-prover interactive proofs

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, and Thomas Vidick

Computational Complexity 18(2) 273-307 2009 [Refereed]

Entangled games are hard to approximate

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, and Thomas Vidick

49th Annual Symposium on Foundations of Computer Science 447-456 Oct 2008 [Refereed]

Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems

Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, and Andrew Chi-Chih Yao

23rd Annual IEEE Conference on Computational Complexity 187-198 Jun 2008 [Refereed]

General properties of quantum zero-knowledge proofs

Hirotada Kobayashi

Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008 107-124 Mar 2008 [Refereed]

Quantum multi-prover interactive proof systems with limited prior entanglement

Hirotada Kobayashi and Keiji Matsumoto

Journal of Computer and System Sciences 66(3) 429-450 2003 [Refereed]

Conference

Plain Text

Entanglement and multi-prover interactive proofs [Invited]

Hirotada Kobayashi

The 3rd Workshop on Theory of Quantum Computation, Communication, and Cryptography Jan 2008

Interactive proof systems and quantum computation [Invited]

Hirotada Kobayashi

ERATO conference on Quantum Information Science 2004 Sep 2004

Academic society

IACR(2) , SIAM(2) , IEEE(52) , ACM(20)