# Cost and Routing of Continuous Variable Quantum Networks

### Résumé

We study continuous-variable graph states as quantum communication networks. We explore graphs with regular and complex network shapes distributed among different agents and we report for their cost as a global measure of squeezing and number of squeezed modes that are necessary to build the network. We show that the trend of the squeezing cost presents a non-trivial scaling with the size of the network strictly dependent on its topology. We devise a routing protocol based on local quadrature measurements for reshaping the network in order to perform teleportation protocol between two arbitrary nodes of the networks. The \textit{Routing} protocol, which is based on wire-shortening over parallel paths among the nodes, improves the final entanglement between the two nodes in a considerable amount of cases, and it is particularly efficient in running-time for complex sparse networks.

Publication
Cost and Routing of Continuous Variable Quantum Networks

We study continuous-variable graph states as quantum communication networks. We explore graphs with regular and complex network shapes distributed among different agents and we report for their cost as a global measure of squeezing and number of squeezed modes that are necessary to build the network. We show that the trend of the squeezing cost presents a non-trivial scaling with the size of the network strictly dependent on its topology. We devise a routing protocol based on local quadrature measurements for reshaping the network in order to perform teleportation protocol between two arbitrary nodes of the networks. The \textit{Routing} protocol, which is based on wire-shortening over parallel paths among the nodes, improves the final entanglement between the two nodes in a considerable amount of cases, and it is particularly efficient in running-time for complex sparse networks.
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9281308054924011, "perplexity": 586.8657136499149}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500273.30/warc/CC-MAIN-20230205161658-20230205191658-00528.warc.gz"}