Quantum query complexity in computational geometry revisited
Abhinav Bahadur, Christoph Dürr, Thibault Lafaye, Raghav Kulkarni · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2006
We are interested in finding quantum algorithms for problems in the area of computation geometry. Many of the problems we study have already polynomial time algorithms. Bounded error quantum algorithms can actually have sublinear running time.