Statistical evaluation and optimization of entanglement purification protocols
- 26 August 2024
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (2) , 022619
Abstract
Quantitative characterization of two-qubit entanglement purification protocols is introduced. Our approach is based on the concurrence and the hit-and-run algorithm applied to the convex set of all two-qubit states. We demonstrate that pioneering protocols are unable to improve the estimated initial average concurrence of almost uniformly sampled density matrices; however, as it is known, they still generate pairs of qubits in a state that is close to a Bell state. We also develop a more efficient protocol and investigate it numerically together with a recent proposal based on an entangling rank-2 projector. Furthermore, we present a class of variational purification protocols with continuous parameters and optimize their output concurrence. These optimized algorithms turn out to surpass former proposals and our protocol by means of not wasting too many entangled states.Keywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (EXC 2004/1–390534)
- Jülich Supercomputing Centre, Forschungszentrum Jülich
This publication has 42 references indexed in Scilit:
- Iterated nth order nonlinear quantum dynamics with mixed initial statesPhysics Letters A, 2022
- Numerical Computations of Separability ProbabilitiesReports on Mathematical Physics, 2016
- Demonstration of a small programmable quantum computer with atomic qubitsNature, 2016
- Exponential Sensitivity and its Cost in Quantum PhysicsScientific Reports, 2016
- Generating random density matricesJournal of Mathematical Physics, 2011
- The Bloch vector for N-level systemsPhysics Letters A, 2003
- Completely Bounded Maps and Operator Algebras2003
- Hit-and-run mixes fastMathematical Programming, 1999
- On the analytical convergence of the QPA procedurePhysics Letters A, 1998
- On the limited memory BFGS method for large scale optimizationMathematical Programming, 1989