Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks

DOI10.1088/1367-2630/ACB22DzbMATH Open1510.81030OpenAlexW4315605897MaRDI QIDQ6042397FDOQ6042397

Authors Piotr Mironowicz 

Publication date 10 May 2023

Published in New Journal of Physics (Search for Journal in Brave)

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

zbMATH Keywords

quantum entanglementquantum nonlocalityrendezvous on graphs

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Entanglement measures, concurrencies, separability criteria (81P42)

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.

Recommendations

• ENTANGLEMENT-ASSISTED ORIENTATION IN SPACE
• Quantum entanglement and communication complexity
• Nonlinear Bell inequalities tailored for quantum networks
• Revealing advantage in a quantum network
• Towards characterizing the non-locality of entangled quantum states

Cites work

• scientific article; zbMATH DE number 6009880 (Why is no real title available?)
• scientific article; zbMATH DE number 4057247 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2038783 (Why is no real title available?)
• scientific article; zbMATH DE number 2102782 (Why is no real title available?)
• scientific article; zbMATH DE number 3046665 (Why is no real title available?)
• A glance beyond the quantum model
• A search problem on a bipartite network
• Asynchronous deterministic rendezvous in graphs
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
• Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Deterministic Rendezvous in Trees with Little Memory
• ENTANGLEMENT-ASSISTED ORIENTATION IN SPACE
• Focal points in pure coordination games: An experimental investigation
• Gathering in the plane of location-aware robots in the presence of spies
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Minimax Rendezvous on the Line
• On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
• Proposed experiment to test local hidden-variable theories
• Quantum communication complexity advantage implies violation of a Bell inequality
• Quantum entanglement
• Quantum games: a review of the history, current state, and interpretation
• Quantum pseudo-telepathy
• Rendezvous Search on the Line with Distinguishable Players
• Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting
• Rendezvous Search on the Line with More Than Two Players
• Rendezvous Search: A Personal Perspective
• Rendezvous in Higher Dimensions
• Rendezvous search on the interval and the circle
• Rendezvous search on the line with bounded resources: Expected time minimization
• Rendezvous search when marks are left at the starting points
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Search Theory
• Search-and-rescue rendezvous
• Semidefinite Programming
• Steering, entanglement, nonlocality, and the Einstein-Podolsky-Rosen paradox
• Survey on nonlocal games and operator space theory
• Symmetry Breaking in the Plane
• Synchronous rendezvous for location-aware agents
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Tell Me Where I Am So I Can Meet You Sooner
• The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
• The Rendezvous Search Problem
• The Uncertainty Principle Determines the Nonlocality of Quantum Mechanics
• The rendezvous problem on discrete locations
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(1)

• ENTANGLEMENT-ASSISTED ORIENTATION IN SPACE

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)