Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
From MaRDI portal
Publication:6042397
DOI10.1088/1367-2630/ACB22DzbMATH Open1510.81030arXiv2207.14404OpenAlexW4315605897MaRDI QIDQ6042397FDOQ6042397
Authors: Piotr Mironowicz 
Publication date: 10 May 2023
Published in: New Journal of Physics (Search for Journal in Brave)
Abstract: Rendezvous is an old problem of assuring that two or more parties, initially separated, not knowing the position of each other, and not allowed to communicate, meet without pre-agreement on the meeting point. This problem has been extensively studied in classical computer science and has vivid importance to modern applications like coordinating a fleet of drones in an enemy's territory. Quantum non-locality, like Bell inequality violation, has shown that in many cases quantum entanglement allows for improved coordination of two separated parties compared to classical sources. The non-signaling correlations in many cases even strengthened such phenomena. In this work, we analyze, how Bell non-locality can be used by asymmetric location-aware agents trying to rendezvous on a finite network with a limited number of steps. We provide the optimal solution to this problem for both agents using quantum resources, and agents with only ``classical computing power. Our results show that for cubic graphs and cycles it is possible to gain an advantage by allowing the agents to use assistance of entangled quantum states.
Full work available at URL: https://arxiv.org/abs/2207.14404
Recommendations
Quantum coherence, entanglement, quantum correlations (81P40) Entanglement measures, concurrencies, separability criteria (81P42)
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- Search-and-rescue rendezvous
- Quantum entanglement
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proposed experiment to test local hidden-variable theories
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Asynchronous deterministic rendezvous in graphs
- The Uncertainty Principle Determines the Nonlocality of Quantum Mechanics
- Steering, entanglement, nonlocality, and the Einstein-Podolsky-Rosen paradox
- Deterministic Rendezvous in Trees with Little Memory
- Rendezvous search when marks are left at the starting points
- Title not available (Why is that?)
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Minimax Rendezvous on the Line
- Title not available (Why is that?)
- The Rendezvous Search Problem
- The rendezvous problem on discrete locations
- A glance beyond the quantum model
- Title not available (Why is that?)
- Title not available (Why is that?)
- Search Theory
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- Quantum pseudo-telepathy
- Focal points in pure coordination games: An experimental investigation
- Rendezvous search on the interval and the circle
- Rendezvous Search: A Personal Perspective
- Quantum games: a review of the history, current state, and interpretation
- Rendezvous search on the line with bounded resources: Expected time minimization
- Synchronous rendezvous for location-aware agents
- Tell Me Where I Am So I Can Meet You Sooner
- Rendezvous Search on the Line with More Than Two Players
- Rendezvous Search on the Line with Distinguishable Players
- Survey on nonlocal games and operator space theory
- Quantum communication complexity advantage implies violation of a Bell inequality
- A search problem on a bipartite network
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting
- Symmetry Breaking in the Plane
- Rendezvous in Higher Dimensions
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- ENTANGLEMENT-ASSISTED ORIENTATION IN SPACE
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
- Gathering in the plane of location-aware robots in the presence of spies
Cited In (1)
This page was built for publication: Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042397)
