Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2004.06040 · Quantum Machine Intelligence

K-spin Hamiltonian for quantum-resolvable Markov decision processes

Eric B. Jones, Peter A Graf, Eliot Kapit, Wesley B. Jones

Published Oct 30, 2020• 2 citations
arXivHTMLPDF
DOI
10.1007/s42484-020-00026-6

Related papers

Reachability analysis of quantum Markov decision processes

Shenggang Ying, Mingsheng Ying

arXiv:1406.6146•Information and Computation•Sep 5, 2018•37 citations

A quantum walk framework for multialternative decision making

Jiaqi Adam Huang, Jerome R. Busemeyer

Recent findings of Markov violations challenge Markov random walk processes for decision making. On the other hand, quantum walk processes explain these Markov violations in a natural way, but they have only been applied to binary alternative decision making. In this work, we propose a general framework for extending quantum walk processes to multi-alternative decision making. The multi-alternative quantum walk model operates in a direct sum space of the alternatives, with Hamiltonian built for each pair of alternatives to model context effects. Order effects come naturally from the matrix non-commutativity of the Hamiltonians. Future works built on this framework can connect parameters of the models with the expected utilities.

•May 1, 2022•0 citations

On quantum Markovian processes

Andrzej Posiewnik

Reports on Mathematical Physics•Oct 1, 1977•1 citation

Quantum Markov Processes

Burkhard Kümmerer

Lecture notes in physics•Jan 1, 2002•21 citations

Quantum partially observable Markov decision processes

Jennifer Barry, Daniel T. Barry, Scott Aaronson

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.

arXiv:1406.2858•Physical Review A•Sep 9, 2014•74 citations

Quantum Information Processing Explanation for Interactions between Inferences and Decisions.

Jerome R. Busemeyer, Zheng Wang

Markov and quantum information processing models are compared with respect to their capability of explaining two different puzzling findings from empirical research on human inference and decision making. Both findings involve a task that requires making an inference about one of two possible uncertain states, followed by decision about two possible courses of action. Two conditions are compared: under one condition, the decisions are obtained after discovering or measuring the uncertain state; under another condition, choices are obtained before resolving the uncertainty so that the state remains unknown or unmeasured. Systematic departures from the Markov model are observed, and these deviations are explained as interference effects using the quantum model. Quantum computing and information theory (Neilsen & Chuang, 2000) provides exciting new possibilities for computer science. But what importance does this new theory have for cognitive science? This is a question that is beginning to be asked by an increasing number researchers from a variety of fields including language (Gabora &

National Conference on Artificial Intelligence•Jan 1, 2007•39 citations
Recent findings of Markov violations challenge Markov random walk processes for decision making. On the other hand, quantum walk processes explain these Markov violations in a natural way, but they have only been applied to binary alternative decision making. In this work, we propose a general framework for extending quantum walk processes to multi-alternative decision making. The multi-alternative quantum walk model operates in a direct sum space of the alternatives, with Hamiltonian built for each pair of alternatives to model context effects. Order effects come naturally from the matrix non-commutativity of the Hamiltonians. Future works built on this framework can connect parameters of the models with the expected utilities.
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.
Markov and quantum information processing models are compared with respect to their capability of explaining two different puzzling findings from empirical research on human inference and decision making. Both findings involve a task that requires making an inference about one of two possible uncertain states, followed by decision about two possible courses of action. Two conditions are compared: under one condition, the decisions are obtained after discovering or measuring the uncertain state; under another condition, choices are obtained before resolving the uncertainty so that the state remains unknown or unmeasured. Systematic departures from the Markov model are observed, and these deviations are explained as interference effects using the quantum model. Quantum computing and information theory (Neilsen & Chuang, 2000) provides exciting new possibilities for computer science. But what importance does this new theory have for cognitive science? This is a question that is beginning to be asked by an increasing number researchers from a variety of fields including language (Gabora &