| 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 | 2019-09-02 14:50 |
Okayama | Tsushima Campus, Okayama University | Fine-grained quantum computational supremacy Tomoyuki Morimae (Kyoto Univ.), Suguru Tamaki (Univ. Hyogo)  COMP2019-14 |
It is known that probability distributions generated by quantum circuits cannot be approximately sampled by efficient cl... [more] | COMP2019-14 p.25 |
| QIT (2nd) |
2019-05-21 15:10 |
Fukuoka | Kyushu University, Chikushi Campus | Resource-efficient verification of quantum computing using Serfling's bound Yuki Takeuchi (NTT), Atul Mantri (Univ. of Edinburgh), Tomoyuki Morimae (Kyoto Univ.), Akihiro Mizutani (Mitsubishi Electric), Joseph F. Fitzsimons (Horizon Quantum Computing) |
Verifying quantum states is central to certifying the correct operation of various quantum information processing tasks.... [more] | |
| QIT (2nd) |
2019-05-21 15:30 |
Fukuoka | Kyushu University, Chikushi Campus | Fine-grained quantum supremacy Tomoyuki Morimae (Kyoto Univ.), Suguru Tamaki (Hyogo Univ.) |
[more] | |
| COMP, IPSJ-AL | 2019-05-11 11:30 |
Kumamoto | Kumamoto University | Rational proofs for quantum computing Tomoyuki Morimae (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.) COMP2019-5 |
It is an open problem whether a classical client can delegate quantum computing to a remote quantum server in such a way... [more] | COMP2019-5 pp.67-74 |
| QIT (2nd) |
2018-11-27 16:10 |
Tokyo | The University of Tokyo | Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements Yuki Takeuchi (NTT), Tomoyuki Morimae (Kyoto Univ./JST), Masahito Hayashi (Nagoya Univ./SUSTech/NUS) |
In this talk, we construct a universal hypergraph state that only requires $X$ and $Z$-basis measurements for universal ... [more] | |
| QIT (2nd) |
2018-11-27 16:30 |
Tokyo | The University of Tokyo | Rational proofs for quantum computing Tomoyuki Morimae (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.) |
[more] | |
| QIT (2nd) |
2018-06-04 10:00 |
Hiroshima | ICCH Ran | Verification of quantum computing with local Hamiltonian Tomoyuki Morimae (Kyoto Univ.) |
[more] | |
| QIT (2nd) |
2017-11-16 15:35 |
Saitama | Saitama University | [Invited Talk]
セキュアクラウド量子計算 Tomoyuki Morimae (Gunma Univ.) |
[more] | |
| QIT (2nd) |
2017-11-16 16:40 |
Saitama | Saitama University | Verification of high-connectivity hypergraph states and its applications to quantum computing Yuki Takeuchi (Osaka Univ.), Tomoyuki Morimae (Gunma Univ./JST) |
Verification is a task to check wether a given quantum state is correct or not. If a verifier does not have enough abili... [more] | |
| QIT (2nd) |
2017-11-16 17:05 |
Saitama | Saitama University | Merlinization of complexity classes above BQP Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.) |
We study how complexity classes above BQP, such as postBQP, postBQP_FP, and SBQP, change if we ``Merlinize" them, i.e., ... [more] | |
| COMP | 2017-10-27 13:30 |
Tokyo | Modified group nonmembership is in AWPP Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Francois Le Gall (Kyoto Univ.) |
[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] | |
| QIT (2nd) |
2015-11-25 11:30 |
Kanagawa | NTT Atsugi R&D center | Quantum interpretation of AWPP Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.) |
[more] | |
| COMP | 2015-10-02 13:30 |
Tokyo | Quantum Merlin-Arthur with Clifford Arthur Tomoyuki Morimae (Gunma Univ.), Masahito Hayashi, Harumichi Nishimura (Nagoya Univ.), Keisuke Fujii (Kyoto Univ.) COMP2015-25 |
[more] | COMP2015-25 pp.17-21 |
|
| COMP | 2015-09-01 10:00 |
Nagano | Quantum interpretation of AWPP Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.) COMP2015-16 |
[more] | COMP2015-16 pp.1-4 |
|
| 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) |
2014-11-18 09:40 |
Miyagi | Tohoku Univ. | hardness of the classical simulation of the one clean qubit model Tomoyuki Morimae (Gunma Univ.), Keisuke Fujii (Kyoto Univ.), Joe Fitzsimons (SUTD) |
[more] | |
| COMP, IPSJ-AL | 2014-06-14 09:00 |
Ehime | Matsuyama, Ehime | role of mixedness in MBQC Tomoyuki Morimae (Gunma Univ.) |
[more] | |
| IT | 2014-05-16 10:40 |
Oita | Beppu International Convention Center | Derivation of the memory capacity necessary for MBQC by using the quantum one-time pad Tomoyuki Morimae (Gunma Univ.) |
[more] | |
| QIT (2nd) |
2014-05-12 11:30 |
Aichi | Nagoya Univ. | Highly-mixed measurement-based quantum computing and the one clean qubit model Tomoyuki Morimae (Gunma Univ.) |
[more] | |
[Return to Top Page]