Harumichi Nishimura

	2009
28		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: 622-633
27		Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler: Perfect Quantum Network Communication Protocol Based on Classical Network Coding CoRR abs/0902.1299: (2009)
26		Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler: General Scheme for Perfect Quantum Network Coding with Free Classical Communication CoRR abs/0908.1457: (2009)
25		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 abs/0908.2468: (2009)
24		Harumichi Nishimura, Rudy Raymond: Quantum Random Access Coding. IEICE Transactions 92-A(5): 1268-1275 (2009)
23		Harumichi Nishimura, Tomoyuki Yamakami: An application of quantum finite automata to interactive proof systems. J. Comput. Syst. Sci. 75(4): 255-269 (2009)
	2008
22		Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita: Polynomial-Time Construction of Linear Network Coding. ICALP (1) 2008: 271-282
21		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: 907-918
20		Ashley Montanaro, Harumichi Nishimura, Rudy Raymond: Unbounded-Error Quantum Query Complexity. ISAAC 2008: 919-930
	2007
19		Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita: Unbounded-Error One-Way Classical and Quantum Communication Complexity. ICALP 2007: 110-121
18		Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita: Unbounded-Error Classical and Quantum Communication Complexity. ISAAC 2007: 100-111
17		Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita: Quantum Network Coding. STACS 2007: 610-621
	2006
16		Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita: Quantum Network Coding. Complexity of Boolean Functions 2006
	2005
15		Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT 2005: 268-284
14		Harumichi Nishimura, Tomoyuki Yamakami: Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks CoRR abs/quant-ph/0507270: (2005)
13		Harumichi Nishimura, Masanao Ozawa: Uniformity of quantum circuit families for error-free algorithms. Theor. Comput. Sci. 332(1-3): 487-496 (2005)
	2004
12		Harumichi Nishimura, Tomoyuki Yamakami: An Application of Quantum Finite Automata to Interactive Proof Systems. CIAA 2004: 225-236
11		Harumichi Nishimura, Tomoyuki Yamakami: An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). MFCS 2004: 827-838
10		Harumichi Nishimura, Tomoyuki Yamakami: An Application of Quantum Finite Automata to Interactive Proof Systems CoRR quant-ph/0410040: (2004)
9		Tomoyuki Yamakami, Harumichi Nishimura: An Application of Quantum Finite Automata to Interactive Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(110): (2004)
8		Harumichi Nishimura, Tomoyuki Yamakami: Polynomial time quantum computation with advice. Inf. Process. Lett. 90(4): 195-204 (2004)
	2003
7		Harumichi Nishimura, Tomoyuki Yamakami: Polynomial time quantum computation with advice CoRR quant-ph/0305100: (2003)
6		Harumichi Nishimura, Tomoyuki Yamakami: An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation CoRR quant-ph/0312003: (2003)
5		Harumichi Nishimura, Tomoyuki Yamakami: Polynomial time quantum computation with advice Electronic Colloquium on Computational Complexity (ECCC)(059): (2003)
4		Harumichi Nishimura: Quantum Computation With Restricted Amplitudes. Int. J. Found. Comput. Sci. 14(5): 853-870 (2003)
	2002
3		Harumichi Nishimura: On Quantum Computation with Some Restricted Amplitudes. STACS 2002: 311-322
2		Harumichi Nishimura, Masanao Ozawa: Computational complexity of uniform quantum circuit families and quantum Turing machines. Theor. Comput. Sci. 276(1-2): 147-181 (2002)
	2000
1		Masanao Ozawa, Harumichi Nishimura: Local transition functions of quantum Turing machines. ITA 34(5): 379-402 (2000)

Coauthor Index

1	Andris Ambainis	[21] [25]
2	François Le Gall (Francois Le Gall)	[26] [27] [28]
3	Masahito Hayashi	[16] [17]
4	Kazuo Iwama	[16] [17] [18] [19] [21] [22] [25]
5	Akinori Kawachi	[15]
6	Hirotada Kobayashi	[26] [27] [28]
7	Takeshi Koshiba	[15]
8	Ashley Montanaro	[20]
9	Masaki Nakanishi	[21] [25]
10	Masanao Ozawa	[1] [2] [13]
11	Mike Paterson	[22]
12	Raymond H. Putra (Rudy Raymond Harry Putra)	[17]
13	Rudy Raymond	[16] [18] [19] [20] [21] [22] [24] [25]
14	Martin Rötteler	[26] [27] [28]
15	Seiichiro Tani	[21] [25]
16	Tomoyuki Yamakami	[5] [6] [7] [8] [9] [10] [11] [12] [14] [15] [23]
17	Shigeru Yamashita	[16] [17] [18] [19] [21] [22] [25]

Colors in the list of coauthors