By Topic

Applications of quantum algorithms to partially observable Markov decision processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rosenwald, R.D. ; Raytheon Missile Syst., Tucson, AZ, USA ; Meyer, D.A. ; Schmitt, H.A.

Due to the enormous processing gains that are theoretically achievable by using quantum algorithms instead of classical algorithms to solve rather generic classes of numerical problems, it makes sense that one should evaluate their potential applicability, appropriateness, and efficiency for solving virtually any computationally intensive task. Since many types of control and optimization problems may be couched in terms of partially observable Markov decision processes (POMDPs), and since solutions to these types of problems are invariably extremely difficult to obtain, the use of quantum algorithms to help solve POMDP problems is investigated here. Quantum algorithms are indeed found likely to provide significant efficiency improvements in several computationally intensive tasks associated with solving POMDPs, particularly in the areas of searching, optimization, and parameter optimization and estimation.

Published in:

Control Conference, 2004. 5th Asian  (Volume:1 )

Date of Conference:

20-23 July 2004