aiqbench analysis
This research demonstrates how classical shared randomness combined with buffer memories can significantly boost the success probability and fidelity of entanglement purification protocols for heterogeneous quantum sources. By shuffling accumulated states before processing, this method improves performance without requiring complex state characterization or circuit optimization, offering a practical pathway toward fault-tolerant distributed quantum computing.
Enhancing Entanglement Purification with Shared Randomness
arXiv:2607.21555v1 Announce Type: new Abstract: Entanglement purification protocols (EPPs) are essential for improving entanglement fidelity to support fault-tolerant distributed quantum information processing. Practical entanglement sources are often heterogeneous and source labels may be unavailable at the EPP layer. We show that classical shared randomness, together with buffer memories, can enhance entanglement purification when source labels are unavailable, without state characterization or EPP circuit optimization. The strategy is to accumulate multiple entanglement distribution rounds and then use shared randomness to shuffle all the stored entangled states before packaging them as inputs to the EPP. For any $n$ Werner sources and any fixed $n$-to-1 bilocal Clifford EPP, we prove that accumulating and shuffling improves the expected success probability and the success-weighted output Bell fidelity over the baseline without accumulating and shuffling, for every $n$, for every finite number of accumulation rounds and in the asymptotic limit, and the improvement increases monotonically with the number of accumulation rounds.
Abstract:Entanglement purification protocols (EPPs) are essential for improving entanglement fidelity to support fault-tolerant distributed quantum information processing. Practical entanglement sources are often heterogeneous and source labels may be unavailable at the EPP layer. We show that classical shared randomness, together with buffer memories, can enhance entanglement purification when source labels are unavailable, without state characterization or EPP circuit optimization. The strategy is to accumulate multiple entanglement distribution rounds and then use shared randomness to shuffle all the stored entangled states before packaging them as inputs to the EPP. For any $n$ Werner sources and any fixed $n$-to-1 bilocal Clifford EPP, we prove that accumulating and shuffling improves the expected success probability and the success-weighted output Bell fidelity over the baseline without accumulating and shuffling, for every $n$, for every finite number of accumulation rounds and in the asymptotic limit, and the improvement increases monotonically with the number of accumulation rounds.
arXiv:2607.21555 [quant-ph]
(or arXiv:2607.21555v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2607.21555 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 241 words
Related coverage

University of Chicago Lab Improves Entanglement Fidelity with Shuffling
Quantum Zeitgeist · Aug 4, 2026

News
Quantum Computing Report · Jun 7, 2026
Quantum Advantage over Wirings of Nonsignaling Boxes in Multipartite Networks
arXiv · Jun 9, 2026

Entanglement-assisted Quasi-cyclic Quantum Low-density Parity-check Codes over Qubits
Quantum Journal · Jul 31, 2026