10 citations · 17 across the 6 of their papers we have counts for
12 papers · 1 filter
Dequantization Barriers for Guided Stoquastic Hamiltonians
Yassine Hamoudi, Yvan Le Borgne, Shrinidhi Teganahally Sridhara
We construct a probability distribution, induced by the Perron--Frobenius eigenvector of an exponentially large graph, which cannot be efficiently sampled by any classical algorith…
A Brief Introduction to Quantum Query Complexity
Yassine Hamoudi
Quantum query complexity is a fundamental model for analyzing the computational power of quantum algorithms. It has played a key role in characterizing quantum speedups, from early…
Quantum speedup of non-linear Monte Carlo problems
Jose Blanchet, Yassine Hamoudi, Mario Szegedy +1
The mean of a random variable can be understood as a linear functional on the space of probability distributions. Quantum computing is known to provide a quadratic speedup over cla…
The NISQ Complexity of Collision Finding
Yassine Hamoudi, Qipeng Liu, Makrand Sinha
Collision-resistant hashing, a fundamental primitive in modern cryptography, ensures that there is no efficient way to find distinct inputs that produce the same hash value. This p…
Preparing Many Copies of a Quantum State in the Black-Box Model
Yassine Hamoudi
We describe a simple quantum algorithm for preparing copies of an -dimensional quantum state whose amplitudes are given by a quantum oracle. Our result extends a previous wo…
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
Arjan Cornelissen, Yassine Hamoudi
We present a novel quantum algorithm for estimating Gibbs partition functions in sublinear time with respect to the logarithm of the size of the state space. This is the first spee…