activity
20242026
most citedQuantum Speedup of the Dispersion and Codebook Design Problems

11 citations · 12 across the 10 of their papers we have counts for

collaborators

10 papers

quant-ph2026

Efficient Quantum Circuit Construction of Controlled Time-Evolution for Arbitrary Pauli-Sum Hamiltonians

Shintaro Fujiwara, Naoki Yamamoto, Naoki Ishikawa

Controlled time-evolution circuits select forward or backward Hamiltonian time evolution according to the state of an ancilla qubit. They are fundamental building blocks in quantum…

eess.SP2026

Penalty-Free Two-Step Optimization of Higher-Order Ising Problems for Two-Dimensional Line-Controlled RIS

Tasuku Okamoto, Naoki Ishikawa, Daisuke Kitayama +5

Reconfigurable intelligent surfaces (RISs) are often assumed to allow continuous phase control over all elements, leading to hardware cost that scales with the number of elements.…

cs.IT2026

Scalable and Near-Optimal Discrete Phase Shift Optimization for Reconfigurable Intelligent Surfaces with Over 20,000 Elements

Yuto Hama, Daisuke Kitayama, Kensuke Inaba +4

This paper proposes a novel optimization framework for discrete phase shifts of a reconfigurable intelligent surface (RIS) using a coherent Ising machine (CIM). Unlike conventional…

eess.SP2025★ 1 cited

Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications

Naoki Ishikawa, Giuseppe Thadeu Freitas de Abreu, Petar Popovski +1

Quantum computing is poised to redefine the algorithmic foundations of communication systems. While quantum superposition and entanglement enable quadratic or exponential speedups…

quant-ph2024

Quantum Speedup for Polar Maximum Likelihood Decoding

Shintaro Fujiwara, Naoki Ishikawa

Conventional decoding algorithms for polar codes strive to balance achievable performance and computational complexity in classical computing. While maximum likelihood (ML) decodin…

quant-ph2024

Grover Adaptive Search for the Higher-Order Formulation of Quadratic Assignment Problems

Taku Mikuriya, Shintaro Fujiwara, Kein Yukiyoshi +2

We demonstrate that the search space of the quadratic assignment problem (QAP), known as an NP-hard combinatorial optimization problem, can be reduced using Grover adaptive search…

quant-ph2024

Grover Adaptive Search with Spin Variables

Shintaro Fujiwara, Naoki Ishikawa

This paper presents a novel approach to Grover adaptive search (GAS) for a combinatorial optimization problem whose objective function involves spin variables. While the GAS algori…

eess.SP2024

Grover Adaptive Search for Maximum Likelihood Detection of Generalized Spatial Modulation

Kein Yukiyoshi, Taku Mikuriya, Hyeon Seok Rou +2

We propose a quantum-assisted solution for the maximum likelihood detection (MLD) of generalized spatial modulation (GSM) signals. Specifically, the MLD of GSM is first formulated…

quant-ph2024★ 11 cited

Quantum Speedup of the Dispersion and Codebook Design Problems

Kein Yukiyoshi, Taku Mikuriya, Hyeon Seok Rou +2

We propose new formulations of max-sum and max-min dispersion problems that enable solutions via the Grover adaptive search (GAS) quantum algorithm, offering quadratic speedup. Dis…

eess.SP2024

AFDM Chirp-Permutation-Index Modulation with Quantum-Accelerated Codebook Design

Hyeon Seok Rou, Kein Yukiyoshi, Taku Mikuriya +2

We describe a novel index modulation (IM) scheme exploiting a unique feature of the recently proposed affine frequency division multiplexing (AFDM) in doubly-dispersive (DD) channe…