Entanglement purification protocols for all graph states
量子物理
2007-05-23 v2
摘要
We present multiparty entanglement purification protocols that are capable of purifying arbitrary graph states directly. We develop recurrence and breeding protocols and compare our methods with strategies based on bipartite entanglement purification in static and communication scenarios. We find that direct multiparty purification is of advantage with respect to achievable yields and minimal required fidelity in static scenarios, and with respect to obtainable fidelity in the case of noisy operations in both scenarios.
引用
@article{arxiv.quant-ph/0606090,
title = {Entanglement purification protocols for all graph states},
author = {Caroline Kruszynska and Akimasa Miyake and Hans J. Briegel and Wolfgang Dür},
journal= {arXiv preprint arXiv:quant-ph/0606090},
year = {2007}
}
备注
revtex 10 pages, 6 figures