Quantum algorithms for optimal graph traversal problems

Sebastian Dörn

doi:10.1117/12.719158

25 April 2007 Quantum algorithms for optimal graph traversal problems

Sebastian Dörn

Proceedings Volume 6573, Quantum Information and Computation V; 65730D (2007) https://doi.org/10.1117/12.719158
Event: Defense and Security Symposium, 2007, Orlando, Florida, United States

Abstract

We study the quantum complexity of algorithms for optimal graph traversal problems. We look at eulerian tours, optimal postman tours, approximation of travelling salesman tours and self avoiding walks. We present quantum algorithms and quantum lower bounds for these problems. Our results improve the best classical algorithms for the corresponding problems.

Citation Download Citation

Sebastian Dörn "Quantum algorithms for optimal graph traversal problems", Proc. SPIE 6573, Quantum Information and Computation V, 65730D (25 April 2007); https://doi.org/10.1117/12.719158

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