Purification and Entanglement Routing on Quantum Networks

We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2020-11
Hauptverfasser: Victora, Michelle, Krastanov, Stefan, Alexander Sanchez de la Cerda, Willis, Steven, Narang, Prineha
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Victora, Michelle
Krastanov, Stefan
Alexander Sanchez de la Cerda
Willis, Steven
Narang, Prineha
description We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constraints, in an effort to inform future design choices for quantum network configurations. Our work optimizes both the choice of path over the quantum network and the choice of purification schemes used between nodes. We consider not only pair-production rate, but optimize over the fidelity of the delivered entangled state. We introduce effective heuristics enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network, with performance comparable to that of a computationally-expensive brute-force path search.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2464276379</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2464276379</sourcerecordid><originalsourceid>FETCH-proquest_journals_24642763793</originalsourceid><addsrcrecordid>eNqNyrEKwjAUQNEgCBbtPwScC_UlTe0sFSdRcS-hpiW1fdHkBX_fDn6A0x3OXbAEhNhlewmwYmkIQ57noEooCpGw6hK97WyryTrkGh-8RtLYj2YySPzmIlns-WzXqJHixM-GPs4_w4YtOz0Gk_66ZttjfT-cspd372gCNYOLHmdqQCoJpRJlJf67vrcRNvE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2464276379</pqid></control><display><type>article</type><title>Purification and Entanglement Routing on Quantum Networks</title><source>Free E- Journals</source><creator>Victora, Michelle ; Krastanov, Stefan ; Alexander Sanchez de la Cerda ; Willis, Steven ; Narang, Prineha</creator><creatorcontrib>Victora, Michelle ; Krastanov, Stefan ; Alexander Sanchez de la Cerda ; Willis, Steven ; Narang, Prineha</creatorcontrib><description>We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constraints, in an effort to inform future design choices for quantum network configurations. Our work optimizes both the choice of path over the quantum network and the choice of purification schemes used between nodes. We consider not only pair-production rate, but optimize over the fidelity of the delivered entangled state. We introduce effective heuristics enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network, with performance comparable to that of a computationally-expensive brute-force path search.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Bandwidths ; Computer architecture ; Entangled states ; Network topologies ; Nodes ; Optimization ; Purification ; Quantum entanglement</subject><ispartof>arXiv.org, 2020-11</ispartof><rights>2020. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>781,785</link.rule.ids></links><search><creatorcontrib>Victora, Michelle</creatorcontrib><creatorcontrib>Krastanov, Stefan</creatorcontrib><creatorcontrib>Alexander Sanchez de la Cerda</creatorcontrib><creatorcontrib>Willis, Steven</creatorcontrib><creatorcontrib>Narang, Prineha</creatorcontrib><title>Purification and Entanglement Routing on Quantum Networks</title><title>arXiv.org</title><description>We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constraints, in an effort to inform future design choices for quantum network configurations. Our work optimizes both the choice of path over the quantum network and the choice of purification schemes used between nodes. We consider not only pair-production rate, but optimize over the fidelity of the delivered entangled state. We introduce effective heuristics enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network, with performance comparable to that of a computationally-expensive brute-force path search.</description><subject>Algorithms</subject><subject>Bandwidths</subject><subject>Computer architecture</subject><subject>Entangled states</subject><subject>Network topologies</subject><subject>Nodes</subject><subject>Optimization</subject><subject>Purification</subject><subject>Quantum entanglement</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNyrEKwjAUQNEgCBbtPwScC_UlTe0sFSdRcS-hpiW1fdHkBX_fDn6A0x3OXbAEhNhlewmwYmkIQ57noEooCpGw6hK97WyryTrkGh-8RtLYj2YySPzmIlns-WzXqJHixM-GPs4_w4YtOz0Gk_66ZttjfT-cspd372gCNYOLHmdqQCoJpRJlJf67vrcRNvE</recordid><startdate>20201123</startdate><enddate>20201123</enddate><creator>Victora, Michelle</creator><creator>Krastanov, Stefan</creator><creator>Alexander Sanchez de la Cerda</creator><creator>Willis, Steven</creator><creator>Narang, Prineha</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20201123</creationdate><title>Purification and Entanglement Routing on Quantum Networks</title><author>Victora, Michelle ; Krastanov, Stefan ; Alexander Sanchez de la Cerda ; Willis, Steven ; Narang, Prineha</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_24642763793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Bandwidths</topic><topic>Computer architecture</topic><topic>Entangled states</topic><topic>Network topologies</topic><topic>Nodes</topic><topic>Optimization</topic><topic>Purification</topic><topic>Quantum entanglement</topic><toplevel>online_resources</toplevel><creatorcontrib>Victora, Michelle</creatorcontrib><creatorcontrib>Krastanov, Stefan</creatorcontrib><creatorcontrib>Alexander Sanchez de la Cerda</creatorcontrib><creatorcontrib>Willis, Steven</creatorcontrib><creatorcontrib>Narang, Prineha</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Engineering Database</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Victora, Michelle</au><au>Krastanov, Stefan</au><au>Alexander Sanchez de la Cerda</au><au>Willis, Steven</au><au>Narang, Prineha</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Purification and Entanglement Routing on Quantum Networks</atitle><jtitle>arXiv.org</jtitle><date>2020-11-23</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constraints, in an effort to inform future design choices for quantum network configurations. Our work optimizes both the choice of path over the quantum network and the choice of purification schemes used between nodes. We consider not only pair-production rate, but optimize over the fidelity of the delivered entangled state. We introduce effective heuristics enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network, with performance comparable to that of a computationally-expensive brute-force path search.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2020-11
issn 2331-8422
language eng
recordid cdi_proquest_journals_2464276379
source Free E- Journals
subjects Algorithms
Bandwidths
Computer architecture
Entangled states
Network topologies
Nodes
Optimization
Purification
Quantum entanglement
title Purification and Entanglement Routing on Quantum Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T22%3A39%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Purification%20and%20Entanglement%20Routing%20on%20Quantum%20Networks&rft.jtitle=arXiv.org&rft.au=Victora,%20Michelle&rft.date=2020-11-23&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2464276379%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2464276379&rft_id=info:pmid/&rfr_iscdi=true