{"paper":{"title":"Path Percolation in Quantum Communication Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bal\\'azs R\\'ath, Bingjie Hao, Istv\\'an A. Kov\\'acs, Xiangyi Meng","submitted_at":"2024-06-18T03:07:01Z","abstract_excerpt":"In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, communication channels can be established between them via quantum routing protocols. However, in contrast to classical communication networks, each communication event removes all participating links along the communication path, disrupting the quantum network. Here, we propose a simple model, where randomly selected pairs of nodes communicate through shortest paths. Each time such a path is used, all participating links "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12228","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.12228/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}