Entanglement thresholds for sequential nonlocality sharing in star networks

Abstract:Quantum networks promise scalable distributed quantum information processing. Realizing this potential depends critically on the efficient use of nonclassical resources. Sequential sharing of quantum nonlocality provides a resource-efficient route for recycling entanglement across multiple observers. In network settings, however, such recycling is typically constrained by a trade-off between the number of active branches and the achievable sharing depth. Here we investigate this problem in star networks using probabilistic projective measurements. We establish an explicit entanglement threshold above which nonlocality can be shared across all branches up to any target depth, and below which we determine the optimal trade-off between the number of active branches and the achievable number of sequential rounds. We further analyze the protocol's robustness to noise and its experimental observability, clarifying its practical feasibility. These results establish quantitative design principles and entanglement requirements for scalable nonlocality recycling in quantum networks.

arXiv:2512.13357 [quant-ph]

(or arXiv:2512.13357v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2512.13357 Focus to learn more arXiv-issued DOI via DataCite

Phys. Rev. Research 8, 033274 (2026)

https://doi.org/10.1103/26rt-yvpn Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.