| 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 # | |
| QIT (2nd) |
2023-12-19 10:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
Implementation of robustly optimized dynamical decoupling on superconducting qubits Akinori Machino (Osaka Univ./QIQB), Kazuhisa Ogawa (QIQB), Kosuke Mitarai (Osaka Univ./QIQB), Takefumi Miyoshi (QIQB/e-trees/QuEL), Hidehisa Shiomi (QIQB), Shinichi Morisaka (QIQB/QuEL), Ryo Matsuda (Osaka Univ.), Keisuke Koike (e-trees), Ryutaro Ohira, Toshi Sumida, Yoshinori Kurimoto, Yuuya Sugita, Yosuke Ito (QuEL), Yasunari Suzuki (NTT), Peter A. Spring, Shiyu Wang, Shuhei Tamate, Yutaka Tabuchi (RIKEN), Yasunobu Nakamura (RIKEN/The univ. of Tokyo), Makoto Negoro (QIQB/QuEL) |
Dynamical decoupling (DD) is one of the important techniques to protect the state of a qubit from decoherence, and plays... [more] | |
| QIT (2nd) |
2018-11-26 13:30 |
Tokyo | The University of Tokyo | [Poster Presentation]
A development of control hardware for quantum information processing Yutaka Tabuchi, Yutaka Takeda, Shingo Kono, Shuhei Tamate, Yasunobu Nakamura (RCAST, Univ. of Tokyo) |
A development of scalable electronic circuits are indispensable for scalable quantum information processing experiments ... [more] | |
| QIT (2nd) |
2018-11-26 13:30 |
Tokyo | The University of Tokyo | [Poster Presentation]
Design of integrated superconducting qubits and its challenges Shuhei Tamate, Yutaka Tabuchi, Shingo Kono, Akhil Pratap Singh (UTokyo), Kun Zuo, Koichi Kusuyama (RIKEN), Yasunobu Nakamura (UTokyo/RIKEN) |
[more] | |
| QIT (2nd) |
2018-11-26 13:30 |
Tokyo | The University of Tokyo | [Poster Presentation]
Cross-Resonance gate on 2D-integrated system of superconducting qubits Kentaro Heya, Kiyoto Mekami, Amarsanaa Davaasuren, Yutaka Takeda, Akhil Pratap Singh, Singo Kono (UT), Yasunari Suzuki (NTT), Koh-ich Nittoh, Koichi Kusuyama (RIKEN), Shuhei Tamate, Yutaka Tabuchi (UT), Yasunobu Nakamura (UT/RIKEN) |
Quantum Error Correction is indispensable for large-scale quantum computing. However, quantum error correction codes suc... [more] | |
| 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] | |
| CCS, NLP | 2016-06-14 10:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Negative Coupling Effect on Community Detection by Using Laser Network Hiromasa Sakaguchi (Univ. Tokyo), Shuhei Tamate (NII), Yoshihisa Yamamoto (ImPACT), Shoko Utsunomiya (NII)  NLP2016-27 CCS2016-10 |
[more] | NLP2016-27 CCS2016-10 pp.41-44 |
| CCS, NLP | 2016-06-14 11:05 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | [Invited Talk]
Optical oscillator network for solving combinatorial optimization problems
-- Coherent Ising machine -- Shoko Utsunomiya, Shuhei Tamate (NII), Yoshitaka Haribara, Hiromasa Sakaguchi (Tokyo Univ), Hiroki Takesue, Takahiro Inagaki, Kensuke Inaba (NTT), Kyo Inoue (Osaka univ), Yoshihisa Yamamoto (JST) NLP2016-28 CCS2016-11 |
[more] | NLP2016-28 CCS2016-11 pp.45-49 |
| 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 |
|
| QIT (2nd) |
2013-05-27 - 2013-05-28 |
Hokkaido | Hokkaido Univ. | [Poster Presentation]
Geometry of Grover's search algorithms Ken Hamada, Shuhei Tamate, Kazuhisa Ogawa, Masao Kitano (Kyoto Univ.) |
Grover's search algorithm is a quantum algorithm which is polynomially faster than classical computation. The algorithm... [more] |
|
[Return to Top Page]