Complete analysis of a realistic fiber-based quantum repeater scheme

We present a quantum repeater protocol for distributing entanglement over long distances, where a dedicated communication stage enables trial rates not limited by the travel time between repeater nodes. To accomplish this, each node contains several qubits that can couple to one single-photon emitter. Photons from the emitters in neighboring nodes generate heralded entanglement between qubits in these nodes. The protocol leaves the emitters disentangled from the rest of the system immediately after emitting the photons, thus allowing them to be reused to entangle other qubits without waiting for the repeater link round-trip time. This time multiplexing increases the protocol trial rate by up to an order of magnitude. The protocol is then combined with conventional deterministic entanglement swapping and heralded entanglement purification to extend the entanglement distance and reduce the entanglement error, respectively. We perform a complete protocol analysis by considering all relevant error sources, such as initialization, two-qubit gate, and qubit measurement errors, as well as the exponential decoherence of the qubits with time. The latter is particularly important since we analyze the protocol performance for a broad range of experimental parameters and obtain secret key rates ranging from 1 to <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mrow><a:mn>1000</a:mn><a:mspace width="0.28em"/><a:mi>Hz</a:mi></a:mrow></a:math> at a distance of 1000 km. Our results suggest that it is important to reach a qubit memory coherence time of around 1 s, and two-qubit gate and measurement errors on the order of <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"><c:msup><c:mn>10</c:mn><c:mrow><c:mo>−</c:mo><c:mn>3</c:mn></c:mrow></c:msup></c:math> to obtain reasonable secret key rates over distances longer than achievable with direct transmission. While this work focuses on optimizing secret key rates, the protocol can also be used for Einstein-Podolsky-Rosen pair generation and is thus also relevant for, e.g., distributed quantum computing.