Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This study establishes fundamental limits for universal entanglement concentration protocols, proving that a specific known method achieves optimal success probabilities for both known and unknown Schmidt bases. The analysis reveals a critical efficiency trade-off inherent to universality, capping the average success probability at 2/105 over the Haar measure. These rigorous bounds provide a definitive benchmark for the theoretical performance of quantum state distillation algorithms.
Sources coveringarXiv, Latent Space
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Optimality of universal conclusive entanglement concentration protocols

arXiv2 min read

arXiv:2509.09423v2 Announce Type: replace Abstract: Entanglement concentration 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 a perfect Bell state from 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, using concatenated two-qubit operations. 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.

Abstract:Entanglement concentration 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 a perfect Bell state from 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, using concatenated two-qubit operations. 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.

arXiv:2509.09423 [quant-ph]

(or arXiv:2509.09423v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2509.09423 Focus to learn more arXiv-issued DOI via DataCite

https://doi.org/10.1103/bz3j-9njg Focus to learn more DOI(s) linking to related resources

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 · 206 words

Related coverage