Harumichi Nishimura
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
25
Venues
11
Active years
2002–2025
Best venue rank
A*
Where they publish
Papers
25 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | FOCS | Group Order is in QCMA. | Franois Le Gall, Harumichi Nishimura, Dhara Thakkar |
| 2024 | OPODIS | Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries. | Franois Le Gall, Oran Nadler, Harumichi Nishimura, Rotem Oshman |
| 2024 | PODC | On the Power of Quantum Distributed Proofs. | Atsuya Hasegawa, Srijita Kundu, Harumichi Nishimura |
| 2023 | MFCS | Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. | Franois Le Gall, Masayuki Miyamoto, Harumichi Nishimura |
| 2023 | STACS | Distributed Quantum Interactive Proofs. | Franois Le Gall, Masayuki Miyamoto, Harumichi Nishimura |
| 2019 | STACS | Quantum Advantage for the LOCAL Model in Distributed Computing. | Franois Le Gall, Harumichi Nishimura, Ansis Rosmanis |
| 2018 | MFCS | Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. | Franois Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi |
| 2016 | ICALP | Space-Efficient Error Reduction for Unitary Quantum Computations. | Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura |
| 2016 | ICALP | Power of Quantum Computation with Few Clean Qubits. | Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani |
| 2014 | COCOON | Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. | Franois Le Gall, Harumichi Nishimura, Seiichiro Tani |
| 2014 | ISITA | Quantum network coding and the current status of its studies. | Harumichi Nishimura |
| 2011 | ISIT | Constructing quantum network coding schemes from classical nonlinear protocols. | Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rtteler |
| 2010 | ISAAC | Quantum Counterfeit Coin Problems. | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama |
| 2010 | ISIT | Perfect quantum network communication protocol based on classical network coding. | Hirotada Kobayashi, Franois Le Gall, Harumichi Nishimura, Martin Rtteler |
| 2009 | ICALP | General Scheme for Perfect Quantum Network Coding with Free Classical Communication. | Hirotada Kobayashi, Franois Le Gall, Harumichi Nishimura, Martin Rtteler |
| 2008 | ICALP | Polynomial-Time Construction of Linear Network Coding. | Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita |
| 2008 | ISAAC | Quantum Query Complexity of Boolean Functions with Small On-Sets. | Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita |
| 2008 | ISAAC | Unbounded-Error Quantum Query Complexity. | Ashley Montanaro, Harumichi Nishimura, Rudy Raymond |
| 2007 | ICALP | Unbounded-Error One-Way Classical and Quantum Communication Complexity. | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
| 2007 | ISAAC | Unbounded-Error Classical and Quantum Communication Complexity. | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
| 2007 | STACS | Quantum Network Coding. | Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita |
| 2006 | ISIT | (4, 1)-Quantum Random Access Coding Does Not Exist. | Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
| 2005 | EuroCrypt | Computational Indistinguishability Between Quantum States and Its Cryptographic Application. | Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami |
| 2004 | MFCS | An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). | Harumichi Nishimura, Tomoyuki Yamakami |
| 2002 | STACS | On Quantum Computation with Some Restricted Amplitudes. | Harumichi Nishimura |