|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
QIT (2nd) |
2016-11-25 15:10 |
Ibaraki |
KEK Kobayashi-hall |
Power of Quantum Computation with Few Clean Qubits Keisuke Fujii (Univ. Tokyo), Hirotada Kobayashi (NII), Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Shuhei Tamate (NII), Seiichiro Tani (NTT) |
This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits a... [more] |
|
COMP |
2015-09-01 10:30 |
Nagano |
|
Impossibility of Classically Simulating One-Clean-Qubit Computation Keisuke Fujii (Kyoto Univ.), Hirotada Kobayashi (NII), Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Shuhei Tamate (NII), Seiichiro Tani (NTT) COMP2015-17 |
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input... [more] |
COMP2015-17 pp.5-12 |
COMP |
2013-06-24 15:45 |
Nara |
Nara Women's University |
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete Hirotada Kobayashi (NII), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.) COMP2013-24 |
This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is prove... [more] |
COMP2013-24 pp.31-38 |
QIT (2nd) |
2011-11-22 13:00 |
Osaka |
Osaka Univ. Engr. Sci. Sigma Hall (Toyonaka) |
Computing on Quantum Anonymous Network Hirotada Kobayashi, Keiji Matsumoto (NII), Seiichiro Tani (NTT) |
[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-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 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|