Quantum search in stochastic planning

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5846, Issue , 2005, Pages 34-45

  Naguleswaran, Sanjeev ^a   White, Langford B ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Dynamic Programming; Quantum Optimization; Quantum Search; Stochastic Planning

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; MARKOV PROCESSES; MATHEMATICAL MODELS; POLYNOMIALS;

DECISION PROBLEMS; QUANTUM OPTIMIZATION; QUANTUM SEARCH; STOCHASTIC PLANNING;

QUANTUM OPTICS;

EID: 28444450523     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.609962     Document Type: Conference Paper

References (11)

1. D. Bertsekas and J. Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific, Belmont, Mass., USA, 1995.
2. T. Hogg, "Quantum search heuristics," Phys. Rev. A 61, 2000.
3. T. Hogg and D. Portnov, "Quantum optimization," Information Sciences 128, 2000.
4. L. K. Grover, "Quantum mechanics helps in searching for a needle in a haystack," PRL 78, pp. 325-328, 1997.
5. S. Koenig and Y. Liu, "Sensor planning with non-linear utility functions," in Proceedings of the Fifth European Conference on Planning (ECP'99), pp. 265-277, September 1999.
6. R. S. Sutton and A. G. Barto, Reinforcement Learning, An Introduction, MIT Press, Cambridge, Massachusetts, USA, 1998.
7. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
8. E. Farhi and S. Guttman, "An analog analogue of a digital quantum computation," Phys. Rev. A 57, 1998.
9. C. Boutilier, T. Dean, and S. Hanks, "Decesion theoretic planning, structural assumptions and computational leverage," J. AI Research 11, 1999.
10. L. B. White, "A new policy evaluation algorithm for markov decesion processes having a quasi birth-death structure," Proc. Fifth Int. Workshop on Matrix Analytic Methods in Stochastic Modelling, 2005.
11. D. Aharanov, A. Ambainis, J. Kempe, and U. Vazirani, "Quantum walks on graphs," Proc. 33 ACM Symposium on Theory of Computing, 2001.