An all-photonic repeater scheme based on a type of graph state called a repeater graph state (RGS) promises tolerance to photon losses as well as operational errors, and offers a fast Bell pair generation rate, limited only by the RGS creation time (rather than enforced round-trip waits). Prior research on the topic has focused on the RGS generation and analyzing the secret key sharing rate, but there is a need to extend to use cases such as distributed computation or teleportation as will be used in a general-purpose Quantum Internet. Here, we propose a protocol and architecture that consider how end nodes participate in the connection; the capabilities and responsibilities of each node; the classical communications between nodes; and the Pauli frame correction information per end-to-end Bell pair. We give graphical reasoning on the correctness of the protocol via graph state manipulation rules. We then show that the RGS scheme is well suited to use in a link architecture connecting memory-based repeaters and end nodes for applications beyond secret sharing. Finally, we discuss the practicality of implementing our proposed protocol on quantum network simulators and how it can be integrated into an existing proposed quantum network architecture.

翻译：基于一种称为中继图态（RGS）的图态的全光子中继方案，能够容忍光子损失和操作错误，并提供快速的贝尔对生成速率，该速率仅受RGS创建时间（而非强制往返等待）的限制。此前相关研究侧重于RGS生成和密钥共享率的分析，但需要扩展至分布式计算或量子隐形传态等用例，这些将在通用量子互联网中使用。本文提出了一种协议和架构，探讨了端节点如何参与连接；每个节点的能力与职责；节点间的经典通信；以及每个端到端贝尔对的泡利框架修正信息。我们通过图态操作规则对协议的正确性进行了图形化推理。接着展示了RGS方案在连接基于存储器的中继器和端节点的链路架构中的良好适用性，用于超越密钥共享的应用。最后，讨论了在量子网络模拟器上实现所提协议的可行性，以及如何将其集成到现有量子网络架构中。