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 25 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
    Show item 1 to 25 of 50  

    Your query returned 50 matches in the database.