Quantum Algorithm for the Fixed-Radius Neighbor Search
Neighbor search is a computationally demanding problem, usually both time- and memory-consuming. The main problem of these kinds of algorithms is the long execution time due to cache misses. In this work, we propose a quantum algorithm for the Fixed–Radius Neighbor Search problem (FRANS) based on the fixed-point versio...