Entangled Rendezvous: A Possible Application of Bell Non-Locality For Mobile Agents on Networks

• URL: http://arxiv.org/abs/2207.14404v1
• Date: Thu, 28 Jul 2022 23:04:48 GMT
• Title: Entangled Rendezvous: A Possible Application of Bell Non-Locality For Mobile Agents on Networks
• Authors: Piotr Mironowicz
• Abstract summary: 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. 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Nonlocality activation in a photonic quantum network [0.44270590458998854]
  Bell nonlocality is crucial for device-independent technologies like quantum key distribution and randomness generation. We show that single copies of Bell-local states can give rise to nonlocality after being embedded into a quantum network of multiple parties. Our findings have fundamental implications for nonlocality and enable the practical use of nonlocal correlations in real-world applications.
  arXiv  Detail & Related papers  (2023-09-12T18:14:49Z)
• Nondestructive discrimination of Bell states between distant parties [3.3764180740316543]
  We present a scheme for discriminating an arbitrary Bell state distributed to two distant parties without destroying it. We show that our scheme can surpass classical bounds when applied to practical quantum processor.
  arXiv  Detail & Related papers  (2023-09-02T08:54:34Z)
• Bell inequalities with overlapping measurements [52.81011822909395]
  We study Bell inequalities where measurements of different parties can have overlap. This allows to accommodate problems in quantum information. The scenarios considered show an interesting behaviour with respect to Hilbert space dimension, overlap, and symmetry.
  arXiv  Detail & Related papers  (2023-03-03T18:11:05Z)
• Sharing Quantum Nonlocality in Star Network Scenarios [0.0]
  The nonlocality of quantum network states is more complex than the Bell nonlocality. For the star network scenarios, we present for the first time comprehensive results on the nonlocality sharing properties of quantum network states.
  arXiv  Detail & Related papers  (2022-10-12T07:50:19Z)
• No graph state is preparable in quantum networks with bipartite sources and no classical communication [0.0]
  We show that graph states of an arbitrary prime local dimension known for their numerous applications in quantum information cannot be generated in a quantum network. We then generalise our result to arbitrary quantum states that are sufficiently close to graph states.
  arXiv  Detail & Related papers  (2022-08-25T13:59:48Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.