| 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 |
| VLD, HWS, ICD | 2024-03-01 15:30 |
Okinawa | (Primary: On-site, Secondary: Online) |
A Pipelined NTT Transformer and its Extension Scheme Designed for the Digital Signature Scheme Crystals-Dilithium Pengfei Sun, Makoto Ikeda (Tokyo Univ.) VLD2023-130 HWS2023-90 ICD2023-119 |
As quantum computing advances, it threatens the security of current encryption algorithms, making Post-Quantum Cryptogra... [more] | VLD2023-130 HWS2023-90 ICD2023-119 pp.161-166 |
| OCS, CS (Joint) |
2024-01-11 13:25 |
Kagoshima | Studies for Quantum-Classic Hybrid Systems Employing Logics and Algorithms in Digital Communications Shota Koshikawa, Aruto Hosaka, Shota Nishikawa, Yoshiaki Konishi (MELCO), Motoya Shinozaki, Tomohiro Otsuka, Hasitha Muthumala Waidyasooriya, Masanori Hariyama (Tohoku Univ.), Tsuyoshi Yoshida (MELCO) CS2023-94 |
Quantum computing would potentially solve kinds of problems in various fields extremely faster than classic computing ba... [more] | CS2023-94 pp.6-9 |
|
| QIT (2nd) |
2023-12-17 17:00 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
Recursive construction of quantum eigenvalue/singular-value transformation Kaoru Mizuta (UTokyo), Keisuke Fujii (Osaka Univ.) |
Quantum eigenvalue/singular-value transformation (QET/QSVT) has attracted much interest as grand uni cation of quantum ... [more] |
|
| QIT (2nd) |
2023-12-17 17:15 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
Quantum circuit for simulating the Schwinger model Kazuki Sakamoto, Hayata Morisaki, Junichi Haruna (Osaka Univ.), Etsuko Itou (Kyoto Univ./RIKEN), Keisuke Fujii (Osaka Univ./RIKEN), Kosuke Mitarai (Osaka Univ.) |
The Schwinger model is one of the simplest gauge theories. It is known that a topological term of the model leads to the... [more] | |
| QIT (2nd) |
2023-12-18 14:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
Advantage of Quantum Machine Learning from General Computational Advantages Hayata Yamasaki, Natsuto Isogai, Mio Murao (UTokyo) |
Demonstrating the existence of general learning problems where machine learning using quantum computers exhibits rigorou... [more] | |
| QIT (2nd) |
2023-12-18 16:05 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
Multiplexed Inter-node Communication in Distributed Quantum Computing Soshun Naito (Univ. of Tokyo), Yasunari Suzuki, Yuuki Tokunaga (NTT) |
In fault-tolerant quantum computing, a large number of physical qubits are required to construct a single logical qubit,... [more] | |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Analyze convergence of Quantum-Neural -Networks in the over-parametrized regime Kaito Tanaka (Keio Univ.), Naoki Yamamoto (KQCC) |
Quantum neural networks (QNN) are one of the quantum-classical hybrid algorithms, which can be realized with the current... [more] | |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Quantum Circuit Preparation for Loading Probability Distributions Using Label Swapping Yuichi Sano (Kyoto Univ.), Ikko Hamamura (IBM) |
Quantum state preparation is an essential subroutine in many quantum algorithms, such as quantum algorithm for Monte Car... [more] | |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Optimal statistical ensembles for thermal state preparation Yasushi Yoneta (RIKEN) |
We develop efficient quantum algorithms for thermal state preparation by utilizing generalized ensembles. We provide a d... [more] | |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Solving Not-All-Equal 3SAT using Quantum Random Access Optimization Benedek Hauer, Rudy Raymond, Hiroshi Imai (UTokyo) |
Quadratic unconstrained binary optimization (QUBO) is one of target applications of near-term quantum algorithms with ma... [more] | |
| CCS | 2023-11-11 15:00 |
Toyama | Toyama Prefectural University | [Invited Talk]
Quantum-Annealing-Inspired Swarm-Intelligence-Like Simulated Annealing Algorithm Akio Yoshizawa (AIST) CCS2023-29 |
Quantum-inspired classical algorithms for combinatorial optimization have been attracting great attention recently. The ... [more] | CCS2023-29 pp.25-30 |
| SCE | 2023-10-31 09:35 |
Miyagi | RIEC, Tohoku Univ. (Primary: On-site, Secondary: Online) |
Design and demonstration of multipliers using adiabatic quantum-flux-parametron Yu Hoshika, Shohei Takagi, Tomoyuki Tanaka (YNU), Christopher L. Ayala, Nobuyuki Yoshikawa (YNU-IAS) SCE2023-16 |
Adiabatic quantum-flux-parametron (AQFP) logic is an emerging superconducting circuit technology, which is superior in t... [more] | SCE2023-16 pp.21-25 |
| EMM, BioX, ISEC, SITE, ICSS, HWS, IPSJ-CSEC, IPSJ-SPT [detail] | 2023-07-24 18:20 |
Hokkaido | Hokkaido Jichiro Kaikan | Implementation of Shor's algorithm for the discrete logarithm problem and experiments using the quantum computer simulator Kaito Kishi, Junpei Yamaguchi, Tetsuya Izu (Fujitsu Research), Noboru Kunihiro (Univ. of Tsukuba) ISEC2023-32 SITE2023-26 BioX2023-35 HWS2023-32 ICSS2023-29 EMM2023-32 |
Classical polynomial-time algorithms for solving the discrete logarithm problem (DLP) over a prime field have not been f... [more] | ISEC2023-32 SITE2023-26 BioX2023-35 HWS2023-32 ICSS2023-29 EMM2023-32 pp.119-126 |
| QIT (2nd) |
2023-05-29 10:10 |
Kyoto | Katsura Campus, Kyoto University | A computational complexity assumption necessary for pseudorandom quantum states generators Yuki Shirakawa (Kyoto Univ.) |
Pseudorandom quantum states generators (PRSGs) are efficient quantum algorithms that output quantum states which are com... [more] | |
| QIT (2nd) |
2023-05-30 10:00 |
Kyoto | Katsura Campus, Kyoto University | A new initial distribution for qGAN to load probability distributions Yuichi Sano, Ryosuke Koga (Kyoto Univ.), Masaya Abe, Kei Nakagawa (Nomura Asset Management) |
Quantum computers are gaining attention for their ability to solve certain problems faster than classical computers, and... [more] | |
| QIT (2nd) |
2023-05-30 10:45 |
Kyoto | Katsura Campus, Kyoto University | Design of multi-controlled qubit gates using qutrits and challenges for implementation to IBM Quantum Rikuto Ojima, Yutaro Iiyama, Wonho Jang (Tokyo Univ.), Naoki Kanazawa, Tamiya Onodera (TRL), Koji Terashi (Tokyo Univ.) |
The multi-controlled bit gate is ubiquitous for quantum algorithms, and is an essential gate for superconducting quantum... [more] | |
| QIT (2nd) |
2023-05-30 11:15 |
Kyoto | Katsura Campus, Kyoto University | Acceleration of Quantum Circuit Simulation through Low-level Optimization Nilton Filho, Taketoshi Iyota (Soka Univ.) |
Simulating quantum computation on a classical computer has many applications, including verification of quantum algorith... [more] | |
| QIT (2nd) |
2023-05-29 16:30 |
Kyoto | Katsura Campus, Kyoto University | [Poster Presentation]
Improvement of QAOA for Solving TSP Efficiently Hiroki Akita, Hiroshi Sekigawa, Wataru Takeda (TUS) |
Quantum Approximate Optimization Algorithm (QAOA) is one of the most known quantum algorithms made for solving optimizat... [more] | |
| COMP, IPSJ-AL | 2023-05-11 10:00 |
Hokkaido | Hokkaido University | A computational complexity assumption necessary for pseudorandom quantum states generators Yuki Shirakawa (Kyoto Univ.) COMP2023-2 |
Pseudorandom quantum states generators (PRSGs) are efficient quantum algorithms that output quantum states which are com... [more] | COMP2023-2 pp.2-7 |
[Return to Top Page]