Quantum computational geometry

Marco Lanzagorta; Jeffrey K. Uhlmann

doi:10.1117/12.541624

24 August 2004 Quantum computational geometry

Proceedings Volume 5436, Quantum Information and Computation II; (2004) https://doi.org/10.1117/12.541624
Event: Defense and Security, 2004, Orlando, Florida, United States

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.

Citation Download Citation

Marco Lanzagorta and Jeffrey K. Uhlmann "Quantum computational geometry", Proc. SPIE 5436, Quantum Information and Computation II, (24 August 2004); https://doi.org/10.1117/12.541624

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available