Quantum POMDPs

06/11/2014
by   Jennifer Barry, et al.
0

We present quantum observable Markov decision processes (QOMDPs), the quantum analogues of partially observable Markov decision processes (POMDPs). In a QOMDP, an agent's state is represented as a quantum state and the agent can choose a superoperator to apply. This is similar to the POMDP belief state, which is a probability distribution over world states and evolves via a stochastic matrix. We show that the existence of a policy of at least a certain value has the same complexity for QOMDPs and POMDPs in the polynomial and infinite horizon cases. However, we also prove that the existence of a policy that can reach a goal state is decidable for goal POMDPs and undecidable for goal QOMDPs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2011

Nonapproximability Results for Partially Observable Markov Decision Processes

We show that for several variations of partially observable Markov decis...
research
06/05/2019

Quantum Algorithms for Solving Dynamic Programming Problems

We present quantum algorithms for solving finite-horizon and infinite-ho...
research
01/23/2013

A Possibilistic Model for Qualitative Sequential Decision Problems under Uncertainty in Partially Observable Environments

In this article we propose a qualitative (ordinal) counterpart for the P...
research
11/28/2022

Shielding in Resource-Constrained Goal POMDPs

We consider partially observable Markov decision processes (POMDPs) mode...
research
11/05/2019

A Note on Quantum Markov Models

The study of Markov models is central to control theory and machine lear...
research
06/30/2020

Enforcing Almost-Sure Reachability in POMDPs

Partially-Observable Markov Decision Processes (POMDPs) are a well-known...
research
01/29/2018

Bounded Policy Synthesis for POMDPs with Safe-Reachability Objectives

Planning robust executions under uncertainty is a fundamental challenge ...

Please sign up or login with your details

Forgot password? Click here to reset