Harumichi Nishimura

School of Science, Osaka Prefecture University, Japan

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers72 papers

Sort

By YearBy Citation

Brief Announcement - Distributed Quantum Proofs for Replicated Data

Pierre Fraigniaud,François Le Gall,Harumichi Nishimura,Ami Paz

DISC, (2020)

EIBibtex

Impossibility of blind quantum sampling for classical client

Tomoyuki Morimae,Harumichi Nishimura, Yuki Takeuchi,Seiichiro Tani

Quantum Information & Computation, (2019)

EIBibtex

Quantum Advantage for the LOCAL Model in Distributed Computing

François Le Gall,Harumichi Nishimura,Ansis Rosmanis

STACS, (2019)

Cited by9EIBibtex

Generalized Quantum Arthur--Merlin Games

Hirotada Kobayashi,François Le Gall,Harumichi Nishimura

SIAM Journal on Computing, no. 3 (2019): 865-902

Cited by5Bibtex

Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error

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

Physical review letters, no. 20 (2018): 200502

Cited by36WOSBibtex

Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy

Tomoyuki Morimae,Yuki Takeuchi,Harumichi Nishimura

Quantum, (2018): 106

Bibtex

Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy

Tomoyuki Morimae,Yuki Takeuchi,Harumichi Nishimura

arXiv: Quantum Physics, (2017)

Cited by2EIBibtex

Merlinization of complexity classes above BQP

Tomoyuki Morimae,Harumichi Nishimura

Quantum Information & Computation, no. 11&12 (2017): 959-972

Cited by1EIBibtex

Modified Group Non-Membership is in Promise-AWPP relative to group oracles

Tomoyuki Morimae,Harumichi Nishimura,Francois Le Gall

Quantum Information & Computation, no. 3&4 (2017): 242-250

EIBibtex

Quantum Algorithms for Matrix Products over Semirings

François Le Gall,Harumichi Nishimura

Chicago J. Theor. Comput. Sci., (2017)

Cited by3EIBibtex

Quantum Query Complexity of Almost All Functions with Fixed On-set Size

Andris Ambainis,Kazuo Iwama,Masaki Nakanishi,Harumichi Nishimura,Rudy Raymond,Seiichiro Tani,Shigeru Yamashita

Computational Complexity, no. 4 (2016): 723-735

EIBibtex

Generalized Quantum Arthur-Merlin Games

Hirotada Kobayashi,François Le Gall,Harumichi Nishimura

CCC '15 Proceedings of the 30th Conference on Computational Complexity, (2015): 488.0-511.0

Cited by5EIBibtex

Stronger methods of making quantum interactive proofs perfectly complete

Hirotada Kobayashi,François Le Gall,Harumichi Nishimura

SIAM J. Comput., no. 2 (2015)

Cited by20EIBibtex

Generalized quantum arthur-merlin games

Hirotada Kobayashi,François Le Gall,Harumichi Nishimura

conference on computational complexity, pp.488-511, (2015)

Bibtex

Interactive proofs with quantum finite automata

Harumichi Nishimura,Tomoyuki Yamakami

Theor. Comput. Sci., (2015): 1-18

Cited by7EIBibtex

Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete

Hirotada Kobayashi,François Le Gall,Harumichi Nishimura

SIAM Journal on Computing, no. 2 (2015): 243-289

Bibtex

Quantum Algorithms for Matrix Products over Semirings

Francois Le Gall,Harumichi Nishimura

ALGORITHM THEORY - SWAT 2014, (2014): 331-+

Bibtex

Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs

François Le Gall,Harumichi Nishimura,Seiichiro Tani

Theoretical Computer Science, (2014): 429-440

Cited by3EIBibtex

Impossibility of Classically Simulating One-Clean-Qubit Computation

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

IEICE Technical Report; IEICE Tech. Rep., no. 205 (2014): 5-12

Bibtex

RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC

Kazuo Iwama,Harumichi Nishimura

International Journal of Foundations of Computer Science, (2014)

Bibtex

View All

Base Info Papers Patents Projects