Two-way Quantum One-counter Automata - Tomohiro Yamasaki; Hirotada Kobayashi; Hiroshi Imai (CoRR, 2001)

Quantum Certificate Verification: Single versus Multiple Quantum Certificates - Hirotada Kobayashi; Keiji Matsumoto; Tomoyuki Yamakami (CoRR, 2001)

An Analysis of Absorbing Times of Quantum Walks. - Tomohiro Yamasaki; Hirotada Kobayashi; Hiroshi Imai (UMC, 2002)

One-way probabilistic reversible and quantum one-counter automata. - Tomohiro Yamasaki; Hirotada Kobayashi; Yuuki Tokunaga; Hiroshi Imai (Theor. Comput. Sci., 2002)

Non-interactive Quantum Perfect and Statistical Zero-Knowledge. - Hirotada Kobayashi (ISAAC, 2003)

Quantum multi-prover interactive proof systems with limited prior entanglement. - Hirotada Kobayashi; Keiji Matsumoto (J. Comput. Syst. Sci., 2003)

Universal test for quantum one-way permutations. - Akinori Kawachi; Hirotada Kobayashi; Takeshi Koshiba; Raymond H. Putra (Theor. Comput. Sci., 2005)

Quantum versus deterministic counter automata. - Tomohiro Yamasaki; Hirotada Kobayashi; Hiroshi Imai (Theor. Comput. Sci., 2005)

Dihedral Hidden Subgroup Problem: A Survey. - Hirotada Kobayashi; François Le Gall (Inf. Media Technol., 2006)

Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. - Tsuyoshi Ito; Hirotada Kobayashi; Daniel Preda; Xiaoming Sun 001; Andrew Chi-Chih Yao (CCC, 2008)

General Properties of Quantum Zero-Knowledge Proofs. - Hirotada Kobayashi (TCC, 2008)

Quantum measurements for hidden subgroup problems with optimal sample complexity. - Masahito Hayashi; Akinori Kawachi; Hirotada Kobayashi (Quantum Inf. Comput., 2008)

Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. - Tsuyoshi Ito; Hirotada Kobayashi; Keiji Matsumoto (CCC, 2009)

General Scheme for Perfect Quantum Network Coding with Free Classical Communication. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura; Martin Rötteler (ICALP (1), 2009)

Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. - Hirotada Kobayashi; Keiji Matsumoto; Seiichiro Tani (PODC, 2009)

Using Entanglement in Quantum Multi-Prover Interactive Proofs. - Julia Kempe; Hirotada Kobayashi; Keiji Matsumoto; Thomas Vidick (Comput. Complex., 2009)

Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? - Hirotada Kobayashi; Keiji Matsumoto; Tomoyuki Yamakami (Chic. J. Theor. Comput. Sci., 2009)

Perfect quantum network communication protocol based on classical network coding. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura; Martin Rötteler (ISIT, 2010)

Computing on Anonymous Quantum Network - Hirotada Kobayashi; Keiji Matsumoto; Seiichiro Tani (CoRR, 2010)

Constructing quantum network coding schemes from classical nonlinear protocols. - Hirotada Kobayashi; Francois Le Gall; Harumichi Nishimura; Martin Rötteler (ISIT, 2011)

Entangled Games Are Hard to Approximate. - Julia Kempe; Hirotada Kobayashi; Keiji Matsumoto; Ben Toner; Thomas Vidick (SIAM J. Comput., 2011)

Quantum interactive proofs with weak error bounds. - Tsuyoshi Ito; Hirotada Kobayashi; John Watrous (ITCS, 2012)

Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. - Stephen P. Jordan; Hirotada Kobayashi; Daniel Nagaj; Harumichi Nishimura (Quantum Inf. Comput., 2012)

Exact Quantum Algorithms for the Leader Election Problem. - Seiichiro Tani; Hirotada Kobayashi; Keiji Matsumoto (ACM Trans. Comput. Theory, 2012)

Simpler Exact Leader Election via Quantum Reduction. - Hirotada Kobayashi; Keiji Matsumoto; Seiichiro Tani (Chic. J. Theor. Comput. Sci., 2014)

Impossibility of Classically Simulating One-Clean-Qubit Computation. - Keisuke Fujii 002; Hirotada Kobayashi; Tomoyuki Morimae; Harumichi Nishimura; Shuhei Tamate; Seiichiro Tani (CoRR, 2014)

Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura (SIAM J. Comput., 2015)

Space-Efficient Error Reduction for Unitary Quantum Computations. - Bill Fefferman; Hirotada Kobayashi; Cedric Yen-Yu Lin; Tomoyuki Morimae; Harumichi Nishimura (ICALP, 2016)

Power of Quantum Computation with Few Clean Qubits. - Keisuke Fujii 002; Hirotada Kobayashi; Tomoyuki Morimae; Harumichi Nishimura; Shuhei Tamate; Seiichiro Tani (ICALP, 2016)

Generalized Quantum Arthur-Merlin Games. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura (SIAM J. Comput., 2019)