Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 96 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 455 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Optimality of universal conclusive entanglement purification protocols (2509.09423v1)

Published 11 Sep 2025 in quant-ph

Abstract: Entanglement purification is essential for quantum technologies; yet, rigorous bounds on the success probability for universal protocols -- those requiring no prior knowledge about the input state -- have remained underexplored. We establish such fundamental limits for conclusive protocols distilling perfect Bell states from a pure two-qubit states by deriving the optimal success probability starting with: two copies of a state with known Schmidt basis, and four copies of a state with unknown Schmidt basis. We prove that a known protocol achieves these bounds, confirming its optimality. Crucially, universality imposes an inherent efficiency trade-off, yielding an average success probability of just $2/105$ over Haar measure.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.