The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part II
In our previous work, we have shown that the use of a quantum architecture in decentralised control allows access to a larger space of control strategies beyond what is classically implementable through common randomness, and can lead to an improvement in the cost -- a phenomenon we called the quantum advantage. In the previous part of this two part series, we showed, however, that not all decision problems admit such an advantage. We identified a decision-theoretic property of the cost called the `coordination dilemma' as a necessary condition for the quantum advantage to manifest. In this article, we investigate the impact on the quantum advantage of a scalar parameter that captures the extent of the coordination dilemma. We show that this parameter can be bounded within an open interval for the quantum advantage to exist, and for some classes, we precisely identify this range of values. This range is found to be determined by the information of the agents.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part I
We have shown that entanglement assisted stochastic strategies allow access to strategic measures beyond the classically correlated measures accessible through passive common randomness, and thus attain a quantum advanta…
ArticlesQuantum Advantage in Multi Agent Reinforcement Learning
We present an empirical evaluation of quantum entanglement in agent coordination within quantum multi agent reinforcement learning (QMARL). While QMARL has attracted growing interest recently, most prior work evaluates q…
Reinforcement LearningLearning to Coordinate via Quantum Entanglement in Multi-Agent Reinforcement Learning
The inability to communicate poses a major challenge to coordination in multi-agent reinforcement learning (MARL). Prior work has explored correlating local policies via shared randomness, sometimes in the form of a corr…
Multi-agent Reinforcement LearningQuantum Kernels for Parity-Structured Classification: A Hybrid Pipeline
Parity (XOR) classification requires detecting discrete, high-order feature interactions that smooth classical kernels cannot efficiently capture. We study how quantum kernel advantage depends on parity complexity, the n…
Introducing Quantum-Like Influence Diagrams for Violations of the Sure Thing Principle
It is the focus of this work to extend and study the previously proposed quantum-like Bayesian networks to deal with decision-making scenarios by incorporating the notion of maximum expected utility in influence diagrams…
Decision Making