論文 - 西村 治道
-
Unbounded-error quantum query complexity
Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
Theoretical Computer Science 412 巻 頁: 4619-4628 2011年
-
Constructing quantum network coding schemes from classical nonlinear protocols
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
Proceedings of IEEE International Symposium on Information Theory 2011 頁: 109-113 2011年
-
Quantum counterfeit coin problems
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
Lecture Notes in Computer Science (Proceedings of 21st International Symposium on Algorithms and Computation) 6506 巻 頁: 73-84 2010年
-
Perfect quantum network communication protocol based on classical network coding
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
Proceedings of IEEE International Symposium on Information Theory 2010 頁: 2686-2690 2010年
-
An application of quantum finite automata to interactive proof systems
Harumichi Nishimura, Tomoyuki Yamakami
Journal of Computer and System Sciences 75 巻 頁: 255-269 2009年
-
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
Harumichi Nishimura, Masanao Ozawa
Quantum Information Processing 8 巻 頁: 13-24 2009年
-
Quantum random access coding 招待有り
Harumichi Nishimura, Rudy Raymond
IEICE Transactions 92 巻 ( A(5) ) 頁: 1268-1275 2009年
-
General scheme for perfect quantum network coding with free classical communication
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
Lecture Notes in Computer Science (Proceedings of 36th International Colloquium on Automata, Languages and Programming) 5555 巻 頁: 622-633 2009年
-
Unbounded-error quantum query complexity
Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
Lecture Notes in Computer Science (Proceedings of 19th International Symposium on Algorithms and Computation) 5369 巻 頁: 919-930 2008年
-
Polynomial-time construction of linear network coding
Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 35th International Colloquium on Automata, Languages and Programming) 5125 巻 頁: 271-282 2008年
-
The efficiency of quantum identity testing of multiple states
Masaru Kada, Harumichi Nishimura, Tomoyuki Yamakami
Journal of Physics A: Mathematical and Theoretical 41 巻 ( Article no. 395309 ) 頁: 1-13 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
Lecture Notes in Computer Science (Proceedings of 19th International Symposium on Algorithms and Computation) 5369 巻 頁: 907-918 2008年
-
Unbounded-error classical and quantum communication complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 18th International Symposium on Algorithms and Computation) 4835 巻 頁: 100-111 2007年
-
Unbounded-error one-way classical and quantum communication complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 34th International Colloquium on Automata, Languages and Programming) 4596 巻 頁: 110-121 2007年
-
Quantum network coding
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 24th Annual Symposium on Theoretical Aspects of Computer Science) 4393 巻 頁: 610-621 2007年
-
(4,1)-quantum random access coding does not exist - one qubit is not enough to recover one of four bits
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
New Journal of Physics 8 巻 ( Article no. 129 ) 頁: 1-11 2006年
-
Quantum computation with supplementary information 招待有り
Harumichi Nishimura
IPSJ Journal 46 巻 頁: 2392-2399 2005年
-
Uniformity of quantum circuit families for error-free algorithms
Harumichi Nishimura, Masanao Ozawa
Theoretical Computer Science 332 巻 頁: 487-496 2005年
-
Polynomial-time quantum computation with advice
Harumichi Nishimura, Tomoyuki Yamakami
Information Processing Letters 90 巻 頁: 195-204 2004年
-
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation 査読有り
Harumichi Nishimura, Tomoyuki Yamakami
Lecture Notes in Computer Science (Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science) 3153 巻 頁: 827-838 2004年