{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/distributing-graph-states-over-arbitrary","title":"Distributing Graph States Over Arbitrary Quantum Networks","arxiv_id":"1811.05445","date":"2018-11-13","proceeding":null,"authors":["Clément Meignant","Damian Markham","Frédéric Grosshans"],"abstract":"Multipartite entangled states are great resources for quantum networks. In this work we study the distribution, or routing, of entangled states over fixed, but arbitrary, physical networks. Our simplified model represents each use of a quantum channel as the sharing of a Bell pair; local operations and classical communications are considered to be free. We introduce two protocols to distribute respectively Greenberger-Horne-Zeilinger (GHZ) states and arbitrary graph states over arbitrary quantum networks. The GHZ states distribution protocol takes a single step and is optimal in terms of the number of Bell pairs used; the graph state distribution protocol uses at most twice as many Bell pairs and steps than the optimal routing protocol for the worst case scenario.","url_abs":"https://arxiv.org/abs/1811.05445v3","url_pdf":"https://arxiv.org/pdf/1811.05445v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"distributing-graph-states-over-arbitrary","repo_url":"https://github.com/BlindQlouder/PEQI","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"distributing-graph-states-over-arbitrary","repo_url":"https://github.com/francois-marie/StarExpanders","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}