| 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 # | |
| PN | 2024-03-14 11:30 |
Kagoshima | (Primary: On-site, Secondary: Online) |
Computational Complexity of Error Correction with Classical/Quantum Parallelism Masataka Ohta (TIT)  PN2023-70 |
Errors on computations with various input arguments depend on the arguments and are, in general, different. As the diffe... [more] | PN2023-70 pp.6-9 |
| RCC, ISEC, IT, WBS | 2024-03-13 16:10 |
Osaka | Osaka Univ. (Suita Campus) | A consideration on the generation of algebraic surfaces that can evaluate the computational complexity of section-finding problem Kosuke Sakata (UTokyo), Koichiro Akiyama (Toshiba) IT2023-98 ISEC2023-97 WBS2023-86 RCC2023-80 |
We report that a method for generating algebraic surfaces, theoretically evaluable for the computational complexity of t... [more] | IT2023-98 ISEC2023-97 WBS2023-86 RCC2023-80 pp.150-157 |
| 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 |
| COMP | 2023-12-22 14:10 |
Miyazaki | Miyazaki Univ. Machinaka Campus | Efficient Enumeration of Quantum Circuits Realizing Boolean Functions by Toffoli Gate Count Shigeru Yamashita (Ritsumeikan Univ.), Takashi Horiyama (Hokkaido Univ.), Norihito Yasuda (NTT) COMP2023-22 |
Quantum Boolean circuits, which compute Boolean functions necessary for quantum computation, are commonly designed using... [more] | COMP2023-22 pp.37-44 |
| QIT (2nd) |
2023-12-18 16:20 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
Rewindable quantum computation and its equivalence to cloning and adaptive postselection Yuki Takeuchi (NTT), Ryo Hiromasa (Mitsubishi Electric Corp.), Akihiro Mizutani (Univ. of Toyama), Seiichiro Tani (NTT) |
We define rewinding operators that invert quantum measurements. Then, we define complexity classes ${¥sf RwBQP}$, ${¥sf... [more] |
|
| 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]
Reducing Quantum Communication Complexity of Linear Regression Sayaki Matsushita (Nagoya) |
Quantum coordinator model is a model that has a referee and multiple parties that can only communicate with the referee.... [more] | |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Optical Nanofiber Microcavity for Strong Coupling Quantum System Maki Maeda, Jameesh Keloth, Priscila Romagnoli, Sile Nic Chormaic (OIST) |
The strong coupling (SC) regime of optical nanofiber (ONF)-based cavity quantum electrodynamics (cQED) was only observed... [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]
Quantum Reservoir Computing Utilizing Quantum Chaotic Systems with Heisenberg XXZ Spin Chains Shu Komatsugawa, Akihisa Tomita, Atsushi Okamoto (Hokkaido Univ.) |
Reservoir Computing (RC) is a machine learning method that aims to achieve both high learning performance and low learni... [more] | |
| 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-29 15:15 |
Kyoto | Katsura Campus, Kyoto University | Exponentially tighter cost bound of quantum error mitigation in scrambling quantum circuits Kento Tsubouchi, Takahiro Sagawa, Nobuyuki Yoshioka (UTokyo) |
In this work, we provide a unified way to analyze the sample complexity of various quantum error mitigation methods usin... [more] | |
| QIT (2nd) |
2023-05-30 14:50 |
Kyoto | Katsura Campus, Kyoto University | Efficient Fault-Tolerant Approximate Quantum Fourier Transform by Precomputed Quantum States Kento Oonishi (MELCO), Noboru Kunihiro (UTsukuba) |
This paper proposes efficient approximate quantum Fourier transformunder fault-tolerant setting. Quantum Fourier transfo... [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-14 13:50 |
Yamaguchi | (Primary: On-site, Secondary: Online) |
A Proposal of Defining Fields for Efficient Ring-LWE Based Cryptography Yuya Okubo, Shinya Okumura (Osaka Univ.), Atsuko Miyaji (Osaka Univ./JAIST) IT2022-91 ISEC2022-70 WBS2022-88 RCC2022-88 |
Currently, as a post-quantum computer cryptography, cryptography based on the difficulty of solving a mathematical probl... [more] | IT2022-91 ISEC2022-70 WBS2022-88 RCC2022-88 pp.142-148 |
| RCS, SR, SRW (Joint) |
2023-03-02 10:50 |
Tokyo | Tokyo Institute of Technology, and Online (Primary: On-site, Secondary: Online) |
A Numerical Study of Quantum Speedup for Maximum Likelihood Detection of Power-Domain NOMA Masaya Norimoto, Naoki Ishikawa (Yokohama National Univ.) SR2022-86 |
We investigate whether a quantum exhaustive search algorithm, Grover adaptive search (GAS), provides quadratic speedup i... [more] | SR2022-86 pp.11-15 |
| 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) |
2022-12-08 14:00 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
[Poster Presentation]
A Note on Quantum Divide and Conquer for Minimal String Rotation Qisheng Wang (NU) |
Lexicographically minimal string rotation is a fundamental problem on string processing that has recently attracted a lo... [more] | |
| PN | 2022-11-07 10:55 |
Kochi | (Primary: On-site, Secondary: Online) |
Resource search algorithm in optical network using quantum amplitude amplification Shohei Beppu, Seiya Sumita, Shintaro Narisada, Noboru Yoshikane, Kazuhiro Saito (KDDI Research) PN2022-23 |
In recent years, Flex-grid systems, in which optical signals of multiple bandwidths are mixed together, have been consid... [more] | PN2022-23 pp.12-17 |
| QIT (2nd) |
2022-05-31 13:30 |
Online | Online | Fast decoding algorithms with Fenwick trees for surface codes under non-uniform errors Tomochika Arai (Univ. of Tokyo), Yasunari Suzuki, Yuuki Tokunaga (NTT) |
Surface codes are one of the most promising quantum error-correcting codes, and its error estimation can be rephrased as... [more] | |
[Return to Top Page]