Translator Disclaimer
7 June 2007 Quantum walks, automata, and structured search
Author Affiliations +
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Time-optimal quantum control via differential geometry
Proceedings of SPIE (February 19 2017)
Quantum models of Parrondo's games
Proceedings of SPIE (November 12 2002)
Is quantum parallelism real?
Proceedings of SPIE (April 02 2008)

Back to Top