logN) Quantum Algorithm for the 1-dimensional Closest-Pair Problem


We present an algorithm for solving the closest pair problem using O(N log N) queries. This improves the simple approach using Dürr and Høyer’s minimum algorithm which would result in O(N) queries. The classical deterministic and probabilistic complexity is, respectively, of O(N logN) and O(N) queries. We also show a quantum lower bound of Ω(N) queries for… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics