Proceedings Paper
Quantum query complexity in computational geometry revisited| Format | Member Price | Non-Member Price |
|---|---|---|
| $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
Published in SPIE Proceedings Vol. 6244:
Quantum Information and Computation IV
Eric J. Donkor; Andrew R. Pirich; Howard E. Brandt, Editor(s)
PDF: 7 pages
Proc. SPIE 6244, Quantum Information and Computation IV, 624413 (12 May 2006); doi: 10.1117/12.661591
Show Author Affiliations
T. Lafaye, Conservatoire de Musique, Lyon (France)
R. Kulkarni, Univ. of Chicago (United States)
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
