Multipartite multiplexing strategies for quantum routers

Abstract

This work explores the important role of quantum routers in communication networks and investigates the increase in efficiency using memories and multiplexing strategies. Motivated by the bipartite setup introduced by Abruzzo et al. (2013) for finite-range multiplexing in quantum repeaters, we extend the study to an N-partite network with a router as a central station. We present a general protocol for N parties after defining the underlying matching problem and we calculate the router rate for different N. We analyze the improvement due to multiplexing, and analyze the secret key rate with explicit results for the tripartite network. Investigating strategic qubit selection for the GHZ measurements, we show that using cutoffs to remove qubits after a certain number of rounds and consistently combining qubits with the lowest number of storage rounds leads to an optimal secret key rate.

References in corpus (13)

• The Security of Practical Quantum Key Distribution
• Measurement-device-independent quantum key distribution
• Quantum repeaters based on entanglement purification
• Multiplexed Memory-Insensitive Quantum Repeaters
• NetSquid, a NETwork Simulator for QUantum Information using Discrete events
• Experimental quantum repeater without quantum memory
• Quantum Conference Key Agreement: A Review
• Measurement-device-independent quantum key distribution with quantum memories
• Finite-key effects in multi-partite quantum key distribution protocols
• On the Stochastic Analysis of a Quantum Entanglement Switch
• Large-scale quantum networks based on graphs
• Breaking universal limitations on quantum conference key agreement without quantum memory
• Finite-range multiplexing enhances quantum key distribution via quantum repeaters