Quantum query complexity in computational geometry revisited

Abhinav Bahadur, Christoph Dürr, Thibault Lafaye, Raghav KulkarniProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 2006 · DOI

Abstract

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.
BibTeX
@inproceedings{bahadur2006quantum,
  author = {Abhinav Bahadur and Christoph Dürr and Thibault Lafaye and Raghav Kulkarni},
  title = {{Quantum query complexity in computational geometry revisited}},
  booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
  year = {2006},
  doi = {10.1117/12.661591},
}

Loading related content...

Figure