Quantum query complexity in computational geometry revisited

A. Bahadur; C. Dürr; T. Lafaye; R. Kulkarni

doi:10.1117/12.661591

12 May 2006 Quantum query complexity in computational geometry revisited

A. Bahadur, C. Dürr, T. Lafaye, R. Kulkarni

Proceedings Volume 6244, Quantum Information and Computation IV; 624413 (2006) https://doi.org/10.1117/12.661591
Event: Defense and Security Symposium, 2006, Orlando (Kissimmee), Florida, United States

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.

Citation Download Citation

A. Bahadur, C. Dürr, T. Lafaye, and R. Kulkarni "Quantum query complexity in computational geometry revisited", Proc. SPIE 6244, Quantum Information and Computation IV, 624413 (12 May 2006); https://doi.org/10.1117/12.661591

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