2009 |
21 | 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) |
2008 |
20 | EE | Julia Kempe,
Hirotada Kobayashi,
Keiji Matsumoto,
Ben Toner,
Thomas Vidick:
Entangled Games are Hard to Approximate.
FOCS 2008: 447-456 |
19 | EE | Tsuyoshi Ito,
Hirotada Kobayashi,
Daniel Preda,
Xiaoming Sun,
Andrew Chi-Chih Yao:
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems.
IEEE Conference on Computational Complexity 2008: 187-198 |
18 | EE | Julia Kempe,
Hirotada Kobayashi,
Keiji Matsumoto,
Thomas Vidick:
Using Entanglement in Quantum Multi-prover Interactive Proofs.
IEEE Conference on Computational Complexity 2008: 211-222 |
17 | EE | Hirotada Kobayashi:
General Properties of Quantum Zero-Knowledge Proofs.
TCC 2008: 107-124 |
16 | EE | Tsuyoshi Ito,
Hirotada Kobayashi,
Keiji Matsumoto:
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
CoRR abs/0810.0693: (2008) |
2005 |
15 | EE | Seiichiro Tani,
Hirotada Kobayashi,
Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem.
STACS 2005: 581-592 |
14 | EE | Tomohiro Yamasaki,
Hirotada Kobayashi,
Hiroshi Imai:
Quantum versus deterministic counter automata.
Theor. Comput. Sci. 334(1-3): 275-297 (2005) |
13 | EE | Akinori Kawachi,
Hirotada Kobayashi,
Takeshi Koshiba,
Raymond H. Putra:
Universal test for quantum one-way permutations.
Theor. Comput. Sci. 345(2-3): 370-385 (2005) |
2004 |
12 | EE | Akinori Kawachi,
Hirotada Kobayashi,
Takeshi Koshiba,
Raymond H. Putra:
Universal Test for Quantum One-Way Permutations.
MFCS 2004: 839-850 |
2003 |
11 | EE | Hirotada Kobayashi:
Non-interactive Quantum Perfect and Statistical Zero-Knowledge.
ISAAC 2003: 178-188 |
10 | EE | Hirotada Kobayashi,
Keiji Matsumoto,
Tomoyuki Yamakami:
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
ISAAC 2003: 189-198 |
9 | EE | Hirotada Kobayashi,
Keiji Matsumoto:
Quantum multi-prover interactive proof systems with limited prior entanglement.
J. Comput. Syst. Sci. 66(3): 429-450 (2003) |
2002 |
8 | EE | Tomohiro Yamasaki,
Hirotada Kobayashi,
Hiroshi Imai:
Quantum versus Deterministic Counter Automata.
COCOON 2002: 584-594 |
7 | EE | Hirotada Kobayashi,
Keiji Matsumoto:
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement.
ISAAC 2002: 115-127 |
6 | EE | Tomohiro Yamasaki,
Hirotada Kobayashi,
Hiroshi Imai:
An Analysis of Absorbing Times of Quantum Walks.
UMC 2002: 315-330 |
5 | | Tomohiro Yamasaki,
Hirotada Kobayashi,
Yuuki Tokunaga,
Hiroshi Imai:
One-way probabilistic reversible and quantum one-counter automata.
Theor. Comput. Sci. 289(2): 963-976 (2002) |
2001 |
4 | EE | Hirotada Kobayashi,
Keiji Matsumoto:
Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement
CoRR cs.CC/0102013: (2001) |
3 | EE | Tomohiro Yamasaki,
Hirotada Kobayashi,
Hiroshi Imai:
Two-way Quantum One-counter Automata
CoRR cs.CC/0110005: (2001) |
2 | EE | Hirotada Kobayashi,
Keiji Matsumoto,
Tomoyuki Yamakami:
Quantum Certificate Verification: Single versus Multiple Quantum Certificates
CoRR quant-ph/0110006: (2001) |
2000 |
1 | EE | Tomohiro Yamasaki,
Hirotada Kobayashi,
Yuuki Tokunaga,
Hiroshi Imai:
One-Way Probabilistic Reversible and Quantum One-Counter Automata.
COCOON 2000: 436-446 |