Quantum Algorithms for Solving Geometric 3SUM-Hard Problems and Beyond

This paper presents quantum algorithms that can solve various geometric 3SUM-hard problems, such as finding a triangle with area at most q, finding a unit disk that covers at least q points, and determining interval containment, in O(n^(1+o(1))) time, where n is the input size.