activity
20242026
most citedProvable quantum speedups for computing persistence in topological data analysis

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

collaborators
Showing 2025Show all

2 papers · 1 filter

quant-ph2025

Computational complexity of the homology problem with orientable filtration: MA-completeness

Ryu Hayakawa, Casper Gyurik, Mahtab Yaghubi Rad +1

We show the existence of an MA-complete homology problem for a certain subclass of simplicial complexes. The problem is defined through a new concept of orientability of simplicial…

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…