Entanglement Distribution in Quantum Switch Networks: Memory Limits and Achievability
Abstract
We study the minimum persistent memory required to distribute a graph state through a quantum switch. Specifically, consider a central switch that assists n remote users in distributing a graph state, using independently generated user-switch Bell pairs. Since Bell-pair generation is probabilistic, different links generally succeed at different times. When a Bell-pair is generated, the qubits may need to be stored in memory while waiting for other links to succeed. Recently, new protocols have been proposed to reduce this storage overhead by processing and releasing some switch qubits before all Bell links are available. However, these protocols do not characterize the minimum persistent switch memory required at each stage. Moreover, the local-cover method in the state-of-the-art Piecemaker protocol is computationally expensive for general target graphs. In this work, we characterize the minimum persistent switch memory required after any subset of users' Bell links are generated and processed. We then develop an online stabilizer-transition protocol that attains this limit, which can be implemented in polynomial time in the number of qubits n. Remarkably, this optimal protocol can provide substantial memory reductions over existing heuristic approaches. In particular, for the path graph Pn over n users, Piecemaker protocol requires at least ⌊ n/2⌋ qubits of peak persistent memory for \textit{every Bell-links generation order}, whereas under the order (1,2,…,n), our protocol requires only one persistent switch qubit. Finally, the same stabilizer-transition framework also provides a direct forward construction for sequential graph-state generation using the minimum number of quantum emitters, equal to the maximum of the height function.
Related
- Quantum List Recovery and Decoding: Achievability and Limitations
- Empirical coordination in the finite blocklength regime: an achievability result---Extended version
- Achievability of CSS codes performance limits over Pauli channels under separate ML decoding with bounded graphical complexity
- A Polynomial-Scaling PDE Solver with Entanglement-Basis Tensor Networks
- Conditional Distribution Estimation Given Functional Covariates Using Deep Operator Networks
BibTeX
@misc{hu2026entanglement,
title = {{Entanglement Distribution in Quantum Switch Networks: Memory Limits and Achievability}},
author = {Lei Hu and Alptug Aytekin and Stavros Mitrolaris and Mohamed Nomeir and Subhankar Banerjee and Sennur Ulukus and Saikat Guha},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.28596},
eprint = {2610.28596},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.28596},
}
RIS
TY - UNPB
TI - Entanglement Distribution in Quantum Switch Networks: Memory Limits and Achievability
AU - Lei Hu
AU - Alptug Aytekin
AU - Stavros Mitrolaris
AU - Mohamed Nomeir
AU - Subhankar Banerjee
AU - Sennur Ulukus
AU - Saikat Guha
PY - 2026
DA - 2026/10/20
PB - arXiv
DO - 10.48550/arxiv.2610.28596
UR - https://arxiv.org/abs/2610.28596
AB - We study the minimum persistent memory required to distribute a graph state through a quantum switch. Specifically, consider a central switch that assists n remote users in distributing a graph state, using independently generated user-switch Bell pairs. Since Bell-pair generation is probabilistic, different links generally succeed at different times. When a Bell-pair is generated, the qubits may need to be stored in memory while waiting for other links to succeed. Recently, new protocols have been proposed to reduce this storage overhead by processing and releasing some switch qubits before all Bell links are available. However, these protocols do not characterize the minimum persistent switch memory required at each stage. Moreover, the local-cover method in the state-of-the-art Piecemaker protocol is computationally expensive for general target graphs. In this work, we characterize the minimum persistent switch memory required after any subset of users' Bell links are generated and processed. We then develop an online stabilizer-transition protocol that attains this limit, which can be implemented in polynomial time in the number of qubits n. Remarkably, this optimal protocol can provide substantial memory reductions over existing heuristic approaches. In particular, for the path graph P_n over n users, Piecemaker protocol requires at least ⌊ n/2⌋ qubits of peak persistent memory for \textit{every Bell-links generation order}, whereas under the order (1,2,…,n), our protocol requires only one persistent switch qubit. Finally, the same stabilizer-transition framework also provides a direct forward construction for sequential graph-state generation using the minimum number of quantum emitters, equal to the maximum of the height function.
ER -