| 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) |
2022-12-08 16:15 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications Le Gall Francois, Masayuki Miyamoto, Harumichi Nishimura (Nagoya Univ.) |
[more] | |
| QIT (2nd) |
2021-11-30 13:30 |
Online | Online | [Poster Presentation]
Private Simultaneous Quantum Messages Protocols for the AND Function Reiji Takeda, Harumichi Nishimura (Nagoya Univ.) |
[more] | |
| QIT (2nd) |
2019-11-19 15:10 |
Tokyo | Gakushuin University | Impossibility of blind quantum sampling for classical client Tomoyuki Morimae (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.), Yuki Takeuchi, Seiichiro Tani (NTT) |
[more] | |
| QIT (2nd) |
2019-05-20 15:50 |
Fukuoka | Kyushu University, Chikushi Campus | Quantum Advantage for the LOCAL Model in Distributed Computing Francois Le Gall (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.), Ansis Rosmanis (CQT) |
[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:30 |
Tokyo | The University of Tokyo | Rational proofs for quantum computing Tomoyuki Morimae (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.) |
[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 10:00 |
Kanagawa | NTT Atsugi R&D center | [Invited Talk]
Computational Complexity of Quantum NP and Quantum AM Harumichi Nishimura (Nagoya Univ.) |
[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 |
|
| COMP, IPSJ-AL | 2014-06-14 09:25 |
Ehime | Matsuyama, Ehime | Computational Complexity of Irredundancy of Local Hamiltonian Ryo Kawasaki, Harumichi Nishimura (Nagoya Univ.) COMP2014-11 |
Gharibian and Kempe [ICALP2012] introduced a problem on irredundancy of local Hamiltonians, named as QIRR, which asks wh... [more] | COMP2014-11 pp.69-76 |
| QIT (2nd) |
2013-11-18 11:40 |
Tokyo | Waseda Univ. | Quantum algorithms for finding constant-sized sub-hypergraphs over 3-uniform hypergraphs Francois Le Gall (Tokyo Univ.), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT) |
We develop a framework based on nested quantum walks for finding a constant-sized sub-hypergraph in a $3$-uniform hyper... [more] | |
| 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) |
2013-05-28 09:40 |
Hokkaido | Hokkaido Univ. | Quantum Algorithms for Matrix Products over Semirings Francois Le Gall (Tokyo Univ.), Harumichi Nishimura (Nagoya Univ.) |
We construct in this paper quantum algorithms for matrix multiplication over several algebraic structures known as semir... [more] | |
| QIT (2nd) |
2012-11-27 - 2012-11-28 |
Kanagawa | Keio Univ. Hiyoshi Campus | [Poster Presentation]
Quantum Query Complexity on Enumerating Collisions Masahide Yamato (Osaka Pref Univ.), Harumichi Nishimura (Nagoya Univ.) |
A collision of a function $f$ (i.e. a pair $(x,y)$ such that $f(x)=f(y)$) is one of the basic concepts on a function. Th... [more] | |
| 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 |
[Return to Top Page]