Share Email Print

Proceedings Paper

Quantum query complexity in computational geometry revisited
Author(s): A. Bahadur; C. Dürr; T. Lafaye; R. Kulkarni
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 12 May 2006
PDF: 7 pages
Proc. SPIE 6244, Quantum Information and Computation IV, 624413 (12 May 2006); doi: 10.1117/12.661591
Show Author Affiliations
A. Bahadur, Indian Institute of Technology Bombay (India)
C. Dürr, LRI, Univ. Paris-Sud II (France)
T. Lafaye, Conservatoire de Musique, Lyon (France)
R. Kulkarni, Univ. of Chicago (United States)

Published in SPIE Proceedings Vol. 6244:
Quantum Information and Computation IV
Eric J. Donkor; Andrew R. Pirich; Howard E. Brandt, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?