activity
20242026
most citedUniversal approximation of continuous functions with minimal quantum circuits

1 citations · 1 across the 3 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

Quantum Advantage in Learning Quantum Dynamics via Fourier coefficient extraction

Alice Barthe, Mahtab Yaghubi Rad, Michele Grossi +1

One of the key challenges in quantum machine learning is finding relevant machine learning tasks with a provable quantum advantage. A natural candidate for this is learning unknown…