Quantum algorithmic methods for computational geometry

Mathematical Structures in Computer Science

Volumn 20, Issue 6, 2010, Pages 1117-1125

  Lanzagorta, Marco ^a   Uhlmann, Jeffrey ^b  

^a ITT CORPORATION   (United States)

^b University of Missouri   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC METHODS; BLACK BOXES; CONVEX HULL; MULTIOBJECT; QUANTUM ALGORITHMS; QUANTUM COMPUTATION;

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL LINGUISTICS; COMPUTER GRAPHICS; QUANTUM COMPUTERS; QUANTUM THEORY;

SUBROUTINES;

EID: 79251625233     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129510000411     Document Type: Article

References (5)

1. Andersson, A. and Swanson, K. (1997) On the difficulty of range searching. Computational Geometry with Applications 8 (3) 115122.
2. Boyer, M., Brassard, G., Hoyer, P. and Tapp, A. (1996) Tight bounds on quantum searching. Proceedings of the Fourth Workshop on Physics and Computation.
3. Brassard, G., Hoyer, P., Mosca, M. and Tapp, A. (2000) Quantum amplitude amplification and estimation. e-print quant-ph/0005055.
4. Nielsen, M. A. and Chuang, I.L. (2000) Quantum Computation and Quantum Information, Cambridge University Press.
5. Preparata, F. P. and Shamos, M. I. (1985) Computational Geometry, Springer-Verlag.