| 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:45 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
Improved Hardness Results for the Guided Local Hamiltonian Problem Ryu Hayakawa (Kyoto Univ.), Francois Le Gall (Nagoya Univ.), Sevag Gharibian (Paderborn University), Tomoyuki Morimae (Kyoto Univ.) |
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further... [more] | |
| QIT (2nd) |
2019-11-19 11:50 |
Tokyo | Gakushuin University | Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths Ryu Hayakawa, Tomoyuki Morimae (Kyoto Univ.), Suguru Tamaki (Hyogo Univ.) |
Fine-grained quantum supremacy is a study of excluding possibilities of superpolynomial time classical simulations of qu... [more] | |
| COMP | 2019-10-25 16:35 |
Hokkaido | Sapporo Campus, Hokkaido University | Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths Ryu Hayakawa, Tomoyuki Morimae (YITP, Kyoto Univ.), Suguru Tamaki (School of Social Information Science, Univ. of Hyogo)  COMP2019-28 |
Fine-grained quantum supremacy is a study of excluding possibilities of superpolynomial time classical simulations of qu... [more] | COMP2019-28 pp.71-78 |
| 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 |
| COMP | 2014-12-05 13:55 |
Kumamoto | Sojo University | Carry-free positional notation for nonnegative integer combinations of given sets of positive integers satisfying some conditions Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2014-36 |
In this paper, we investigate conditions to compute nonnegative integer combinations for a given set of positive integer... [more] | COMP2014-36 pp.23-27 |
| COMP | 2014-09-02 15:45 |
Aichi | Toyohashi University of Technology | A Note on the Class of the Computational Comlexity of the Coin-Exchange Problem of Frobenius Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2014-22 |
The coin-exchange problem of Frobenius is a problem that determines whether the Frobenius number for given relatively pr... [more] | COMP2014-22 pp.51-54 |
| SS | 2013-01-10 13:00 |
Okinawa | The validity problem of positive XPath queries with sibling axes in the presence of DTDs Yohei Kusunoki (Osaka Univ.), Kenji Hashimoto (NAIST), Yasunori Ishihara, Toru Fujiwara (Osaka Univ.) |
In this paper, we discuss the complexity of the validity for positive XPath queries under the presence of DTDs. A given ... [more] | SS2012-46 pp.1-6 |
|
| PRMU | 2007-03-15 11:00 |
Okayama | Development of an EMD based analogue motion detection sensor Takumi Hattori, Eiji Nakamura, Katsutoshi Sawada (AIT) |
The so called elementary motion detector or EMD is a computational model describing visual signal processing activities ... [more] | PRMU2006-241 pp.37-42 |
|
[Return to Top Page]