Publications
Search

Publications :: Search

Show author

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

    Author information
    First name: Harumichi
    Last name: Nishimura
    DBLP: 02/5630
    Rating: (not rated yet)
    Bookmark:

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

    Show item 1 to 25 of 74  
    Select a publication
    Show Title Venue Rating Date
    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
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).
    Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation
    CoRR 2003, Volume 0 (0) 2003
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Application of Quantum Finite Automata to Interactive Proof Systems
    CoRR 2004, Volume 0 (0) 2004
    Conference paper
    Tomoyuki Yamakami, Harumichi Nishimura.
    An Application of Quantum Finite Automata to Interactive Proof Systems
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An application of quantum finite automata to interactive proof systems.
    J. Comput. Syst. Sci. 2009, Volume 75 (0) 2009
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Application of Quantum Finite Automata to Interactive Proof Systems.
    Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers 2004 (0) 2004
    Conference paper
    Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita.
    Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Harumichi Nishimura, Masanao Ozawa.
    Computational complexity of uniform quantum circuit families and quantum Turing machines.
    Theor. Comput. Sci. 2002, Volume 276 (0) 2002
    Conference paper
    Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami.
    Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
    J. Cryptology 2012, Volume 25 (0) 2012
    Conference paper
    Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami.
    Computational Indistinguishability between Quantum States and Its Cryptographic Application.
    IACR Cryptology ePrint Archive 2006, Volume 2006 (0) 2006
    Conference paper
    Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami.
    Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
    Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings 2005 (0) 2005
    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.
    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
    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
    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, 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
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Generalized Quantum Arthur-Merlin Games.
    CoRR 2013, Volume 0 (0) 2013
    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
    Journal article
    Harumichi Nishimura, Tomoyuki Yamakami.
    Interactive proofs with quantum finite automata.
    Theor. Comput. Sci. 2015, Volume 568 (0) 2015
    Journal article
    Harumichi Nishimura, Tomoyuki Yamakami.
    Interactive Proofs with Quantum Finite Automata.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Masanao Ozawa, Harumichi Nishimura.
    Local transition functions of quantum Turing machines.
    ITA 2000, Volume 34 (0) 2000
    Conference paper
    Tomoyuki Morimae, Harumichi Nishimura.
    Merlinization of complexity classes above BQP.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Tomoyuki Morimae, Harumichi Nishimura, François Le Gall.
    Modified group non-membership is in AWPP.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Tomoyuki Morimae, Harumichi Nishimura, François Le Gall.
    Modified Group Non-Membership is in Promise-AWPP relative to group oracles.
    Quantum Information Computation 2017, Volume 17 (0) 2017
    Show item 1 to 25 of 74  

    Your query returned 74 matches in the database.