Search
Abstract
This paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative 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 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.
Citations
-
1
CrossRef
-
0
Web of Science
-
1
Scopus
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1103/PhysRevA.109.042201
- License
- Copyright (2024 American Physical Society)
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
PHYSICAL REVIEW A
no. 109,
ISSN: 2469-9926 - Language:
- English
- Publication year:
- 2024
- Bibliographic description:
- Viola G., Mironowicz P.: Quantum strategies for rendezvous and domination tasks on graphs with mobile agents// PHYSICAL REVIEW A -,iss. 4 (2024),
- DOI:
- Digital Object Identifier (open in new tab) 10.1103/physreva.109.042201
- Sources of funding:
-
- Free publication
- Verified by:
- Gdańsk University of Technology
seen 62 times
Recommended for you
How to meet when you forget: log-space rendezvous in arbitrary graphs
- J. Czyzowicz,
- A. Kosowski,
- A. Pelc
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
- S. Das,
- D. Dereniowski,
- A. Kosowski
- + 1 authors
Quantum-assisted rendezvous on graphs: explicit algorithms and quantum computer simulations
- J. Tucker,
- P. Strange,
- P. Mironowicz
- + 1 authors