Local transition functions of quantum Turing machines. - Masanao Ozawa; Harumichi Nishimura (RAIRO Theor. Informatics Appl., 2000)

On Quantum Computation with Some Restricted Amplitudes. - Harumichi Nishimura (STACS, 2002)

On quantum one-way permutations. - Elham Kashefi; Harumichi Nishimura; Vlatko Vedral (Quantum Inf. Comput., 2002)

Computational complexity of uniform quantum circuit families and quantum Turing machines. - Harumichi Nishimura; Masanao Ozawa (Theor. Comput. Sci., 2002)

An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation - Harumichi Nishimura; Tomoyuki Yamakami (CoRR, 2003)

Quantum Computation With Restricted Amplitudes. - Harumichi Nishimura (Int. J. Found. Comput. Sci., 2003)

An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). - Harumichi Nishimura; Tomoyuki Yamakami (MFCS, 2004)

Polynomial time quantum computation with advice. - Harumichi Nishimura; Tomoyuki Yamakami (Inf. Process. Lett., 2004)

Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks - Harumichi Nishimura; Tomoyuki Yamakami (CoRR, 2005)

Uniformity of quantum circuit families for error-free algorithms. - Harumichi Nishimura; Masanao Ozawa (Theor. Comput. Sci., 2005)

(4, 1)-Quantum Random Access Coding Does Not Exist. - Masahito Hayashi; Kazuo Iwama; Harumichi Nishimura; Rudy Raymond; Shigeru Yamashita (ISIT, 2006)

Quantum Computation with Supplementary Information. - Harumichi Nishimura (Inf. Media Technol., 2006)

Unbounded-Error One-Way Classical and Quantum Communication Complexity. - Kazuo Iwama; Harumichi Nishimura; Rudy Raymond; Shigeru Yamashita (ICALP, 2007)

Unbounded-Error Classical and Quantum Communication Complexity. - Kazuo Iwama; Harumichi Nishimura; Rudy Raymond; Shigeru Yamashita (ISAAC, 2007)

Quantum Network Coding. - Masahito Hayashi; Kazuo Iwama; Harumichi Nishimura; Rudy Raymond Harry Putra; Shigeru Yamashita (STACS, 2007)

Polynomial-Time Construction of Linear Network Coding. - Kazuo Iwama; Harumichi Nishimura; Mike Paterson; Rudy Raymond; Shigeru Yamashita (ICALP (1), 2008)

Quantum Query Complexity of Boolean Functions with Small On-Sets. - Andris Ambainis; Kazuo Iwama; Masaki Nakanishi; Harumichi Nishimura; Rudy Raymond; Seiichiro Tani; Shigeru Yamashita (ISAAC, 2008)

General Scheme for Perfect Quantum Network Coding with Free Classical Communication. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura; Martin Rötteler (ICALP (1), 2009)

Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size - Andris Ambainis; Kazuo Iwama; Masaki Nakanishi; Harumichi Nishimura; Rudy Raymond; Seiichiro Tani; Shigeru Yamashita (CoRR, 2009)

