| 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 # | |
| 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 |
| 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 18:00 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
Quantum subspace expansion based on fermionic shadow tomography for k-RDM estimation Nayuta Takemori (Osaka Univ.), Nobuyuki Yoshioka (Tokyo Univ.), Wataru Mizukami (Osaka Univ.) |
The reduced density matrix in quantum many-body systems is extremely useful in elaborating physical properties, as it co... [more] | |
| QIT (2nd) |
2022-12-09 17:45 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
Success probability of quantum phase estimation algorithms using approximate quantum Fourier transforms Kiyonari Katsura, Noboru Kunihiro (Tsukuba Univ.) |
It is known that the RSA can be solved in realistic time by Shor's algorithm with the large-scale quantum computer. In o... [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] | |
| SDM | 2022-11-10 16:15 |
Online | Online | [Invited Talk]
A study on the development of nanoscale device simulation method based on the use of gate-type quantum computing algorithm Satofumi Souma, Shingo Matsuo, Takuya Ishibashi (Kobe Univ.) SDM2022-69 |
We present an implementation study of gate-type quantum computing algorithms for the purpose of semiconductor device s... [more] |
SDM2022-69 pp.23-27 |
| SCE | 2022-08-09 09:35 |
Online | Online | Design of Energy-Efficient Adiabatic Quantum-Flux-Parametron Multiplier Families Shohei Takagi, Tomoyuki Tanaka (YNU), Christopher Ayala, Nobuyuki Yoshikawa (IAS,YNU) SCE2022-1 |
Adiabatic Quantum Flux Parametron (AQFP) circuits are characterized by a power dissipation of 5 to 6 orders less than CM... [more] | SCE2022-1 pp.1-5 |
| 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] | |
| 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] | |
| VLD, HWS [detail] | 2022-03-07 11:25 |
Online | Online | Design and Measurement of Crypto Processor for Post Quantum Cryptography CRYSTALS-Kyber Taishin Shimada, Makoto Ikeda (Univ. of Tokyo) VLD2021-81 HWS2021-58 |
CRYSTALS-Kyber is one of the public key cryptosystems being considered as a public key cryptosystem after the advent of ... [more] | VLD2021-81 HWS2021-58 pp.31-36 |
| QIT (2nd) |
2021-11-30 09:50 |
Online | Online | Study on quantum algorithms for gradient estimation of integer polynomials Shinichi Mizuhara (Univ. of Tokyo), Yutaro Iiyama (ICEPP), Shoji Asai (Univ. of Tokyo) |
Although efficient quantum algorithms for computing gradients of real functions already exist, they tend to be applicabl... [more] | |
| QIT (2nd) |
2021-11-30 10:30 |
Online | Online | Quantum computational approach for topological data analysis
-- Quantum algorithm for persistent Betti numbers -- Ryu Hayakawa (Kyoto Univ.) |
Topological data analysis (TDA) based on persistent homology is an emergent field of data analysis. The critical step of... [more] | |
| QIT (2nd) |
2021-05-24 12:10 |
Online | Online | Tighter lower bounds of the error probability of multiple quantum channel discrimination Ryo Ito, Ryuhei Mori (Tokyo Tech) |
We give lower bounds of the error probability of general multiple quantum channel discrimination problem for a given num... [more] | |
| QIT (2nd) |
2021-05-24 16:20 |
Online | Online | Generating time domain linear cluster state by recycling superconducting qubits Shotaro Shirai (TUS), Yu Zhou (RIKEN), Keiichi Sakata, Hiroto Mukai, Jaw-Shen Tsai (TUS) |
In quantum information processing, the many-body entangled state is a useful resource state, and the generation of a lar... [more] | |
| QIT (2nd) |
2021-05-25 10:30 |
Online | Online | On Efficiencies of Two TPCP maps Discrimination using Quantum Queries Takehisa Iwakoshi (Mie Univ.) |
This study analyses the efficiency of three strategies to discriminate two Trace-Preserving Completely Positive maps (TP... [more] | |
| COMP, IPSJ-AL | 2021-05-08 13:30 |
Online | Online | [Invited Talk]
Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project Shin-ichi Minato (Kyoto Univ.) COMP2021-8 |
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] | COMP2021-8 p.54 |
| SCE | 2021-01-19 14:35 |
Online | Online | Design and Evaluation of Random Number Generators Based on Non-Adiabatic Quantum-Flux-Parametron Gates Wenhui Luo, Naoki Takeuchi, Olivia Chen, Nobuyuki Yoshikawa (Yokohama Natl. Univ.) SCE2020-20 |
We propose a random number generator (RNG) using non-adiabatic quantum-flux-parametron (QFP) gates. The RNG is a simple ... [more] | SCE2020-20 pp.19-23 |
| QIT (2nd) |
2020-12-10 16:10 |
Online | Online | Quantum error mitigation for fault-tolerant quantum computing Yasunari Suzuki, Suguru Endo (NTT), Keisuke Fujii (Osaka Univ.), Yuuki Tokunaga (NTT) |
Fault-tolerant quantum computing (FTQC) implements universal quantum computing while suppressing physical errors via qua... [more] | |
| QIT (2nd) |
2020-12-10 17:10 |
Online | Online | Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams Seiichiro Tani (NTT) |
An ordered binary decision diagram (OBDD) is a directed acyclic graph that represents a Boolean function. Since OBDDs h... [more] |
|
| 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 |
[Return to Top Page]