2009 |
24 | EE | 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) |
23 | EE | 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 | EE | Kazuo Iwama,
Harumichi Nishimura,
Mike Paterson,
Rudy Raymond,
Shigeru Yamashita:
Polynomial-Time Construction of Linear Network Coding.
ICALP (1) 2008: 271-282 |
21 | EE | 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 | EE | Ashley Montanaro,
Harumichi Nishimura,
Rudy Raymond:
Unbounded-Error Quantum Query Complexity.
ISAAC 2008: 919-930 |
2007 |
19 | EE | Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond,
Shigeru Yamashita:
Unbounded-Error One-Way Classical and Quantum Communication Complexity.
ICALP 2007: 110-121 |
18 | EE | Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond,
Shigeru Yamashita:
Unbounded-Error Classical and Quantum Communication Complexity.
ISAAC 2007: 100-111 |
17 | EE | Masahito Hayashi,
Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond Harry Putra,
Shigeru Yamashita:
Quantum Network Coding.
STACS 2007: 610-621 |
2006 |
16 | EE | Masahito Hayashi,
Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond,
Shigeru Yamashita:
Quantum Network Coding.
Complexity of Boolean Functions 2006 |
2005 |
15 | EE | Akinori Kawachi,
Takeshi Koshiba,
Harumichi Nishimura,
Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
EUROCRYPT 2005: 268-284 |
14 | EE | Harumichi Nishimura,
Tomoyuki Yamakami:
Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks
CoRR abs/quant-ph/0507270: (2005) |
13 | EE | Harumichi Nishimura,
Masanao Ozawa:
Uniformity of quantum circuit families for error-free algorithms.
Theor. Comput. Sci. 332(1-3): 487-496 (2005) |
2004 |
12 | EE | Harumichi Nishimura,
Tomoyuki Yamakami:
An Application of Quantum Finite Automata to Interactive Proof Systems.
CIAA 2004: 225-236 |
11 | EE | Harumichi Nishimura,
Tomoyuki Yamakami:
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).
MFCS 2004: 827-838 |
10 | EE | Harumichi Nishimura,
Tomoyuki Yamakami:
An Application of Quantum Finite Automata to Interactive Proof Systems
CoRR quant-ph/0410040: (2004) |
9 | EE | Tomoyuki Yamakami,
Harumichi Nishimura:
An Application of Quantum Finite Automata to Interactive Proof Systems
Electronic Colloquium on Computational Complexity (ECCC)(110): (2004) |
8 | EE | Harumichi Nishimura,
Tomoyuki Yamakami:
Polynomial time quantum computation with advice.
Inf. Process. Lett. 90(4): 195-204 (2004) |
2003 |
7 | EE | Harumichi Nishimura,
Tomoyuki Yamakami:
Polynomial time quantum computation with advice
CoRR quant-ph/0305100: (2003) |
6 | EE | Harumichi Nishimura,
Tomoyuki Yamakami:
An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation
CoRR quant-ph/0312003: (2003) |
5 | EE | Harumichi Nishimura,
Tomoyuki Yamakami:
Polynomial time quantum computation with advice
Electronic Colloquium on Computational Complexity (ECCC)(059): (2003) |
4 | EE | Harumichi Nishimura:
Quantum Computation With Restricted Amplitudes.
Int. J. Found. Comput. Sci. 14(5): 853-870 (2003) |
2002 |
3 | EE | Harumichi Nishimura:
On Quantum Computation with Some Restricted Amplitudes.
STACS 2002: 311-322 |
2 | EE | 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 | EE | Masanao Ozawa,
Harumichi Nishimura:
Local transition functions of quantum Turing machines.
ITA 34(5): 379-402 (2000) |