Masakazu Iwamura

A Quantum Algorithm for Finding $k$-Minima

2019 · arXiv (Cornell University)

We propose a new finding $k$-minima algorithm and prove that its query complexity is $\mathcal{O}(\sqrt{kN})$, where $N$ is the number of data indices. Though the complexity is equivalent to that of an existing method, the …