1 citations · 1 across the 3 of their papers we have counts for
5 papers
Testing quantum Gaussianity with constant sample complexity
Mahtab Yaghubi Rad, Ricard Puig, Saksham Hassanandani +4
Efficiently testing whether a quantum state possesses a given structure is both a fundamental and a practical task in quantum information. Among the most important structured famil…
Quantum Log-Determinant Methods for Torsion-Sensitive Topological Data Analysis
Dimitrios Thanos, Caesnan Leditto, Adam Wesolowski +2
Betti numbers are central to topological data analysis but fail to capture torsion in integral homology. Torsion can distinguish topological structures with identical Betti numbers…
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…
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…
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…