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 |
VLD, HWS, ICD |
2024-02-29 11:15 |
Okinawa |
(Primary: On-site, Secondary: Online) |
Design of RISC-V SoC with Post-quantum Encryption Algorithm Acceleration Jiyuan Xin, Makoto Ikeda (UTokyo) VLD2023-110 HWS2023-70 ICD2023-99 |
The foundational elements of the Internet of Things (IoT) are increasingly intricate and robust Systems-on-Chips (SoCs) ... [more] |
VLD2023-110 HWS2023-70 ICD2023-99 pp.66-71 |
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 |
RECONF, VLD |
2024-01-29 15:55 |
Kanagawa |
AIRBIC Meeting Room 1-4 (Primary: On-site, Secondary: Online) |
VLD2023-88 RECONF2023-91 |
Quantum computer simulation is indispensable for quantum algorithm research since the results of real
quantum computers... [more] |
VLD2023-88 RECONF2023-91 pp.47-52 |
SCE |
2024-01-23 13:35 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
[Invited Talk]
Research on Novel Binary Neural Processing Elements Using Single Flux Quantum Circuits Zeyu Han, Zongyuan Li, Yamanashi Yuki, Yoshikawa Nobuyuki (Yokohama National Univ.) SCE2023-23 |
Superconducting convolutional neural networks, based on single flux quantum (SFQ) circuits, hold significant potential d... [more] |
SCE2023-23 pp.1-6 |
OCS, CS (Joint) |
2024-01-11 16:25 |
Kagoshima |
|
[Special Invited Talk]
Vision for Quantum Computer Network System Shota Nagayama (Keio Univ./Mercari) CS2023-97 OCS2023-61 |
Quantum communication is a new paradigm for transmitting quantum information. Photons, which are capable of carrying qua... [more] |
CS2023-97 OCS2023-61 pp.14-19(CS), pp.20-25(OCS) |
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-17 16:45 |
Okinawa |
OIST (Primary: On-site, Secondary: Online) |
Hybrid Quantum Information Processing with Squeezed Cat Codes Shohei Kiryu, Atsushi Okamoto, Akihisa Tomita (Hokkaido Univ) |
We propose a hybrid quantum computation of squeezed cat codes and qubits. Since hybrid quantum teleportation is essentia... [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-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-18 16:50 |
Okinawa |
OIST (Primary: On-site, Secondary: Online) |
Research on mathematical formulation of infinite-dimensional quantum graphical calculus model based on non-standard analysis Hironari Nagayoshi (UTokyo), Asavanant Warit (UTokyo/RIKEN), Ryuhoh Ide (UTokyo), Akira Furusawa (UTokyo/RIKEN) |
Continuous-variable quantum computation (CV-QC) is an approach for quantum computing utilizing quantum states of infinit... [more] |
|
QIT (2nd) |
2023-12-19 11:00 |
Okinawa |
OIST (Primary: On-site, Secondary: Online) |
Proposal of single-qubit logical operations for the binomial code without ancillary qubits Yuki Tanaka (Chuo Univ.), Yuichiro Mori, Yuta Shingu (AIST), Aiko Yamaguchi, Tsuyoshi Yamamoto (NEC), Yuichiro Matsuzaki (Chuo Univ.) |
Great attention has been paid to binomial codes utilizing bosonic systems as logical qubits with error-correction capabi... [more] |
|
QIT (2nd) |
2023-12-17 17:30 |
Okinawa |
OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Certified Deletion for Mult-bit Message Using Pseudorandom Functions Duo XU (NU) |
With the aid of quantum communication, one can delete messages from receiver’s memory. This is what so called Certified ... [more] |
|
QIT (2nd) |
2023-12-17 17:30 |
Okinawa |
OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Virtual entanglement distillation with virtual quantum error detection Kaoru Yamamoto, Yasunari Suzuki (NTT), Yuichiro Matsuzaki (Chuo Univ.), Yuuki Tokunaga, Suguru Endo (NTT) |
A promising approach for scalable quantum computing involves distributed
quantum computation, where small-scale remote ... [more] |
|
QIT (2nd) |
2023-12-17 17:30 |
Okinawa |
OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Improvement of Quantum Read-only Memory and its Application to Resource Evaluation for Factoring Small Integers on NISQ Devices Kiyonari Katsura, Noboru Kunihiro (Tsukuba Univ.) |
The discovery of Shor's algorithm for integer factorization has revealed the potential vulnerability of current cryptogr... [more] |
|
QIT (2nd) |
2023-12-17 17:30 |
Okinawa |
OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Loss-Assisted Space Expansion of a Photon-Based Quantum Reservoir
-- Preparatory Study for Bosonic Quantum Reservoir Computing -- Akio Yoshizawa (AIST) |
Reservoir-computing systems consist of an input layer, the reservoir, and the output layer. As opposed to the convolutio... [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] |
|