Toward Hop-Independent Fidelity in Quantum Data Centers: Resource Requirements for Entanglement Purification
Mohadeseh Azari, Anoosha Fayyaz, Amy Babay, David Tipper, Prashant Krishnamurthy, Kaushik Seshadreesan

TL;DR
This paper analyzes the resource requirements for entanglement purification in quantum data-center networks, demonstrating that advanced protocols can significantly reduce the number of raw copies needed for high-fidelity end-to-end entanglement.
Contribution
It introduces a topology-independent model comparing purification protocols, revealing that higher-order purification substantially improves feasibility and efficiency in quantum networks.
Findings
Higher-order purification protocols outperform BBPSSW in resource efficiency.
Multi-copy purification enhances the probability of maintaining high-fidelity entanglement.
Resource thresholds depend on the Werner state parameter and path length.
Abstract
Quantum data-center networks must distribute entanglement between QPUs over paths whose length grows with system scale, but each entanglement-swapping step reduces the quality of the raw end-to-end state. Topology, multiplexing, and repeated connection attempts can increase the number of raw end-to-end copies available for a request, yet they do not answer the central resource question: whether those copies are sufficient to remove, via entanglement purification, the fidelity loss caused by multi-hop distribution. We study this question through a topology-independent black-box model of the network. Each elementary link is modeled as a Werner state with parameter , so ideal swapping over an -link path produces equal-quality raw copies with Werner parameter ; purification succeeds if it outputs at least one state with Werner parameter at least with probability…
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.
