Quantum Strategies for Rendezvous and Domination Tasks on Graphs with Mobile Agents
arXiv:2311.11817 · doi:10.1103/PhysRevA.109.042201
Abstract
This paper explores the application of quantum non-locality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on a novel application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a new distributed task for mobile agents grounded in the graph domination problem. Through an investigation across various graph scenarios, we showcase the quantum advantage. Additionally, we scrutinize deterministic strategies, highlighting their comparatively lower efficiency compared to quantum strategies. The paper concludes with a numerical analysis, providing further insights into our findings.
References in corpus (17)
- Quantum entanglement
- Bell nonlocality
- Advances in Quantum Cryptography
- Steering, Entanglement, Nonlocality, and the EPR Paradox
- Random Numbers Certified by Bell's Theorem
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- Quantum Steering
- Bounding the set of quantum correlations
- Almost quantum correlations
- Maximal violation of the I3322 inequality using infinite dimensional quantum systems
- Algorithm 950: Ncpol2sdpa---Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables
- Semidefinite Programming in Quantum Information Science
- Nonlocality of All Quantum Networks
- Semi-definite programming and quantum information
- Steering is an essential feature of non-locality in quantum theory
- Generalized XOR games with outcomes and the task of non-local computation
- Entangled Rendezvous: A Possible Application of Bell Non-Locality For Mobile Agents on Networks