| 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 # | |
| RCC, ISEC, IT, WBS | 2024-03-14 17:00 |
Osaka | Osaka Univ. (Suita Campus) | Reconstruction of Boyer quantum algorithm and its application to hash puzzles Chris Idota, Yuichi Kaji (Nagoya Univ.)  IT2023-132 ISEC2023-131 WBS2023-120 RCC2023-114 |
This study investigates the computational complexity of solving hash puzzles using quantum algorithms. A hash puzzle is ... [more] | IT2023-132 ISEC2023-131 WBS2023-120 RCC2023-114 pp.358-365 |
| OCS, CS (Joint) |
2024-01-11 15:40 |
Kagoshima | [Special Invited Talk]
Progress and Challenges in Quantum-Assisted Communication Systems Naoki Ishikawa (Yokohama National Univ.) CS2023-96 OCS2023-60 |
Progress and challenges in quantum-assisted communication systems are reviewed in this presentation. Specifically, the f... [more] | CS2023-96 OCS2023-60 p.13(CS), p.19(OCS) |
|
| SIP | 2023-08-08 15:25 |
Osaka | Osaka Univ. (Suita) Convention Center (Primary: On-site, Secondary: Online) |
[Invited Talk]
Principles of Quantum Exhaustive Search Algorithm and Its Applications in Communication and Signal Processing Naoki Ishikawa (Yokohama National Univ.) SIP2023-62 |
In this invited talk, the basic principles of Grover adaptive search, which is a quantum exhaustive search algorithm, ar... [more] | SIP2023-62 p.77 |
| SR | 2022-05-13 15:35 |
Tokyo | NICT Koganei (Primary: On-site, Secondary: Online) |
[Invited Lecture]
Mathematical Similarity Between Wireless Communication and Quantum Computation: Basic Principles and State-of-the-Art Studies Naoki Ishikawa, Masaya Norimoto, Yuki Sano (Yokohama National Univ.) SR2022-18 |
Focusing on the mathematical similarity between wireless communication and quantum computation, our presentation reviews... [more] | SR2022-18 p.77 |
| SITE, ISEC, HWS, EMM, BioX, IPSJ-CSEC, IPSJ-SPT, ICSS [detail] | 2020-07-20 15:45 |
Online | Online | Quantum Attacks on the Sum of Even-Mansour Pseudorandom Function Kazuo Shinagawa, Tetsu Iwata (Nagoya Univ.) ISEC2020-21 SITE2020-18 BioX2020-24 HWS2020-14 ICSS2020-8 EMM2020-18 |
At CRYPTO~2019, a method to construct a pseudorandom function from public random permutations was presented. In this pap... [more] | ISEC2020-21 SITE2020-18 BioX2020-24 HWS2020-14 ICSS2020-8 EMM2020-18 pp.47-51 |
| ISEC | 2020-05-20 10:45 |
Online | Online | Improved Quantum Information Set Decoding Algorithm with Low Memory Naoto Kimura (Univ. Tokyo), Atsushi Takayasu (NICT), Tsuyoshi Takagi (Univ. Tokyo) ISEC2020-3 |
The security of code-based cryptoststems relates to the hardness of the syndrome decoding problem. The best decoding alg... [more] | ISEC2020-3 pp.15-22 |
| ISEC | 2018-05-16 16:00 |
Tokyo | Ookayama Campus, Tokyo Institute of Technology | [Invited Talk]
Quantum Multicollision Finding Algorithm
-- from ASIACRYPT 2017 -- Akinori Hosoyamada, Yu Sasaki, Keita Xagawa (NTT) ISEC2018-10 |
We introduce the paper ``Quantum Multicollision Finding Algorithm'' by Akinori Hosoyamada, Yu Sasaki, Keita Xagawa, whic... [more] | ISEC2018-10 p.59 |
| QIT (2nd) |
2017-05-29 10:40 |
Kyoto | Ritesumeikan University, Suzaku Campus | Superposition of Grover algorithms behind arbitral classical external force in 1DOF oscillator
-- As an example of solutions for inverse problem in Newtonian mechanics with non-conservative force -- Shigeo Kotake, Yuichiro Kawakita (Mie Univ.) |
Recently, many relations have been reported between quantum information and various physical phenomena such as Hamilton ... [more] | |
| QIT (2nd) |
2016-11-25 16:30 |
Ibaraki | KEK Kobayashi-hall | Higher-order quantum information processing by Grover search and digitalized quantum annealing Shojun Nakayama (NII), Akihito Soeda, Mio Murao (UTokyo) |
The input and output of quantum information processing may be represented by a quantum gate, in which case, the correspo... [more] | |
| 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]