H. Nishimura

Most-cited papers

Quantum Network Coding
Masahito Hayashi, K. Iwama, H. Nishimura, Raymond H. Putra +1 more
2006Symposium on Theoretical Aspects of Computer Science165 citations Open access
Semantic Scholar
Perfect quantum network communication protocol based on classical network coding
Hirotada Kobayashi, F. Le Gall, H. Nishimura, M. Rötteler
20092010 IEEE International Symposium on Information Theory83 citations Open access
Semantic Scholar
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
Hirotada Kobayashi, F. Le Gall, H. Nishimura, M. Rötteler
2009International Colloquium on Automata, Languages and Programming82 citations Open access
Semantic Scholar
Computational complexity of uniform quantum circuit families and quantum Turing machines
H. Nishimura, Masanao Ozawa
1999Theoretical Computer Science71 citations Open access
Semantic Scholar
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
Akinori Kawachi, Takeshi Koshiba, H. Nishimura, T. Yamakami
2004Journal of Cryptology70 citations Open access
Semantic Scholar
(4,1)-Quantum random access coding does not exist—one qubit is not enough to recover one of four bits
Masahito Hayashi, K. Iwama, H. Nishimura, Rudy Raymond +1 more
20062006 IEEE International Symposium on Information Theory66 citations Open access
Semantic Scholar
Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error.
K. Fujii, Hirotada Kobayashi, T. Morimae, H. Nishimura +2 more
2014Physical Review Letters60 citations Open access
Semantic Scholar
Constructing quantum network coding schemes from classical nonlinear protocols
Hirotada Kobayashi, F. Le Gall, H. Nishimura, M. Rötteler
2010IEEE International Symposium on Information Theory. Proceedings55 citations Open access
Semantic Scholar
Auger-Electron Ejections from Xenon N 4 , 5 OO and Krypton M 4 , 5 NN Processes by Electron Impact near Threshold
S. Ohtani, H. Nishimura, H. Suzuki, K. Wakiya
197652 citations
Semantic Scholar
Polynomial time quantum computation with advice
H. Nishimura, T. Yamakami
2003Information Processing Letters46 citations Open access
Semantic Scholar
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
S. Jordan, Hirotada Kobayashi, Daniel Nagaj, H. Nishimura
2011Quantum information & computation44 citations Open access
Semantic Scholar
Local transition functions of quantum Turing machines
Masanao Ozawa, H. Nishimura
1998RAIRO - Theoretical Informatics and Applications44 citations
Semantic Scholar
Quantum Advantage for the LOCAL Model in Distributed Computing
F. Le Gall, H. Nishimura, A. Rosmanis
2018Symposium on Theoretical Aspects of Computer Science43 citations
Semantic Scholar
On QMA protocols with two short quantum proofs
F. Le Gall, Shota Nakagawa, H. Nishimura
2011Quantum information & computation38 citations Open access
Semantic Scholar
An application of quantum finite automata to interactive proof systems
H. Nishimura, T. Yamakami
2004Journal of computer and system sciences (Print)37 citations Open access
Semantic Scholar
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
H. Nishimura, Masanao Ozawa
2005Quantum Information Processing31 citations Open access
Semantic Scholar
Power of Quantum Computation with Few Clean Qubits
K. Fujii, Hirotada Kobayashi, T. Morimae, H. Nishimura +2 more
2015International Colloquium on Automata, Languages and Programming29 citations Open access
Semantic Scholar
Unbounded-Error One-Way Classical and Quantum Communication Complexity
K. Iwama, H. Nishimura, Rudy Raymond, S. Yamashita
2007International Colloquium on Automata, Languages and Programming25 citations Open access
Semantic Scholar
The efficiency of quantum identity testing of multiple states
M. Kada, H. Nishimura, T. Yamakami
200822 citations Open access
Semantic Scholar
Quantum counterfeit coin problems
K. Iwama, H. Nishimura, Raymond H. Putra, Junichi Teruyama
2010Theoretical Computer Science20 citations Open access
Semantic Scholar
Unbounded-Error Quantum Query Complexity
Ashley Montanaro, H. Nishimura, Raymond H. Putra
2007International Symposium on Algorithms and Computation20 citations Open access
Semantic Scholar
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy
T. Morimae, Yuki Takeuchi, H. Nishimura
2017Quantum18 citations Open access
Semantic Scholar
Stronger methods of making quantum interactive proofs perfectly complete
Hirotada Kobayashi, F. Le Gall, H. Nishimura
2012Information Technology Convergence and Services18 citations Open access
Semantic Scholar
Reconstructing Strings from Substrings with Quantum Queries
R. Cleve, K. Iwama, F. Le Gall, H. Nishimura +3 more
2012Scandinavian Workshop on Algorithm Theory18 citations Open access
Semantic Scholar
Space-Efficient Error Reduction for Unitary Quantum Computations
Bill Fefferman, Hirotada Kobayashi, C. Lin, T. Morimae +1 more
2016International Colloquium on Automata, Languages and Programming17 citations Open access
Semantic Scholar
Generalized Quantum Arthur-Merlin Games
Hirotada Kobayashi, F. Le Gall, H. Nishimura
2013Cybersecurity and Cyberforensics Conference17 citations Open access
Semantic Scholar
Distributed Quantum Proofs for Replicated Data
P. Fraigniaud, F. Le Gall, H. Nishimura, A. Paz
2020Information Technology Convergence and Services16 citations
Semantic Scholar
Quantum Network Coding for General Graphs
K. Iwama, H. Nishimura, Rudy Raymond, S. Yamashita
200616 citations
Semantic Scholar
Communication Complexity of Private Simultaneous Quantum Messages Protocols
Akinori Kawachi, H. Nishimura
2021IACR Cryptology ePrint Archive15 citations
Semantic Scholar
Quantum network coding — How can network coding be applied to quantum information?
H. Nishimura
2013International Symposium on Network Coding15 citations
Semantic Scholar
Power of one nonclean qubit
T. Morimae, K. Fujii, H. Nishimura
201712 citations Open access
Semantic Scholar
Interactive proofs with quantum finite automata
H. Nishimura, T. Yamakami
2014Theoretical Computer Science12 citations Open access
Semantic Scholar
Merlinization of complexity classes above BQP
T. Morimae, H. Nishimura
2017Quantum information & computation10 citations Open access
Semantic Scholar
Quantum Algorithms for Matrix Products over Semirings
F. Le Gall, H. Nishimura
2013Chicago journal of theoretical computer science10 citations Open access
Semantic Scholar
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
A. Ambainis, K. Iwama, Masaki Nakanishi, H. Nishimura +3 more
2009arXiv.org10 citations
Semantic Scholar
Distributed Quantum Interactive Proofs
F. Le Gall, Masayuki Miyamoto, H. Nishimura
2022Symposium on Theoretical Aspects of Computer Science9 citations
Semantic Scholar
Impossibility of Classically Simulating One-Clean-Qubit Computation
Keisuke Fujii, Hirotada Kobayashi, T. Morimae, H. Nishimura +2 more
2014arXiv.org9 citations
Semantic Scholar
On quantum one-way permutations
E. Kashefi, H. Nishimura, V. Vedral
2002Quantum information & computation9 citations
Semantic Scholar
Quantum Query Complexity of Boolean Functions with Small On-Sets
A. Ambainis, K. Iwama, Masaki Nakanishi, H. Nishimura +3 more
2008International Symposium on Algorithms and Computation8 citations
Semantic Scholar
Uniformity of quantum circuit families for error-free algorithms
H. Nishimura, Masanao Ozawa
2005Theoretical Computer Science8 citations Open access
Semantic Scholar
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications
F. Le Gall, Masayuki Miyamoto, H. Nishimura
2022International Symposium on Mathematical Foundations of Computer Science7 citations
Semantic Scholar
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract)
H. Nishimura, T. Yamakami
2003International Symposium on Mathematical Foundations of Computer Science7 citations Open access
Semantic Scholar
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups
F. Le Gall, T. Morimae, H. Nishimura, Yuki Takeuchi
2018International Symposium on Mathematical Foundations of Computer Science6 citations Open access
Semantic Scholar
Impossibility of blind quantum sampling for classical client
T. Morimae, H. Nishimura, Yuki Takeuchi, S. Tani
2018Quantum information & computation6 citations Open access
Semantic Scholar
Quantum Merlin-Arthur with Clifford Arthur
T. Morimae, Masahito Hayashi, H. Nishimura, K. Fujii
2015Quantum information & computation6 citations Open access
Semantic Scholar
Quantum interpretations of AWPP and APP
T. Morimae, H. Nishimura
2015Quantum information & computation6 citations Open access
Semantic Scholar
Quantum network coding and the current status of its studies
H. Nishimura
2014International Symposium on Information Theory and its Applications6 citations
Semantic Scholar
Polynomial-Time Construction of Linear Network Coding
K. Iwama, H. Nishimura, M. Paterson, Rudy Raymond +1 more
2008International Colloquium on Automata, Languages and Programming6 citations
Semantic Scholar
On the Power of Quantum Distributed Proofs
Atsuya Hasegawa, Srijita Kundu, H. Nishimura
2024ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing5 citations Open access
Semantic Scholar
Power of one non-clean qubit
T. Morimae, K. Fujii, H. Nishimura
2016arXiv.org5 citations
Semantic Scholar