3 papers
quant-ph2025
Universal approximation of continuous functions with minimal quantum circuits
Adrián Pérez-Salinas, Mahtab Yaghubi Rad, Alice Barthe +1
The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for cla…
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…