The role of quantum correlations in cop and robber game

DOI10.1007/S40509-017-0148-4zbMATH Open1425.91080arXiv1702.07932OpenAlexW3103661596WikidataQ59610082 ScholiaQ59610082MaRDI QIDQ2329935FDOQ2329935

Authors: Adam Glos, Jarosław Adam Miszczak 

Publication date: 18 October 2019

Published in: Quantum Studies: Mathematics and Foundations (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1702.07932

Recommendations

• Noise controlling entangling operators in the quantum network implementation of cop and robber game
• Quantum strategic game theory
• Quantum games with correlated noise
• NON-CLASSICAL QUANTUM CORRELATIONS IN QUANTUM GAMES
• Quantum correlation games

zbMATH Keywords

combinatorial gamesquantum entanglementquantum networks

Mathematics Subject Classification ID

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)

Cites Work

• An invitation to quantum game theory
• Quantum Games and Quantum Strategies
• Cops and robbers in graphs with large girth and Cayley graphs
• Vertex-to-vertex pursuit in a graph
• Pursuit-evasion in models of complex networks
• The game of cops and robbers on graphs
• Title not available (Why is that?)
• Simultaneously moving cops and robbers
• A deterministic version of the game of zombies and survivors on graphs
• Cooperative quantum Parrondo's games
• A probabilistic version of the game of zombies and survivors on graphs
• Title not available (Why is that?)
• Almost all cop-win graphs contain a universal vertex
• The Princess and Monster Differential Game
• Rabbit and hunter game: Two discrete stochastic formulations
• Quantum walks on directed graphs
• Lively quantum walks on cycles
• Title not available (Why is that?)
• The “Princess and Monster” Game on an Interval

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)