Papers › Bounding the sets of classical and quantum correlations in networks
Bounding the sets of classical and quantum correlations in networks
Alejandro Pozas-Kerstjens, Rafael Rabelo, Łukasz Rudnicki, Rafael Chaves, Daniel Cavalcanti, Miguel Navascues, Antonio Acín
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present a method that allows the study of classical and quantum correlations in networks with causally-independent parties, such as the scenario underlying entanglement swapping. By imposing relaxations of factorization constraints in a form compatible with semidefinite programming, it enables the use of the Navascu\'es-Pironio-Ac\'in hierarchy in complex quantum networks. We first show how the technique successfully identifies correlations not attainable in the entanglement-swapping scenario. Then we use it to show how the nonlocal power of measurements can be activated in a network: there exist measuring devices that, despite being unable to generate nonlocal correlations in the standard Bell scenario, provide a classical-quantum separation in an entanglement swapping configuration.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections