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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.