Share Email Print

Proceedings Paper

Quantum computational geometry
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The prospects for practical quantum computing have improved significantly over the past few years, and there is an increasing motivation for developing quantum algorithms to address problems that are presently impractical to solve using classical computing. In previous work we have indentified such problems in the areas of computer graphics applications, and we have derived quantum-based solutions. In this paper we examine quantum-based solutions to problems arising in the area of computational geometry. These types of problems are important in a variety of scientific, industrial and military applications such as large scale multi-object simulation, virtual reality systems, and multi-target tracking. In particular, we present quantum algorithms for multidimensional searches, convex hull construction, and collision detection.

Paper Details

Date Published: 24 August 2004
PDF: 8 pages
Proc. SPIE 5436, Quantum Information and Computation II, (24 August 2004);
Show Author Affiliations
Marco Lanzagorta, Naval Research Lab. (United States)
Jeffrey K. Uhlmann, Univ. of Missouri/Columbia (United States)

Published in SPIE Proceedings Vol. 5436:
Quantum Information and Computation II
Eric 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?