The role of quantum correlations in cop and robber game
From MaRDI portal
Publication:2329935
Games on graphs (graph-theoretic aspects) (05C57) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Combinatorial games (91A46)
Abstract: We introduce and study quantized versions of Cop and Robber game. We achieve this by using graph-preserving quantum operations, which are the quantum analogues of stochastic operations preserving the graph. We provide the tight bound for the number of operations required to reach the given state. By extending them to the controlled operations, we define a quantum-controlled Cop and Robber game, which expands the classical Cop and Robber game, as well as the classically controlled quantum Cop and Robber game. In contrast to the typical scheme for introducing quantum games, we assume that both parties can utilise full information about the opponent's strategy. We show that the utilisation of the full knowledge about the opponent's state does not provide the advantage. Moreover, the chances of catching the Robber decrease for classical cop-win graphs. This result does not depend on the chosen model of evolution. On the other hand, the possibility to execute controlled quantum operations allows catching the Robber on almost all classical cop-win graphs. By this, we demonstrate that it is necessary to enrich the structure of correlations between the players' systems to provide a non-trivial quantized Cop and Robber game. Thus the quantum controlled operations offer a significant advantage over the classically controlled quantum operations.
Recommendations
Cites work
- scientific article; zbMATH DE number 7447795 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 6180528 (Why is no real title available?)
- A deterministic version of the game of zombies and survivors on graphs
- A probabilistic version of the game of zombies and survivors on graphs
- Almost all cop-win graphs contain a universal vertex
- An invitation to quantum game theory
- Cooperative quantum Parrondo's games
- Cops and robbers in graphs with large girth and Cayley graphs
- Lively quantum walks on cycles
- Pursuit-evasion in models of complex networks
- Quantum Games and Quantum Strategies
- Quantum walks on directed graphs
- Rabbit and hunter game: Two discrete stochastic formulations
- Simultaneously moving cops and robbers
- The Princess and Monster Differential Game
- The game of cops and robbers on graphs
- The “Princess and Monster” Game on an Interval
- Vertex-to-vertex pursuit in a graph
Cited in
(5)- Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
- Noise controlling entangling operators in the quantum network implementation of cop and robber game
- Effect of noise in the quantum network implementation of cop and robber game
- Implementation of sequential game on quantum circuits
- An exact quantum algorithm for a restricted subtraction game
This page was built for publication: The role of quantum correlations in cop and robber game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329935)
