Harumichi Nishimura

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 44

Top Venues

Publications

Atsuya Hasegawa, Srijita Kundu, Harumichi Nishimura
On the Power of Quantum Distributed Proofs. PODC (2024)
Atsuya Hasegawa, Srijita Kundu, Harumichi Nishimura
On the Power of Quantum Distributed Proofs. CoRR (2024)
François Le Gall, Masayuki Miyamoto, Harumichi Nishimura
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. MFCS (2023)
François Le Gall, Masayuki Miyamoto, Harumichi Nishimura
Distributed Quantum Interactive Proofs. STACS (2023)
François Le Gall, Masayuki Miyamoto, Harumichi Nishimura
Brief Announcement: Distributed Quantum Interactive Proofs. DISC (2022)
François Le Gall, Masayuki Miyamoto, Harumichi Nishimura
Distributed Quantum Interactive Proofs. CoRR (2022)
François Le Gall, Masayuki Miyamoto, Harumichi Nishimura
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. CoRR (2022)
Akinori Kawachi, Harumichi Nishimura
Communication Complexity of Private Simultaneous Quantum Messages Protocols. CoRR (2021)
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Distributed Quantum Proofs for Replicated Data. ITCS (2021)
Akinori Kawachi, Harumichi Nishimura
Communication Complexity of Private simultaneous Quantum Messages Protocols. IACR Cryptol. ePrint Arch. 2021 (2021)
Akinori Kawachi, Harumichi Nishimura
Communication Complexity of Private Simultaneous Quantum Messages Protocols. ITC (2021)
François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz
Quantum Logarithmic Space and Post-selection. CoRR (2021)
François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz
Quantum Logarithmic Space and Post-Selection. TQC (2021)
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Distributed Quantum Proofs for Replicated Data. CoRR (2020)
Tomoyuki Morimae, Harumichi Nishimura
Rational proofs for quantum computing. Quantum Inf. Comput. 20 (3&4) (2020)
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC (2020)
François Le Gall, Harumichi Nishimura, Ansis Rosmanis
Quantum Advantage for the LOCAL Model in Distributed Computing. STACS (2019)
Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani
Impossibility of blind quantum sampling for classical client. Quantum Inf. Comput. 19 (9&10) (2019)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Generalized Quantum Arthur-Merlin Games. SIAM J. Comput. 48 (3) (2019)
François Le Gall, Harumichi Nishimura, Ansis Rosmanis
Quantum Advantage for the LOCAL Model in Distributed Computing. CoRR (2018)
François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. CoRR (2018)
François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. MFCS (2018)
Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani
Impossibility of blind quantum sampling for classical client. CoRR (2018)
Tomoyuki Morimae, Harumichi Nishimura
Rational proofs for quantum computing. CoRR (2018)
Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall
Modified Group Non-Membership is in Promise-AWPP relative to group oracles. Quantum Inf. Comput. 17 (3&4) (2017)
François Le Gall, Harumichi Nishimura
Quantum Algorithms for Matrix Products over Semirings. Chic. J. Theor. Comput. Sci. 2017 (2017)
Tomoyuki Morimae, Harumichi Nishimura
Merlinization of complexity classes above BQP. CoRR (2017)
Tomoyuki Morimae, Harumichi Nishimura
Merlinization of complexity classes above BQP. Quantum Inf. Comput. 17 (11&12) (2017)
Tomoyuki Morimae, Yuki Takeuchi, Harumichi Nishimura
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy. CoRR (2017)
Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura
Power of one non-clean qubit. CoRR (2016)
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
Quantum Query Complexity of Almost All Functions with Fixed On-set Size. Comput. Complex. 25 (4) (2016)
Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura
Quantum Merlin-Arthur with noisy channel. CoRR (2016)
Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall
Modified group non-membership is in AWPP. CoRR (2016)
François Le Gall, Harumichi Nishimura, Seiichiro Tani
Quantum algorithms for finding constant-sized sub-hypergraphs. Theor. Comput. Sci. 609 (2016)
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
Space-Efficient Error Reduction for Unitary Quantum Computations. ICALP (2016)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Power of Quantum Computation with Few Clean Qubits. ICALP (2016)
Tomoyuki Morimae, Harumichi Nishimura
Quantum interpretations of AWPP and APP. Quantum Inf. Comput. 16 (5&6) (2016)
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
Space-Efficient Error Reduction for Unitary Quantum Computations. CoRR (2016)
Harumichi Nishimura, Tomoyuki Yamakami
Interactive proofs with quantum finite automata. Theor. Comput. Sci. 568 (2015)
Tomoyuki Morimae, Masahito Hayashi, Harumichi Nishimura, Keisuke Fujii
Quantum Merlin-Arthur with Clifford Arthur. Quantum Inf. Comput. 15 (15&16) (2015)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Generalized Quantum Arthur-Merlin Games. Computational Complexity Conference (2015)
Tomoyuki Morimae, Harumichi Nishimura
Power of quantum computing with restricted postselections. CoRR (2015)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Power of Quantum Computation with Few Clean Qubits. CoRR (2015)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. SIAM J. Comput. 44 (2) (2015)
Harumichi Nishimura
Quantum network coding and the current status of its studies. ISITA (2014)
Harumichi Nishimura, Tomoyuki Yamakami
Interactive Proofs with Quantum Finite Automata. CoRR (2014)
François Le Gall, Harumichi Nishimura
Quantum Algorithms for Matrix Products over Semirings. SWAT (2014)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Impossibility of Classically Simulating One-Clean-Qubit Computation. CoRR (2014)
François Le Gall, Harumichi Nishimura, Seiichiro Tani
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. COCOON (2014)
Kazuo Iwama, Harumichi Nishimura
Recovering Strings in Oracles: Quantum and Classic. Int. J. Found. Comput. Sci. 24 (7) (2013)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Generalized Quantum Arthur-Merlin Games. CoRR (2013)
François Le Gall, Harumichi Nishimura, Seiichiro Tani
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs. CoRR (2013)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Stronger methods of making quantum interactive proofs perfectly complete. ITCS (2013)
Harumichi Nishimura
Quantum network coding - How can network coding be applied to quantum information? NetCod (2013)
François Le Gall, Harumichi Nishimura
Quantum Algorithms for Matrix Products over Semirings. CoRR (2013)
Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, Harumichi Nishimura
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. Quantum Inf. Comput. 12 (5-6) (2012)
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
Quantum counterfeit coin problems. Theor. Comput. Sci. 456 (2012)
Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
Reconstructing Strings from Substrings with Quantum Queries. SWAT (2012)
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)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete CoRR (2012)
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. J. Cryptol. 25 (3) (2012)
François Le Gall, Shota Nakagawa, Harumichi Nishimura
On QMA protocols with two short quantum proofs. Quantum Inf. Comput. 12 (7-8) (2012)
Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
Unbounded-error quantum query complexity. Theor. Comput. Sci. 412 (35) (2011)
François Le Gall, Shota Nakagawa, Harumichi Nishimura
On QMA Protocols with Two Short Quantum Proofs CoRR (2011)
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler
Constructing quantum network coding schemes from classical nonlinear protocols. ISIT (2011)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
Perfect quantum network communication protocol based on classical network coding. ISIT (2010)
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
Quantum Counterfeit Coin Problems CoRR (2010)
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
Quantum Counterfeit Coin Problems. ISAAC (1) (2010)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Roetteler
Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols CoRR (2010)
Harumichi Nishimura, Masanao Ozawa
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families. Quantum Inf. Process. 8 (1) (2009)
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)
Harumichi Nishimura, Rudy Raymond
Quantum Random Access Coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2009)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
General Scheme for Perfect Quantum Network Coding with Free Classical Communication CoRR (2009)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
Perfect Quantum Network Communication Protocol Based on Classical Network Coding CoRR (2009)
Harumichi Nishimura, Tomoyuki Yamakami
An application of quantum finite automata to interactive proof systems. J. Comput. Syst. Sci. 75 (4) (2009)
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. ICALP (1) (2009)
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
Quantum Query Complexity of Boolean Functions with Small On-Sets. ISAAC (2008)
Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
Polynomial-Time Construction of Linear Network Coding. ICALP (1) (2008)
Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
Unbounded-Error Quantum Query Complexity. ISAAC (2008)
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
Unbounded-Error Classical and Quantum Communication Complexity. ISAAC (2007)
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita
Quantum Network Coding. STACS (2007)
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
Unbounded-Error One-Way Classical and Quantum Communication Complexity. ICALP (2007)
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
Quantum Network Coding. Complexity of Boolean Functions (2006)
Harumichi Nishimura
Quantum Computation with Supplementary Information. Inf. Media Technol. 1 (1) (2006)
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
Computational Indistinguishability between Quantum States and Its Cryptographic Application. IACR Cryptol. ePrint Arch. 2006 (2006)
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
(4, 1)-Quantum Random Access Coding Does Not Exist. ISIT (2006)
Harumichi Nishimura, Tomoyuki Yamakami
Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks CoRR (2005)
Harumichi Nishimura, Masanao Ozawa
Uniformity of quantum circuit families for error-free algorithms. Theor. Comput. Sci. 332 (1-3) (2005)
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT (2005)
Harumichi Nishimura, Tomoyuki Yamakami
An Application of Quantum Finite Automata to Interactive Proof Systems. CIAA (2004)
Harumichi Nishimura, Tomoyuki Yamakami
Polynomial time quantum computation with advice. Inf. Process. Lett. 90 (4) (2004)
Tomoyuki Yamakami, Harumichi Nishimura
An Application of Quantum Finite Automata to Interactive Proof Systems Electron. Colloquium Comput. Complex. (110) (2004)
Harumichi Nishimura, Tomoyuki Yamakami
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). MFCS (2004)
Harumichi Nishimura, Tomoyuki Yamakami
An Application of Quantum Finite Automata to Interactive Proof Systems CoRR (2004)
Harumichi Nishimura, Tomoyuki Yamakami
Polynomial time quantum computation with advice CoRR (2003)
Harumichi Nishimura
Quantum Computation With Restricted Amplitudes. Int. J. Found. Comput. Sci. 14 (5) (2003)
Harumichi Nishimura, Tomoyuki Yamakami
Polynomial time quantum computation with advice Electron. Colloquium Comput. Complex. (059) (2003)
Harumichi Nishimura, Tomoyuki Yamakami
An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation CoRR (2003)
Elham Kashefi, Harumichi Nishimura, Vlatko Vedral
On quantum one-way permutations. Quantum Inf. Comput. 2 (5) (2002)
Harumichi Nishimura, Masanao Ozawa
Computational complexity of uniform quantum circuit families and quantum Turing machines. Theor. Comput. Sci. 276 (1-2) (2002)

Harumichi Nishimura.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Harumichi Nishimura