Distributing Multipartite Entanglement over Noisy Quantum Networks
Authors:
Preprint
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 optimise 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.Keywords
All Related Versions
This publication has 54 references indexed in Scilit:
- Effective routing design for remote entanglement generation on quantum networksnpj Quantum Information, 2021
- Quantum Conference Key Agreement: A ReviewAdvanced Quantum Technologies, 2020
- Linear programs for entanglement and key distribution in the quantum internetCommunications Physics, 2020
- End-to-end capacities of a quantum communication networkCommunications Physics, 2019
- Multipartite state generation in quantum networks with optimal scalingScientific Reports, 2019
- Quantum coherence of two-qubit over quantum channels with memoryQuantum Information Processing, 2017
- Quantum cryptography: Public key distribution and coin tossingTheoretical Computer Science, 2014
- Speeding up Martins’ algorithm for multiple objective shortest path problems4OR, 2013
- Random Geometric Graph Diameter in the Unit BallAlgorithmica, 2007
- On a multicriteria shortest path problemEuropean Journal of Operational Research, 1984