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 74 of 74  
    Select a publication
    Show Title Venue Rating Date
    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
    Conference paper
    Tomoyuki Morimae, Harumichi Nishimura.
    Merlinization of complexity classes above BQP.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    François Le Gall, Harumichi Nishimura.
    Quantum Algorithms for Matrix Products over Semirings.
    Chicago J. Theor. Comput. Sci. 2017, Volume 2017 (0) 2017
    Conference paper
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum algorithms for finding constant-sized sub-hypergraphs.
    Theor. Comput. Sci. 2016, Volume 609 (0) 2016
    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.
    Quantum interpretations of AWPP and APP.
    Quantum Information Computation 2016, Volume 16 (0) 2016
    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
    Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura.
    Quantum Merlin-Arthur with noisy channel.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Raymond H. Putra, Seiichiro Tani, Shigeru Yamashita.
    Quantum Query Complexity of Almost All Functions with Fixed On-set Size.
    Computational Complexity 2016, Volume 25 (0) 2016
    Conference paper
    Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura.
    Power of one non-clean qubit.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Harumichi Nishimura, Tomoyuki Yamakami.
    Interactive proofs with quantum finite automata.
    Theor. Comput. Sci. 2015, Volume 568 (0) 2015
    Journal article
    Tomoyuki Morimae, Harumichi Nishimura.
    Power of quantum computing with restricted postselections.
    CoRR 2015, Volume 0 (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
    Tomoyuki Morimae, Masahito Hayashi, Harumichi Nishimura, Keisuke Fujii.
    Quantum Merlin-Arthur with Clifford Arthur.
    Quantum Information Computation 2015, Volume 15 (0) 2015
    Journal article
    Harumichi Nishimura, Tomoyuki Yamakami.
    Interactive Proofs with Quantum Finite Automata.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    François Le Gall, Harumichi Nishimura.
    Quantum Algorithms for Matrix Products over Semirings.
    Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings 2014 (0) 2014
    Conference paper
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs.
    Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Harumichi Nishimura.
    Quantum network coding and the current status of its studies.
    International Symposium on Information Theory and its Applications, ISITA 2014, Melbourne, Australia, October 26-29, 2014 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
    Journal article
    François Le Gall, Harumichi Nishimura.
    Quantum Algorithms for Matrix Products over Semirings.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs.
    CoRR 2013, Volume 0 (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
    Kazuo Iwama, Harumichi Nishimura.
    Recovering Strings in Oracles: Quantum and Classic.
    Int. J. Found. Comput. Sci. 2013, Volume 24 (0) 2013
    Conference paper
    Harumichi Nishimura.
    Quantum network coding - How can network coding be applied to quantum information?
    International Symposium on Network Coding, NetCod 2013, Calgary, AB, Canada, June 7-9, 2013 2013 (0) 2013
    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
    Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita.
    Reconstructing Strings from Substrings with Quantum Queries.
    Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings 2012 (0) 2012
    Conference paper
    François Le Gall, Shota Nakagawa, Harumichi Nishimura.
    On QMA protocols with two short quantum proofs.
    Quantum Information Computation 2012, Volume 12 (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
    Conference paper
    Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita.
    Reconstructing Strings from Substrings with Quantum Queries
    CoRR 2012, Volume 0 (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
    Journal article
    Kazuo Iwama, Harumichi Nishimura, Raymond H. Putra, Junichi Teruyama.
    Quantum counterfeit coin problems.
    Theor. Comput. Sci. 2012, Volume 456 (0) 2012
    Conference paper
    Ashley Montanaro, Harumichi Nishimura, Rudy Raymond.
    Unbounded-error quantum query complexity.
    Theor. Comput. Sci. 2011, Volume 412 (0) 2011
    Journal article
    François Le Gall, Shota Nakagawa, Harumichi Nishimura.
    On QMA Protocols with Two Short Quantum Proofs
    CoRR 2011, Volume 0 (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
    Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama.
    Quantum Counterfeit Coin Problems
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama.
    Quantum Counterfeit Coin Problems.
    Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I 2010 (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
    Harumichi Nishimura, Masanao Ozawa.
    Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families.
    Quantum Information Processing 2009, Volume 8 (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, 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
    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, Rudy Raymond.
    Quantum Random Access Coding.
    IEICE Transactions 2009, Volume 92 (0) 2009
    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
    Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita.
    Polynomial-Time Construction of Linear Network Coding.
    Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games 2008 (0) 2008
    Conference paper
    Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita.
    Quantum Query Complexity of Boolean Functions with Small On-Sets.
    Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Ashley Montanaro, Harumichi Nishimura, Rudy Raymond.
    Unbounded-Error Quantum Query Complexity.
    Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita.
    Unbounded-Error One-Way Classical and Quantum Communication Complexity.
    Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita.
    Unbounded-Error Classical and Quantum Communication Complexity.
    Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Raymond H. Putra, Shigeru Yamashita.
    Quantum Network Coding.
    STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings 2007 (0) 2007
    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
    Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita.
    Quantum Network Coding.
    Complexity of Boolean Functions, 12.03. - 17.03.2006 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
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks
    CoRR 2005, Volume 0 (0) 2005
    Conference paper
    Harumichi Nishimura, Masanao Ozawa.
    Uniformity of quantum circuit families for error-free algorithms.
    Theor. Comput. Sci. 2005, Volume 332 (0) 2005
    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 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
    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.
    Polynomial time quantum computation with advice.
    Inf. Process. Lett. 2004, Volume 90 (0) 2004
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    Polynomial time quantum computation with advice
    CoRR 2003, Volume 0 (0) 2003
    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.
    Polynomial time quantum computation with advice
    Electronic Colloquium on Computational Complexity (ECCC) 2003, Volume 10 (0) 2003
    Conference paper
    Harumichi Nishimura.
    Quantum Computation With Restricted Amplitudes.
    Int. J. Found. Comput. Sci. 2003, Volume 14 (0) 2003
    Journal article
    Elham Kashefi, Harumichi Nishimura, Vlatko Vedral.
    On quantum one-way permutations.
    Quantum Information Computation 2002, Volume 2 (0) 2002
    Conference paper
    Harumichi Nishimura.
    On Quantum Computation with Some Restricted Amplitudes.
    STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings 2002 (0) 2002
    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
    Masanao Ozawa, Harumichi Nishimura.
    Local transition functions of quantum Turing machines.
    ITA 2000, Volume 34 (0) 2000
    Show item 1 to 74 of 74  

    Your query returned 74 matches in the database.