Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network
Yuexun Huang, Xiangyu Ren, Bikun Li, Yat Wong, Zhiding Liang, Liang Jiang

TL;DR
This paper introduces a novel quantum network protocol, P2PGSD, inspired by classical P2P networks, which efficiently distributes general graph states with resource savings and scalability, advancing large-scale quantum network capabilities.
Contribution
The paper proposes the P2PGSD protocol for efficient graph state distribution, provides a mathematical model, proves resource minimization intractability, and leverages spacetime quantum network concepts for improved algorithms.
Findings
Up to 50% resource efficiency improvement in simulations.
Demonstrates scalability for large quantum networks.
Provides a mathematical framework for graph state distribution.
Abstract
Graph states are a class of important multiparty entangled states, of which bell pairs are the special case. Realizing a robust and fast distribution of arbitrary graph states in the downstream layer of the quantum network can be essential for further large-scale quantum networks. We propose a novel quantum network protocol called P2PGSD inspired by the classical Peer-to-Peer (P2P) network to efficiently implement the general graph state distribution in the network layer, which demonstrates advantages in resource efficiency and scalability over existing methods for sparse graph states. An explicit mathematical model for a general graph state distribution problem has also been constructed, above which the intractability for a wide class of resource minimization problems is proved and the optimality of the existing algorithms is discussed. In addition, we leverage the spacetime quantum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
