# Robust quantum minimum finding with an application to hypothesis selection

26 Mar 2020Yihui QuekClement CanonnePatrick Rebentrost

We consider the problem of finding the minimum element in a list of length $N$ using a noisy comparator. The noise is modelled as follows: given two elements to compare, if the values of the elements differ by at least $\alpha$ by some metric defined on the elements, then the comparison will be made correctly; if the values of the elements are closer than $\alpha$, the outcome of the comparison is not subject to any guarantees... (read more)

PDF Abstract

No code implementations yet. Submit your code now