| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2012-04-27 10:35 |
Osaka | Osaka Prefecture University | Reconstructing Strings from Substrings with Quantum Queries Richard Cleve (Univ. of Waterloo), Kazuo Iwama (Kyoto Univ.), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT), Junichi Teruyama (Kyoto Univ.), Shigeru Yamashita (Ritsumeikan Univ.)  COMP2012-2 |
This paper investigates the number of quantum queries made to solve the problem of reconstructing an unknown string fro... [more] |
COMP2012-2 pp.7-14 |
| QIT (2nd) |
2011-11-21 11:00 |
Osaka | Osaka Univ. Engr. Sci. Sigma Hall (Toyonaka) | On QMA Protocols with Two Short Quantum Proofs Francois Le Gall (Univ. of Tokyo), Shota Nakagawa, Harumichi Nishimura (Osaka Pref. Univ.) |
This paper gives a QMA (Quantum Merlin-Arthur) protocol for 3-SAT with two logarithmic-size quantum proofs (that are not... [more] | |
| COMP | 2011-05-11 15:05 |
Nagano | Shinshu Univ. | Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols Hirotada Kobayashi (NII), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Osaka Pref. Univ.), Martin Roetteler (NEC Lab. America) COMP2011-15 |
[more] | COMP2011-15 pp.25-31 |
| COMP | 2009-05-26 11:15 |
Saitama | Saitama Univ. | Designing Quantum Game Strategies from Quantum Communication Protocols Kazuo Iwama (Kyoto Univ.), Harumichi Nishimura (Osaka Pref. Univ.), Rudy Raymond (IBM Japan) COMP2009-12 |
In their recent paper, Cleve , Slofstra, Unger and Upadhyay showed that the $CHSH^{\oplus{n}}$, a natural extension of t... [more] | COMP2009-12 pp.21-28 |
| COMP | 2009-04-17 16:05 |
Kyoto | Kyoto Univ. | General Scheme for Perfect Quantum Network Coding with Free Classical Communication Hirotada Kobayashi (NII/ERATO-SORST), Francois Le Gall (JST), Harumichi Nishimura (Osaka Pref. Univ.), Martin Roetteler (NEC Lab. America) COMP2009-8 |
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for som... [more] | COMP2009-8 pp.51-58 |
| COMP | 2008-03-10 09:55 |
Kanagawa | Unbounded-Error Quantum Query Complexity Ashley Montanaro (Univ. of Bristol), Harumichi Nishimura (Osaka Prefecture Univ.), Rudy Raymond (IBM) COMP2007-56 |
This work studies the quantum query complexity of Boolean functions in an unbounded-error scenario where it is only requ... [more] | COMP2007-56 pp.9-14 |
|
| COMP | 2006-05-24 14:10 |
Fukuoka | Kyushu Institute of Technology | (4,1)-Quantum Random Access Coding Does Not Exist Masahito Hayashi (JST), Kazuo Iwama (Kyoto Univ.), Harumichi Nishimura (Osaka Prefecture Univ.), Rudy Raymond (Kyoto Univ.), Shigeru Yamashita (NAIST) |
An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis, Nayak, Ta-shma and Vazirani in ACM Symp. on The... [more] |
COMP2006-14 pp.33-38 |
| COMP | 2005-12-22 13:00 |
Tokushima | The University of Tokushima | Transmitting classical information on the quantum network efficiently Kazuo Iwama, Harumichi Nishimura, Rudy Raymond (Kyoto Univ.), Shigeru Yamashita (NAIST) |
The question in this paper is whether the quantum random access (QRA) coding, given by Ambainis et al., on the {\it netw... [more] | COMP2005-51 pp.15-20 |
[Return to Top Page]