Hirotada Kobayashi

Publication Activity (10 Years)

Years Active: 2000-2019
Publications (10 Years): 4

Top Topics

Nash Equilibria

Quantum Computation

Error Reduction

Top Venues

SIAM J. Comput.

Chic. J. Theor. Comput. Sci.

Publications

Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Generalized Quantum Arthur-Merlin Games. SIAM J. Comput. 48 (3) (2019)
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
Space-Efficient Error Reduction for Unitary Quantum Computations. ICALP (2016)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Power of Quantum Computation with Few Clean Qubits. ICALP (2016)
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
Space-Efficient Error Reduction for Unitary Quantum Computations. CoRR (2016)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Generalized Quantum Arthur-Merlin Games. Computational Complexity Conference (2015)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Power of Quantum Computation with Few Clean Qubits. CoRR (2015)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. SIAM J. Comput. 44 (2) (2015)
Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
Simpler Exact Leader Election via Quantum Reduction. Chic. J. Theor. Comput. Sci. 2014 (2014)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Impossibility of Classically Simulating One-Clean-Qubit Computation. CoRR (2014)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Generalized Quantum Arthur-Merlin Games. CoRR (2013)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Stronger methods of making quantum interactive proofs perfectly complete. ITCS (2013)
Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, Harumichi Nishimura
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. Quantum Inf. Comput. 12 (5-6) (2012)
Tsuyoshi Ito, Hirotada Kobayashi, John Watrous
Quantum interactive proofs with weak error bounds. ITCS (2012)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete CoRR (2012)
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto
Exact Quantum Algorithms for the Leader Election Problem. ACM Trans. Comput. Theory 4 (1) (2012)
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick
Entangled Games Are Hard to Approximate. SIAM J. Comput. 40 (3) (2011)
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler
Constructing quantum network coding schemes from classical nonlinear protocols. ISIT (2011)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
Perfect quantum network communication protocol based on classical network coding. ISIT (2010)
Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
Computing on Anonymous Quantum Network CoRR (2010)
Tsuyoshi Ito, Hirotada Kobayashi, John Watrous
Quantum interactive proofs with weak error bounds CoRR (2010)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Roetteler
Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols CoRR (2010)
Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. PODC (2009)
Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. Computational Complexity Conference (2009)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
General Scheme for Perfect Quantum Network Coding with Free Classical Communication CoRR (2009)
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
Using Entanglement in Quantum Multi-Prover Interactive Proofs. Comput. Complex. 18 (2) (2009)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
Perfect Quantum Network Communication Protocol Based on Classical Network Coding CoRR (2009)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. ICALP (1) (2009)
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? Chic. J. Theor. Comput. Sci. 2009 (2009)
Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi
Quantum measurements for hidden subgroup problems with optimal sample complexity. Quantum Inf. Comput. 8 (3) (2008)
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick
Entangled Games are Hard to Approximate. FOCS (2008)
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
Using Entanglement in Quantum Multi-prover Interactive Proofs. Computational Complexity Conference (2008)
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. Computational Complexity Conference (2008)
Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies CoRR (2008)
Hirotada Kobayashi
General Properties of Quantum Zero-Knowledge Proofs. TCC (2008)
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto
Exact Quantum Algorithms for the Leader Election Problem. CoRR (2007)
Hirotada Kobayashi, François Le Gall
Dihedral Hidden Subgroup Problem: A Survey. Inf. Media Technol. 1 (1) (2006)
Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra
Universal test for quantum one-way permutations. Theor. Comput. Sci. 345 (2-3) (2005)
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto
Exact Quantum Algorithms for the Leader Election Problem. STACS (2005)
Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
Quantum versus deterministic counter automata. Theor. Comput. Sci. 334 (1-3) (2005)
Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra
Universal Test for Quantum One-Way Permutations. MFCS (2004)
Hirotada Kobayashi, Keiji Matsumoto
Quantum multi-prover interactive proof systems with limited prior entanglement. J. Comput. Syst. Sci. 66 (3) (2003)
Hirotada Kobayashi
Non-interactive Quantum Perfect and Statistical Zero-Knowledge. ISAAC (2003)
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? ISAAC (2003)
Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
Quantum versus Deterministic Counter Automata. COCOON (2002)
Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
An Analysis of Absorbing Times of Quantum Walks. UMC (2002)
Hirotada Kobayashi, Keiji Matsumoto
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. ISAAC (2002)
Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
One-way probabilistic reversible and quantum one-counter automata. Theor. Comput. Sci. 289 (2) (2002)
Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
Two-way Quantum One-counter Automata CoRR (2001)
Hirotada Kobayashi, Keiji Matsumoto
Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement CoRR (2001)
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
Quantum Certificate Verification: Single versus Multiple Quantum Certificates CoRR (2001)
Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
One-Way Probabilistic Reversible and Quantum One-Counter Automata. COCOON (2000)