ExplorerQuantum ComputingQuantum Physics
Research PaperResearchia:202607.24079

Enhancing Entanglement Purification with Shared Randomness

Allen Zang

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 a...

Submitted: July 24, 2026Subjects: Quantum Physics; Quantum Computing

Description / Details

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 nn Werner sources and any fixed nn-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 nn, for every finite number of accumulation rounds and in the asymptotic limit, and the improvement increases monotonically with the number of accumulation rounds.


Source: arXiv:2607.21555v1 - http://arxiv.org/abs/2607.21555v1 PDF: https://arxiv.org/pdf/2607.21555v1 Original Link: http://arxiv.org/abs/2607.21555v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Jul 24, 2026
Topic:
Quantum Computing
Area:
Quantum Physics
Comments:
0
Bookmark