Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCC, ISEC, IT, WBS |
2024-03-14 09:55 |
Osaka |
Osaka Univ. (Suita Campus) |
New Algorithms for Computing a Correct Decoding Probability Exponent and an Error Decoding Probability Exponent with Cost Constraints and their Equivalency Koki Kazama (Waseda Univ.), Akira Kamatsuka (Shonan Institute of Technology), Takahiro Yoshida (Nihon Univ.) IT2023-110 ISEC2023-109 WBS2023-98 RCC2023-92 |
In channel coding, there are two representative previous algorithms for computing cost-constrained correct decoding prob... [more] |
IT2023-110 ISEC2023-109 WBS2023-98 RCC2023-92 pp.232-237 |
VLD, HWS, ICD |
2024-02-29 16:20 |
Okinawa |
(Primary: On-site, Secondary: Online) |
[Memorial Lecture]
Logic Locking over TFHE for Securing User Data and Algorithms Kohei Suemitsu, Kotaro Matsuoka, Takashi Sato, Masanori Hashimoto (Kyoto Univ.) VLD2023-118 HWS2023-78 ICD2023-107 |
This paper proposes the application of logic locking over TFHE to protect both user data and algorithms, such as input u... [more] |
VLD2023-118 HWS2023-78 ICD2023-107 p.100 |
QIT (2nd) |
2023-12-17 17:30 |
Okinawa |
OIST (Primary: On-site, Secondary: Online) |
On the quantum space complexity of $S$-unit group computation Iu-Iong Ng (Nagoya Univ.) |
In this paper, we calculate the quantum space complexity of the $S$-unit group computation quantum algorithm proposed by... [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]
Calculation of imaginary time evolution Hiroki Kuji, Yuta Shingu, Tetsuro Nikuni (TUS), Yuichiro Matsuzaki (Chuo Univ.) |
Many methods have been proposed to compute the imaginary-time evolution with high accuracy using a fault-tolerant quantu... [more] |
|
VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] |
2023-11-17 10:00 |
Kumamoto |
Civic Auditorium Sears Home Yume Hall (Primary: On-site, Secondary: Online) |
CiM-based Low-bit Neural Network Accelerator Design Method with automatic I/O range optimization Ayumu Yamada, Naoko Misawa, Chihiro Matsui, Ken Takeuchi (Univ. of Tokyo) VLD2023-68 ICD2023-76 DC2023-75 RECONF2023-71 |
A neural network training algorithm, LIORAT, is proposed to improve the efficiency of neural network accelerators with R... [more] |
VLD2023-68 ICD2023-76 DC2023-75 RECONF2023-71 pp.198-199 |
LOIS, SITE, ISEC |
2023-11-09 12:40 |
Hiroshima |
Satellite Campus Hiroshima (Primary: On-site, Secondary: Online) |
Private-preserving encoding and decoding using variable-length coding schemes Yuki Seto, Kunihiko Sadakane, Kazunari Tozawa (UTokyo) ISEC2023-55 SITE2023-49 LOIS2023-13 |
Variable-length segmented bit-vectors are commonly used in variable-length coding schemes and the construction of succin... [more] |
ISEC2023-55 SITE2023-49 LOIS2023-13 pp.2-9 |
NLP, CAS |
2023-10-07 13:20 |
Gifu |
Work plaza Gifu |
Proposal and evaluation of a distributed lasso algorithm based on alternating direction multiplier method Naoki Toda, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) CAS2023-55 NLP2023-54 |
Lasso is widely known as a sparse estimation method for regression coefficients in linear regression models, and the Alt... [more] |
CAS2023-55 NLP2023-54 pp.111-116 |
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 |
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 14:15 |
Kyoto |
Katsura Campus, Kyoto University |
Circuit optimization of quantum phase estimation with Pauli product set Yuki Koizumi (Tokyo Univ.), Yasunari Suzuki, Yuuki Tokunaga (NTT CD Labs) |
Quantum phase estimation is a quantum algorithm that can extract Hamiltonian spectra, and it is suggested as one of the ... [more] |
|
QIT (2nd) |
2023-05-29 16:30 |
Kyoto |
Katsura Campus, Kyoto University |
[Poster Presentation]
Improving the Performance of Quantum GANs through Label Replacement Ryosuke Koga, Yuichi Sano (Kyoto Univ.), Ikko Hamamura (IBM) |
Instead of Monte Carlo simulations for numerical integration, we can use a quantum expectation estimation algorithm, whi... [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 |
RCC, ISEC, IT, WBS |
2023-03-15 10:20 |
Yamaguchi |
(Primary: On-site, Secondary: Online) |
Efficient composition of encoding polynomial in distributed coded computing scheme Daisuke Hibino, Tomoharu Shibuya (Sophia Univ.) IT2022-119 ISEC2022-98 WBS2022-116 RCC2022-116 |
Distributed computing is one of the powerful solutions for computational tasks that need the massive size of dataset. La... [more] |
IT2022-119 ISEC2022-98 WBS2022-116 RCC2022-116 pp.325-330 |
SeMI, IPSJ-UBI, IPSJ-MBL |
2023-03-01 16:40 |
Aichi |
(Primary: On-site, Secondary: Online) |
Study of Deep Reinforcement Learning for Wireless Multihop Networks Cui Zhihan, Khun Aung thura phyo, Lim Yuto, Tan Yasuo (JAIST) SeMI2022-113 |
In beyond 5G network, the device-to-device communications has been actively studied. These devices are wirelessly connec... [more] |
SeMI2022-113 pp.37-42 |
EST |
2023-01-27 14:50 |
Okinawa |
(Primary: On-site, Secondary: Online) |
Electromagnetic Field Analysis of The Human Body Based on Domain Decomposition Parallel Finite Element Method Nanako Mizoguchi, Amane Takei (UoM) EST2022-100 |
In n a high-frequency electromagnetic field analysis, it is necessary to divide the space by elements with a maximum sid... [more] |
EST2022-100 pp.129-132 |
QIT (2nd) |
2022-05-31 13:10 |
Online |
Online |
Compiler Backend for Surface Code Quantum Computing by Lattice Surgery Ryo Wakizaka (Kyoto Univ), Yasunari Suzuki, Yuuki Tokunaga (NTT) |
Recently, surface code using lattice surgery has been studied widely because it may realize large-scale and fault-tolera... [more] |
|
QIT (2nd) |
2022-05-30 13:30 |
Online |
Online |
[Poster Presentation]
Toward Realization of a Two-dimensional Quantum Walk with Helical Boundary Conditions I
-- Generation and Evaluation of Petal-shaped Beams -- Yutaro Okamoto (Kyoto Univ.), Hideaki Obuse (Hokkaido Univ.), Shigeki Takeuchi, Ryo Okamoto (Kyoto Univ.) |
Quantum walk is a quantum version of random walk and is expected to have applications in quantum simulation and quantum ... [more] |
|