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, A. Bahadur, C. Dürr, C. Dürr, T. Lafaye, T. Lafaye, R. Kulkarni, R. Kulkarni, } "Quantum query complexity in computational geometry revisited", Proc. SPIE 6244, Quantum Information and Computation IV, 624413 (12 May 2006); doi: 10.1117/12.661591; https://doi.org/10.1117/12.661591
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT

Recognizing simple polyhedron from a perspective drawing
Proceedings of SPIE (October 29 2009)
Finite temperature quantum algorithm and majorization
Proceedings of SPIE (March 26 2008)
Quantum modeling
Proceedings of SPIE (August 03 2003)
Invariant quantum ensemble metrics
Proceedings of SPIE (May 24 2005)

Back to Top