Hirotada Kobayashi

According to our database, Hirotada Kobayashi authored at least 30 papers between 2001 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

Generalized Quantum Arthur-Merlin Games.

Hirotada Kobayashi, François Le Gall, Harumichi Nishimura

SIAM J. Comput., 2019

2016

Power of Quantum Computation with Few Clean Qubits.

Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Space-Efficient Error Reduction for Unitary Quantum Computations.

Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete.

Hirotada Kobayashi, François Le Gall, Harumichi Nishimura

SIAM J. Comput., 2015

2014

Impossibility of Classically Simulating One-Clean-Qubit Computation.

Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani

CoRR, 2014

Simpler Exact Leader Election via Quantum Reduction.

Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani

Chic. J. Theor. Comput. Sci., 2014

2012

Exact Quantum Algorithms for the Leader Election Problem.

Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto

ACM Trans. Comput. Theory, 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

Quantum interactive proofs with weak error bounds.

Tsuyoshi Ito, Hirotada Kobayashi, John Watrous

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011

Entangled Games Are Hard to Approximate.

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

SIAM J. Comput., 2011

Constructing quantum network coding schemes from classical nonlinear protocols.

Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Computing on Anonymous Quantum Network

Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani

CoRR, 2010

Perfect quantum network communication protocol based on classical network coding.

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

Proceedings of the IEEE International Symposium on Information Theory, 2010

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

Using Entanglement in Quantum Multi-Prover Interactive Proofs.

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick

Comput. Complex., 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

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

General Scheme for Perfect Quantum Network Coding with Free Classical Communication.

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

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies.

Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008

Quantum measurements for hidden subgroup problems with optimal sample complexity.

Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi

Quantum Inf. Comput., 2008

General Properties of Quantum Zero-Knowledge Proofs.

Hirotada Kobayashi

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems.

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

Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2006

Dihedral Hidden Subgroup Problem: A Survey.

Hirotada Kobayashi, François Le Gall

Inf. Media Technol., 2006

2005

Quantum versus deterministic counter automata.

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

Theor. Comput. Sci., 2005

Universal test for quantum one-way permutations.

Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra

Theor. Comput. Sci., 2005

2003

Quantum multi-prover interactive proof systems with limited prior entanglement.

Hirotada Kobayashi, Keiji Matsumoto

J. Comput. Syst. Sci., 2003

Non-interactive Quantum Perfect and Statistical Zero-Knowledge.

Hirotada Kobayashi

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

One-way probabilistic reversible and quantum one-counter automata.

Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai

Theor. Comput. Sci., 2002

An Analysis of Absorbing Times of Quantum Walks.

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

2001

Quantum Certificate Verification: Single versus Multiple Quantum Certificates

Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami

CoRR, 2001

Two-way Quantum One-counter Automata

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

CoRR, 2001