Quantum search in stochastic planning

Sanjeev Naguleswaran; Langford B. White

doi:10.1117/12.609962

Translator Disclaimer

23 May 2005 Quantum search in stochastic planning

Sanjeev Naguleswaran; Langford B. White

Author Affiliations +

Proceedings Volume 5846, Noise and Information in Nanoelectronics, Sensors, and Standards III; (2005) https://doi.org/10.1117/12.609962
Event: SPIE Third International Symposium on Fluctuations and Noise, 2005, Austin, Texas, United States

Abstract

There has been recent interest in implementing automated planning by optimizing a planning domain modeled as a stochastic system. Planning is viewed as a process where sequential decision problems are solved in order to reach the goal, and thus, can be considered as instances of a Markov Decision Process (MDP). However, standard MDP techniques cannot solve a typical planning problem in polynomial time. Hence, the motivation for investigating the use of quantum search techniques based on the Grover Search Algorithm, to identify policies with high utility.

Citation Download Citation

Sanjeev Naguleswaran and Langford B. White "Quantum search in stochastic planning", Proc. SPIE 5846, Noise and Information in Nanoelectronics, Sensors, and Standards III, (23 May 2005); https://doi.org/10.1117/12.609962

ACCESS THE FULL ARTICLE