Achievable Trade-Off in Network Nonlocality Sharing

• URL: http://arxiv.org/abs/2512.13357v1
• Date: Mon, 15 Dec 2025 14:10:19 GMT
• Title: Achievable Trade-Off in Network Nonlocality Sharing
• Authors: Ming-Xiao Li, Yuqi Li, Rui-Bin Xu, Mo-Ran Zhu, Haitao Ma, Chang-Yue Zhang, Zhu-Jun Zheng,
• Abstract summary: Quantum nonlocality sharing provides a crucial strategy for the resource-efficient recycling of quantum correlations.<n>We introduce a protocol based on probabilistic projective measurements to establish the entanglement threshold required to support unbounded sharing.<n>To assess practical feasibility, we compare the detectability of our protocol with weak-measurement schemes and extend the sharing protocol to realistic noise models.
• Score: 11.070310506519561
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum networks are essential for advancing scalable quantum information processing. Quantum nonlocality sharing provides a crucial strategy for the resource-efficient recycling of quantum correlations, offering a promising pathway toward scaling quantum networks. Despite its potential, the limited availability of resources introduces a fundamental trade-off between the number of sharable network branches and the achievable sequential sharing rounds. The relationship between available entanglement and the sharing capacity remains largely unexplored, which constrains the efficient design and scalability of quantum networks. Here, we establish the entanglement threshold required to support unbounded sharing across an entire network by introducing a protocol based on probabilistic projective measurements. When resources fall below this threshold, we derive an achievable trade-off between the number of sharable branches and sharing rounds. To assess practical feasibility, we compare the detectability of our protocol with weak-measurement schemes and extend the sharing protocol to realistic noise models, providing a robust framework for nonlocality recycling in quantum networks.

Related papers

• No quantum advantage without classical communication: fundamental limitations of quantum networks [0.0]
  We show that quantum networks relying on the long-distance distribution of bipartite entanglement, combined with local operations and shared randomness, cannot achieve a relevant quantum advantage.<n>Specifically, we prove that these networks do not help in preparing resourceful quantum states such as Greenberger-Horne-Zeilinger states or cluster states.
  arXiv  Detail & Related papers  (2025-03-12T15:30:02Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Quantum network-entanglement measures [0.0]
  We introduce measures of quantum network-entanglement that are well-defined within the general framework of quantum resource theories.<n>We also provide methods to estimate these measures by introducing novel witnesses of network-entanglement.
  arXiv  Detail & Related papers  (2023-11-23T11:50:09Z)
• Practical limitations on robustness and scalability of quantum Internet [0.7499722271664144]
  We study the limitations on the scaling and robustness of quantum Internet. We present practical bottlenecks for secure communication, delegated computing, and resource distribution among end nodes. For some examples of quantum networks, we present algorithms to perform different quantum network tasks of interest.
  arXiv  Detail & Related papers  (2023-08-24T12:32:48Z)
• Quantum-enhanced metrology with network states [8.515162179098382]
  We prove a general bound that limits the performance of using quantum network states to estimate a global parameter. Our work establishes both the limitation and the possibility of quantum metrology within quantum networks.
  arXiv  Detail & Related papers  (2023-07-15T09:46:35Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks [54.03701670739067]
  We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
  arXiv  Detail & Related papers  (2022-09-16T02:44:52Z)
• End-to-End Capacities of Imperfect-Repeater Quantum Networks [0.0]
  We present achievable end-to-end rates for noisy-repeater quantum networks. These are obtained by extending the coherent and reverse coherent information. We show how tight upper-bounds can also be derived by supplementing appropriate single-edge capacity bounds.
  arXiv  Detail & Related papers  (2022-07-12T11:46:54Z)
• A scheme for multipartite entanglement distribution via separable carriers [68.8204255655161]
  We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
  arXiv  Detail & Related papers  (2022-06-20T10:50:45Z)
• 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)

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.