Effective routing design for remote entanglement generation on quantum networks

Abstract Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the netw...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Changhao Li, Tianyi Li, Yi-Xiang Liu, Paola Cappellaro
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2021
Materias:	Physics QC1-999 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/d171c9f51abf4ca3a66d107a462d59f9
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:d171c9f51abf4ca3a66d107a462d59f9
record_format	dspace
spelling	oai:doaj.org-article:d171c9f51abf4ca3a66d107a462d59f92021-12-02T13:24:27ZEffective routing design for remote entanglement generation on quantum networks10.1038/s41534-020-00344-42056-6387https://doaj.org/article/d171c9f51abf4ca3a66d107a462d59f92021-01-01T00:00:00Zhttps://doi.org/10.1038/s41534-020-00344-4https://doaj.org/toc/2056-6387Abstract Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network’s capabilities, the solution to which calls for delicate network design and is currently at the primitive stage. In this study we propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations on a quantum lattice network with finite edge capacities. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification. The routing scheme is highly modularized with a flexible nature, embedding quantum operations within the algorithmic workflow, whose performance is evaluated from multiple perspectives. In particular, three algorithms are proposed and compared for the scheduling of capacity allocation on the edges of quantum network. Embodying the ideas of proportional share and progressive filling that have been well-studied in classical routing problems, we design another scheduling algorithm, the propagatory update method, which in certain aspects overrides the two algorithms based on classical heuristics in scheduling performances. The general solution scheme paves the road for effective design of efficient routing and flow control protocols on applicational quantum networks.Changhao LiTianyi LiYi-Xiang LiuPaola CappellaroNature PortfolioarticlePhysicsQC1-999Electronic computers. Computer scienceQA75.5-76.95ENnpj Quantum Information, Vol 7, Iss 1, Pp 1-12 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Physics QC1-999 Electronic computers. Computer science QA75.5-76.95
spellingShingle	Physics QC1-999 Electronic computers. Computer science QA75.5-76.95 Changhao Li Tianyi Li Yi-Xiang Liu Paola Cappellaro Effective routing design for remote entanglement generation on quantum networks
description	Abstract Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network’s capabilities, the solution to which calls for delicate network design and is currently at the primitive stage. In this study we propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations on a quantum lattice network with finite edge capacities. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification. The routing scheme is highly modularized with a flexible nature, embedding quantum operations within the algorithmic workflow, whose performance is evaluated from multiple perspectives. In particular, three algorithms are proposed and compared for the scheduling of capacity allocation on the edges of quantum network. Embodying the ideas of proportional share and progressive filling that have been well-studied in classical routing problems, we design another scheduling algorithm, the propagatory update method, which in certain aspects overrides the two algorithms based on classical heuristics in scheduling performances. The general solution scheme paves the road for effective design of efficient routing and flow control protocols on applicational quantum networks.
format	article
author	Changhao Li Tianyi Li Yi-Xiang Liu Paola Cappellaro
author_facet	Changhao Li Tianyi Li Yi-Xiang Liu Paola Cappellaro
author_sort	Changhao Li
title	Effective routing design for remote entanglement generation on quantum networks
title_short	Effective routing design for remote entanglement generation on quantum networks
title_full	Effective routing design for remote entanglement generation on quantum networks
title_fullStr	Effective routing design for remote entanglement generation on quantum networks
title_full_unstemmed	Effective routing design for remote entanglement generation on quantum networks
title_sort	effective routing design for remote entanglement generation on quantum networks
publisher	Nature Portfolio
publishDate	2021
url	https://doaj.org/article/d171c9f51abf4ca3a66d107a462d59f9
work_keys_str_mv	AT changhaoli effectiveroutingdesignforremoteentanglementgenerationonquantumnetworks AT tianyili effectiveroutingdesignforremoteentanglementgenerationonquantumnetworks AT yixiangliu effectiveroutingdesignforremoteentanglementgenerationonquantumnetworks AT paolacappellaro effectiveroutingdesignforremoteentanglementgenerationonquantumnetworks
_version_	1718393121922875392

Effective routing design for remote entanglement generation on quantum networks

Ejemplares similares