Please use this identifier to cite or link to this item:
http://hdl.handle.net/10071/28187
Author(s): | Bugalho. L. Coutinho, B. C. Monteiro, F. A. Omar, Y. |
Date: | 2023 |
Title: | Distributing multipartite entanglement over noisy quantum networks |
Journal title: | Quantum |
Volume: | 7 |
Reference: | Bugalho. L., Coutinho, B. C., Monteiro, F. A., & Omar, Y. (2023). Distributing multipartite entanglement over noisy quantum networks. Quantum, 7, 920. http://dx.doi.org/10.22331/q-2023-02-09-920 |
ISSN: | 2521-327X |
DOI (Digital Object Identifier): | 10.22331/q-2023-02-09-920 |
Keywords: | Routing Quantum networks Multipartite Entanglement |
Abstract: | A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories, where the links are entangled pairs. Our algorithm is optimal for GHZ states with 3 qubits, maximising simultaneously the final state fidelity and the rate of entanglement distribution. Furthermore, we determine the conditions yielding this simultaneous optimality for GHZ states with a higher number of qubits, and for other types of multipartite entanglement. Our algorithm is general also in the sense that it can optimize simultaneously arbitrary parameters. This work opens the way to optimally generate multipartite quantum correlations over noisy quantum networks, an important resource for distributed quantum technologies. |
Peerreviewed: | yes |
Access type: | Open Access |
Appears in Collections: | IT-RI - Artigos em revistas científicas internacionais com arbitragem científica |
Files in This Item:
File | Size | Format | |
---|---|---|---|
article_94618.pdf | 2,38 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.