activity
20232026
most citedEnd-to-end complexity for simulating the Schwinger model on quantum computers

7 citations · 7 across the 5 of their papers we have counts for

collaborators

7 papers

quant-ph2026

Encoding universal quantum computation into quantized Berry phases: Hardness results and classical algorithms

Kazuki Sakamoto, Keisuke Fujii

The Berry phase is a fundamental geometric quantity for characterizing the geometry and topology of quantum many-body systems. Previous work established a super-polynomial quantum…

quant-ph2026

Chern-number estimation: nearly optimal quantum algorithm and provable quantum speedup

Soichiro Imamura, Shintaro Ae, Kazuki Sakamoto +2

Topological phases of matter are characterized by global properties of quantum states beyond conventional local order parameters. The Chern number is a central invariant in this ch…

quant-ph2025

A Quantum Algorithm for Nonlinear Electromagnetic Fluid Dynamics via Koopman-von Neumann Linearization

Hayato Higuchi, Yuki Ito, Kazuki Sakamoto +2

To simulate plasma phenomena, large-scale computational resources have been employed in developing high-precision and high-resolution plasma simulations. One of the main obstacles…

quant-ph2025

Computational complexity of Berry phase estimation in topological phases of matter

Ryu Hayakawa, Kazuki Sakamoto, Chusei Kiumi

The Berry phase is a fundamental quantity in the classification of topological phases of matter. In this paper, we present a new quantum algorithm and several complexity-theoretica…

quant-ph2025

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality

Kazuki Sakamoto, Keisuke Fujii

The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers…

quant-ph2024

Polynomial time constructive decision algorithm for multivariable quantum signal processing

Yuki Ito, Hitomi Mori, Kazuki Sakamoto +1

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) have provided a unified framework for understanding many quantum algorithms, including factorizatio…

quant-ph2023★ 7 cited

End-to-end complexity for simulating the Schwinger model on quantum computers

Kazuki Sakamoto, Hayata Morisaki, Junichi Haruna +3

The Schwinger model is one of the simplest gauge theories. It is known that a topological term of the model leads to the infamous sign problem in the classical Monte Carlo method.…