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, 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

A systematization of spectral data on the methanol molecule
Proceedings of SPIE (November 19 2015)
Data fusion in entangled networks of quantum sensors
Proceedings of SPIE (May 02 2017)
Recognizing simple polyhedron from a perspective drawing
Proceedings of SPIE (October 30 2009)
Finite temperature quantum algorithm and majorization
Proceedings of SPIE (March 27 2008)
Invariant quantum ensemble metrics
Proceedings of SPIE (May 25 2005)

Back to Top