Hirotada Kobayashi

51 papers A* 4A 7B 7Misc 2Journal 29Unranked 2

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