Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Hirotada
    Last name: Kobayashi
    DBLP: 96/6151
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 50 of 50  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura.
    Space-Efficient Error Reduction for Unitary Quantum Computations.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani.
    Power of Quantum Computation with Few Clean Qubits.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura.
    Space-Efficient Error Reduction for Unitary Quantum Computations.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Simpler Exact Leader Election via Quantum Reduction.
    Chicago J. Theor. Comput. Sci. 2015, Volume 2015 (0) 2015
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete.
    SIAM J. Comput. 2015, Volume 44 (0) 2015
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Generalized Quantum Arthur-Merlin Games.
    30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA 2015 (0) 2015
    Journal article
    Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani.
    Power of Quantum Computation with Few Clean Qubits.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Simpler Exact Leader Election via Quantum Reduction.
    Chicago J. Theor. Comput. Sci. 2014, Volume 2014 (0) 2014
    Conference paper
    Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani.
    Impossibility of Classically Simulating One-Clean-Qubit Computation.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Stronger methods of making quantum interactive proofs perfectly complete.
    Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013 2013 (0) 2013
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Generalized Quantum Arthur-Merlin Games.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Tsuyoshi Ito, Hirotada Kobayashi, John Watrous.
    Quantum interactive proofs with weak error bounds.
    Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8-10, 2012 2012 (0) 2012
    Journal article
    Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto.
    Exact Quantum Algorithms for the Leader Election Problem.
    TOCT 2012, Volume 4 (0) 2012
    Conference paper
    Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, Harumichi Nishimura.
    Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems.
    Quantum Information Computation 2012, Volume 12 (0) 2012
    Journal article
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick.
    Entangled Games Are Hard to Approximate.
    SIAM J. Comput. 2011, Volume 40 (0) 2011
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    Constructing quantum network coding schemes from classical nonlinear protocols.
    2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011 2011 (0) 2011
    Journal article
    Tsuyoshi Ito, Hirotada Kobayashi, John Watrous.
    Quantum interactive proofs with weak error bounds
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    Perfect quantum network communication protocol based on classical network coding.
    IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings 2010 (0) 2010
    Journal article
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Computing on Anonymous Quantum Network
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami.
    Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
    Chicago J. Theor. Comput. Sci. 2009, Volume 2009 (0) 2009
    Conference paper
    Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto.
    Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies.
    Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009 2009 (0) 2009
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    General Scheme for Perfect Quantum Network Coding with Free Classical Communication.
    Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I 2009 (0) 2009
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks.
    Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 2009 (0) 2009
    Conference paper
    Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick.
    Using Entanglement in Quantum Multi-Prover Interactive Proofs.
    Computational Complexity 2009, Volume 18 (0) 2009
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    Perfect Quantum Network Communication Protocol Based on Classical Network Coding
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    General Scheme for Perfect Quantum Network Coding with Free Classical Communication
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi.
    Quantum measurements for hidden subgroup problems with optimal sample complexity.
    Quantum Information Computation 2008, Volume 8 (0) 2008
    Conference paper
    Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick.
    Using Entanglement in Quantum Multi-prover Interactive Proofs.
    Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008 (0) 2008
    Conference paper
    Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao.
    Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems.
    Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008 (0) 2008
    Conference paper
    Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick.
    Entangled Games are Hard to Approximate.
    49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA 2008 (0) 2008
    Conference paper
    Hirotada Kobayashi.
    General Properties of Quantum Zero-Knowledge Proofs.
    Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. 2008 (0) 2008
    Conference paper
    Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto.
    Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto.
    Exact Quantum Algorithms for the Leader Election Problem.
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto.
    Exact Quantum Algorithms for the Leader Election Problem.
    STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra.
    Universal test for quantum one-way permutations.
    Theor. Comput. Sci. 2005, Volume 345 (0) 2005
    Conference paper
    Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai.
    Quantum versus deterministic counter automata.
    Theor. Comput. Sci. 2005, Volume 334 (0) 2005
    Conference paper
    Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra.
    Universal Test for Quantum One-Way Permutations.
    Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Hirotada Kobayashi.
    Non-interactive Quantum Perfect and Statistical Zero-Knowledge.
    Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami.
    Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
    Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto.
    Quantum multi-prover interactive proof systems with limited prior entanglement.
    J. Comput. Syst. Sci. 2003, Volume 66 (0) 2003
    Conference paper
    Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai.
    Quantum versus Deterministic Counter Automata.
    Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto.
    Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement.
    Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai.
    An Analysis of Absorbing Times of Quantum Walks.
    Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai.
    One-way probabilistic reversible and quantum one-counter automata.
    Theor. Comput. Sci. 2002, Volume 289 (0) 2002
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto.
    Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement
    CoRR 2001, Volume 0 (0) 2001
    Conference paper
    Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai.
    Two-way Quantum One-counter Automata
    CoRR 2001, Volume 0 (0) 2001
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami.
    Quantum Certificate Verification: Single versus Multiple Quantum Certificates
    CoRR 2001, Volume 0 (0) 2001
    Conference paper
    Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai.
    One-Way Probabilistic Reversible and Quantum One-Counter Automata.
    Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings 2000 (0) 2000
    Show item 1 to 50 of 50  

    Your query returned 50 matches in the database.