Ikko Hamamura

Ikko Hamamura

Auto-generated profile, based on publicly available information

Ikko Hamamura

IBM Quantum IBM Research -Tokyo Tokyo Japan

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2023 in IEICE Transactions on Information and Systems
Verified
Journal Article
Open access
PDF file
AMAtsushi Matsuo
Atsushi Matsuo
YSYudai Suzuki
Yudai Suzuki
IHIkko Hamamura
Ikko Hamamura
Shigeru YamashitaShigeru Yamashita
Shigeru Yamashita
The Variational Quantum Eigensolver (VQE) algorithm is gaining interest for its potential use in near-term quantum devices. In the VQE algorithm, parameterized quantum circuits (PQCs) are employed to prepare quantum states, which are then utilized to compute the expectation value of a given Hamiltonian. Designing efficient PQCs is crucial for improving convergence speed. In this study, we introduce problem-specific PQCs tailored for optimization problems by dynamically generating PQCs that incorporate problem constraints. This approach reduces a search space by focusing on unitary transformations that benefit the VQE algorithm, and accelerate convergence. Our experimental results demonstrate that the convergence speed of our proposed PQCs outperforms state-of-the-art PQCs, highlighting the potential of problem-specific PQCs in optimization problems.

28 December 2023 in arXiv
Verified
Preprint
Open access
PDF file
AMAtsushi Matsuo
Atsushi Matsuo
YSYudai Suzuki
Yudai Suzuki
IHIkko Hamamura
Ikko Hamamura
Shigeru YamashitaShigeru Yamashita
Shigeru Yamashita
The Variational Quantum Eigensolver (VQE) algorithm is gaining interest for its potential use in near-term quantum devices. In the VQE algorithm, parameterized quantum circuits (PQCs) are employed to prepare quantum states, which are then utilized to compute the expectation value of a given Hamiltonian. Designing efficient PQCs is crucial for improving convergence speed. In this study, we introduce problem-specific PQCs tailored for optimization problems by dynamically generating PQCs that incorporate problem constraints. This approach reduces a search space by focusing on unitary transformations that benefit the VQE algorithm, and accelerate convergence. Our experimental results demonstrate that the convergence speed of our proposed PQCs outperforms state-of-the-art PQCs, highlighting the potential of problem-specific PQCs in optimization problems.