Translator Disclaimer
Paper
12 May 2006 Quantum query complexity in computational geometry revisited
Author Affiliations +
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
A. Bahadur, C. Dürr, T. Lafaye, and R. Kulkarni "Quantum query complexity in computational geometry revisited", Proc. SPIE 6244, Quantum Information and Computation IV, 624413 (12 May 2006); https://doi.org/10.1117/12.661591
PROCEEDINGS
7 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

A systematization of spectral data on the methanol molecule
Proceedings of SPIE (November 19 2015)
Recognizing simple polyhedron from a perspective drawing
Proceedings of SPIE (October 30 2009)
Binary quantum search
Proceedings of SPIE (April 25 2007)
Quantum modeling
Proceedings of SPIE (August 04 2003)

Back to Top