Noncooperative Quantum Networks

• URL: http://arxiv.org/abs/2512.15884v1
• Date: Wed, 17 Dec 2025 19:00:55 GMT
• Title: Noncooperative Quantum Networks
• Authors: Yanxuan Shao, Jannik L. Wyss, Don Towsley, Adilson E. Motter,
• Abstract summary: We show that for noncooperative LOCC protocols, the resulting fidelity may decrease as more entanglement is added to a network with non-pure states.<n>This effect results from a quantum analog of selfish routing and constitutes a potential obstacle to the optimal use of resources in large quantum networks.
• Score: 6.941576274157406
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Existing protocols for quantum communication networks usually assume an initial allocation of quantum entanglement resources, which are then manipulated through local operations and classical communication (LOCC) to establish high-fidelity entanglement between distant parties. It is generally held that the resulting fidelity would increase monotonically with the entanglement budget. Here, we show that for noncooperative LOCC protocols, the resulting fidelity may decrease as more entanglement is added to a network with non-pure states. This effect results from a quantum analog of selfish routing and constitutes a potential obstacle to the optimal use of resources in large quantum networks.

Related papers

• Satellite-Aided Entanglement Distribution for Optimized Quantum Networks [30.362736262973463]
  Quantum internet needs to ensure timely provision of entangled qubits to be used in tasks that involve distributed quantum computing or sensing.<n>Pre-distribution of entanglements should aim to minimize the amount of qubits used, as this decreases the risk of decoherence and thus degradation of the entangled state.<n>Satellite-aided Entanglement Distribution (SED) can significantly enhance the performance of small quantum networks.
  arXiv  Detail & Related papers  (2025-02-25T11:21:20Z)
• eQMARL: Entangled Quantum Multi-Agent Reinforcement Learning for Distributed Cooperation over Quantum Channels [98.314893665023]
  Quantum computing has sparked a potential synergy between quantum entanglement and cooperation in multi-agent environments.<n>Current state-of-the-art quantum MARL (QMARL) implementations rely on classical information sharing.<n>eQMARL is a distributed actor-critic framework that facilitates cooperation over a quantum channel.
  arXiv  Detail & Related papers  (2024-05-24T18:43:05Z)
• Quantum Random Access Codes Implementation for Resource Allocation and Coexistence with Classical Telecommunication [32.73124984242397]
  Modern quantum networks have limited capacity to distribute resources among different users. We experimentally test our encoding and decoding strategy from the resource allocation perspective. By emulating a coexistent classical communication, we test the resilience of our implementation in presence of noise.
  arXiv  Detail & Related papers  (2024-03-27T20:46:50Z)
• Quantum Networks Enhanced by Distributed Quantum Memories [0.0]
  We show that a network-wide synergistic usage of quantum memories distributed in a quantum communication network offers a fundamental advantage. We first map the problem of quantum communication with local usage of memories into a classical continuum percolation model. This improved mapping can be formulated in terms of graph-merging rules, analogous to the decimation rules of the renormalization group treatment of disordered quantum magnets.
  arXiv  Detail & Related papers  (2024-03-25T02:16:25Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Learning Quantum Entanglement Distillation with Noisy Classical Communications [39.000858564696856]
  entanglement distillation aims to enhance the fidelity of entangled qubits through local operations and classical communication. Existing distillation protocols assume the availability of ideal, noiseless, communication channels. In this paper, we study the case in which communication takes place over noisy binary symmetric channels.
  arXiv  Detail & Related papers  (2022-05-17T18:10:16Z)
• Entanglement and Causal Relation in distributed quantum computation [0.0]
  We investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC) In the first part, we analyze implementable computation over a given quantum network resource by introducing a new concept, quantum network coding for quantum computation. In the second part, we show that entanglement required for local state discrimination can be substituted by less entanglement by increasing the rounds of classical communication.
  arXiv  Detail & Related papers  (2022-02-14T07:23:17Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• 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)
• The Computational and Latency Advantage of Quantum Communication Networks [70.01340727637825]
  This article summarises the current status of classical communication networks. It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
  arXiv  Detail & Related papers  (2021-06-07T06:31:02Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)

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.