Quantum walks, automata, and structured search

Sanjeev Naguleswaran; Ian Fuss; Langford B. White

doi:10.1117/12.726332

7 June 2007 Quantum walks, automata, and structured search

Sanjeev Naguleswaran, Ian Fuss, Langford B. White

Proceedings Volume 6603, Noise and Fluctuations in Photonics, Quantum Optics, and Communications; 66030P (2007) https://doi.org/10.1117/12.726332
Event: SPIE Fourth International Symposium on Fluctuations and Noise, 2007, Florence, Italy

Abstract

We explore the application of a quantum algorithm to optimisation problems over a structured space. For example, problems in automated planning can be represented as automata. These automata are shown to posses algebraic structure that can be exploited by a quantum period finding algorithm. The fact that the quantum walk also provides exponential speed-up over these same structures is of particular interest and results of our investigation will be presented.

Citation Download Citation

Sanjeev Naguleswaran, Ian Fuss, and Langford B. White "Quantum walks, automata, and structured search", Proc. SPIE 6603, Noise and Fluctuations in Photonics, Quantum Optics, and Communications, 66030P (7 June 2007); https://doi.org/10.1117/12.726332

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