Entanglement purification protocols for all graph states

Simple item page
dc.creatorKruszynska, Caroline
dc.creatorMiyake, Akimasa
dc.creatorBriegel, Hans J.
dc.creatorDür, Wolfgang
dc.date2006-06-09
dc.date2006-11-17
dc.date.accessioned2026-07-07T07:19:02Z
dc.date.available2026-07-07T07:19:02Z
dc.descriptionWe 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.
dc.descriptionrevtex 10 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0606090
dc.identifierhttp://arxiv.org/abs/quant-ph/0606090
dc.identifierPhys. Rev. A 74, 052316 (2006)
dc.identifierdoi:10.1103/PhysRevA.74.052316
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/114514
dc.subjectQuantum Physics
dc.titleEntanglement purification protocols for all graph states
dc.typetext

Files

Collections

arXiv