Generalized Quantum Repeater Graph States

TL;DR

This paper introduces a generalized framework for quantum repeater graph states that enhances the efficiency and loss tolerance of long-distance quantum communication, addressing key challenges in entanglement swapping.

Contribution

We propose a generalized construction of repeater graph states with complex connectivity, improving the success rate and flexibility of entanglement distribution in quantum networks.

Findings

Significantly outperforms previous schemes in success probability

Offers increased flexibility in resource state generation

Discusses reduced overhead for scalable quantum networks

Abstract

All-photonic quantum repeaters are essential for establishing long-range quantum entanglement. Within repeater nodes, reliably performing entanglement swapping is a key component of scalable quantum communication. To tackle the challenge of probabilistic Bell state measurement in linear optics, which often leads to information loss, various approaches have been proposed to ensure the loss tolerance of distributing a single ebit. We have generalized previous work regarding repeater graph states with elaborate connectivity, enabling the efficient establishment of exploitable ebits at a finite rate with high probability. We demonstrate that our new scheme significantly outperforms the previous work with much flexibility and discuss the generation overhead of such resource states. These findings offer new insights into the scalability and reliability of loss-tolerant quantum networks.