arXiv:2610.28596
Entanglement Distribution in Quantum Switch Networks: Memory Limits and Achievability
Lei Hu, Alptug Aytekin, Stavros Mitrolaris, Mohamed Nomeir, Subhankar Banerjee, Sennur Ulukus, Saikat Guha
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 $P_n$ over $n$ users, Piecemaker protocol requires at least $\lfloor n/2\rfloor$ qubits of peak persistent memory for \textit{every Bell-links generation order}, whereas under the order $(1,2,\ldots,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.
AI Summary
The paper asks how much persistent quantum memory a central switch needs to distribute a graph state to remote users when user–switch Bell links arrive in an unknown order. Memory is counted after processing successful links, excluding transient processing storage. For any exact protocol distributing a pure target state, after processing users $A$, the switch must retain at least $\lceil\log_2\operatorname{rank}(\rho_A)\rceil$ qubits. The proof uses Schmidt-number monotonicity across the partition separating processed users from the remaining network. For stabilizer states, this bound equals $S(\rho_A)$; for graph states it is the binary cut-rank $r_A=\operatorname{rank}_{\mathbb F_2}\Gamma[A,V\setminus A]$. An online Clifford-and-Pauli-measurement protocol achieves $r_A$ after every update without knowing future arrivals. It maintains a minimal stabilizer purification, using logical Pauli mirrors to implement the three possible memory changes, $+1$, $0$, and $-1$. Its worst-case classical runtime is $O(n^4)$. Persistent memory is pointwise no greater than Piecemaker’s. For $P_n$, every local cover has size at least $\lfloor n/2\rfloor$, whereas sequential arrivals require only one persistent qubit under the new protocol. With one success per round of duration $\Delta t$, individual switch-qubit storage can be limited to $\Delta t$ in this example, versus at least $\lfloor n/2\rfloor\Delta t$ for Piecemaker. The model assumes local processing and feed-forward are fast relative to link generation. The guarantees concern exact distribution and persistent memory, not noisy-state fidelity or transient hardware requirements; the constant-memory path example depends on arrival order.
Error found: The promised optimal-emitter forward construction for sequential graph-state generation is not explicitly provided or derived from the switch protocol in the supplied paper.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- The abstract was shortened to meet arXiv's character limit