Quantum Random Access Coding. - Harumichi Nishimura; Rudy Raymond (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

An application of quantum finite automata to interactive proof systems. - Harumichi Nishimura; Tomoyuki Yamakami (J. Comput. Syst. Sci., 2009)

Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families. - Harumichi Nishimura; Masanao Ozawa (Quantum Inf. Process., 2009)

Perfect quantum network communication protocol based on classical network coding. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura; Martin Rötteler (ISIT, 2010)

Constructing quantum network coding schemes from classical nonlinear protocols. - Hirotada Kobayashi; Francois Le Gall; Harumichi Nishimura; Martin Rötteler (ISIT, 2011)

Unbounded-error quantum query complexity. - Ashley Montanaro; Harumichi Nishimura; Rudy Raymond (Theor. Comput. Sci., 2011)

Reconstructing Strings from Substrings with Quantum Queries. - Richard Cleve; Kazuo Iwama; François Le Gall; Harumichi Nishimura; Seiichiro Tani; Junichi Teruyama; Shigeru Yamashita (SWAT, 2012)

Computational Indistinguishability Between Quantum States and Its Cryptographic Application. - Akinori Kawachi; Takeshi Koshiba; Harumichi Nishimura; Tomoyuki Yamakami (J. Cryptol., 2012)

On QMA protocols with two short quantum proofs. - François Le Gall; Shota Nakagawa; Harumichi Nishimura (Quantum Inf. Comput., 2012)

Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. - Stephen P. Jordan; Hirotada Kobayashi; Daniel Nagaj; Harumichi Nishimura (Quantum Inf. Comput., 2012)

Quantum counterfeit coin problems. - Kazuo Iwama; Harumichi Nishimura; Rudy Raymond; Junichi Teruyama (Theor. Comput. Sci., 2012)

Quantum network coding - How can network coding be applied to quantum information? - Harumichi Nishimura (NetCod, 2013)

Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs. - François Le Gall; Harumichi Nishimura; Seiichiro Tani (CoRR, 2013)

Recovering Strings in Oracles: Quantum and Classic. - Kazuo Iwama; Harumichi Nishimura (Int. J. Found. Comput. Sci., 2013)

Quantum network coding and the current status of its studies. - Harumichi Nishimura (ISITA, 2014)

Impossibility of Classically Simulating One-Clean-Qubit Computation. - Keisuke Fujii 002; Hirotada Kobayashi; Tomoyuki Morimae; Harumichi Nishimura; Shuhei Tamate; Seiichiro Tani (CoRR, 2014)

Power of quantum computing with restricted postselections. - Tomoyuki Morimae; Harumichi Nishimura (CoRR, 2015)

Quantum Merlin-Arthur with Clifford Arthur. - Tomoyuki Morimae; Masahito Hayashi; Harumichi Nishimura; Keisuke Fujii 002 (Quantum Inf. Comput., 2015)

Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura (SIAM J. Comput., 2015)

Interactive proofs with quantum finite automata. - Harumichi Nishimura; Tomoyuki Yamakami (Theor. Comput. Sci., 2015)

Space-Efficient Error Reduction for Unitary Quantum Computations. - Bill Fefferman; Hirotada Kobayashi; Cedric Yen-Yu Lin; Tomoyuki Morimae; Harumichi Nishimura (ICALP, 2016)

Power of Quantum Computation with Few Clean Qubits. - Keisuke Fujii 002; Hirotada Kobayashi; Tomoyuki Morimae; Harumichi Nishimura; Shuhei Tamate; Seiichiro Tani (ICALP, 2016)

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 (Comput. Complex., 2016)

Quantum Merlin-Arthur with noisy channel. - Tomoyuki Morimae; Keisuke Fujii 002; Harumichi Nishimura (CoRR, 2016)

Power of one non-clean qubit. - Tomoyuki Morimae; Keisuke Fujii 002; Harumichi Nishimura (CoRR, 2016)

Modified group non-membership is in AWPP. - Tomoyuki Morimae; Harumichi Nishimura; Francois Le Gall (CoRR, 2016)

Quantum interpretations of AWPP and APP. - Tomoyuki Morimae; Harumichi Nishimura (Quantum Inf. Comput., 2016)

Quantum algorithms for finding constant-sized sub-hypergraphs. - François Le Gall; Harumichi Nishimura; Seiichiro Tani (Theor. Comput. Sci., 2016)

Quantum Algorithms for Matrix Products over Semirings. - François Le Gall; Harumichi Nishimura (Chic. J. Theor. Comput. Sci., 2017)

Merlinization of complexity classes above BQP. - Tomoyuki Morimae; Harumichi Nishimura (Quantum Inf. Comput., 2017)

Modified Group Non-Membership is in Promise-AWPP relative to group oracles. - Tomoyuki Morimae; Harumichi Nishimura; Francois Le Gall (Quantum Inf. Comput., 2017)

Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. - François Le Gall; Tomoyuki Morimae; Harumichi Nishimura; Yuki Takeuchi (MFCS, 2018)

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)

Quantum Advantage for the LOCAL Model in Distributed Computing. - François Le Gall; Harumichi Nishimura; Ansis Rosmanis (STACS, 2019)

Impossibility of blind quantum sampling for classical client. - Tomoyuki Morimae; Harumichi Nishimura; Yuki Takeuchi; Seiichiro Tani (Quantum Inf. Comput., 2019)

Generalized Quantum Arthur-Merlin Games. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura (SIAM J. Comput., 2019)

Brief Announcement: Distributed Quantum Proofs for Replicated Data. - Pierre Fraigniaud; François Le Gall; Harumichi Nishimura; Ami Paz (DISC, 2020)

Rational proofs for quantum computing. - Tomoyuki Morimae; Harumichi Nishimura (Quantum Inf. Comput., 2020)

Distributed Quantum Proofs for Replicated Data. - Pierre Fraigniaud; François Le Gall; Harumichi Nishimura; Ami Paz (ITCS, 2021)

Quantum Logarithmic Space and Post-Selection. - François Le Gall; Harumichi Nishimura; Abuzer Yakaryilmaz (TQC, 2021)

Communication Complexity of Private simultaneous Quantum Messages Protocols. - Akinori Kawachi; Harumichi Nishimura (IACR Cryptol. ePrint Arch., 2021)

Brief Announcement: Distributed Quantum Interactive Proofs. - François Le Gall; Masayuki Miyamoto; Harumichi Nishimura (DISC, 2022)

Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. - François Le Gall; Masayuki Miyamoto; Harumichi Nishimura (MFCS, 2023)

Distributed Quantum Interactive Proofs. - François Le Gall; Masayuki Miyamoto; Harumichi Nishimura (STACS, 2023)

Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries. - François Le Gall; Oran Nadler; Harumichi Nishimura; Rotem Oshman (OPODIS, 2024)

On the Power of Quantum Distributed Proofs. - Atsuya Hasegawa; Srijita Kundu; Harumichi Nishimura (PODC, 2024)

Space-bounded quantum interactive proof systems. - François Le Gall; Yupan Liu; Harumichi Nishimura; Qisheng Wang (Electron. Colloquium Comput. Complex., 2024)

Does there exist a quantum fingerprinting protocol without coherent measurements? - Atsuya Hasegawa; Srijita Kundu; François Le Gall; Harumichi Nishimura; Qisheng Wang (CoRR, 2025)

Group Order is in QCMA. - François Le Gall; Harumichi Nishimura; Dhara Thakkar (CoRR, 2025)