Iterative Optimization of Quantum Error Correcting Codes

Simple item page
dc.creatorReimpell, M.
dc.creatorWerner, R. F.
dc.date2003-07-19
dc.date2005-05-11
dc.date.accessioned2026-07-07T08:20:21Z
dc.date.available2026-07-07T08:20:21Z
dc.descriptionWe introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds codes outside the usual Knill-Laflamme definition of error correcting codes. The iteration is shown to improve the figure of merit "channel fidelity" in every step.
dc.description5 pages, 2 figures, REVTeX 4; stability of algorithm included
dc.identifierhttps://arxiv.org/abs/quant-ph/0307138
dc.identifierhttp://arxiv.org/abs/quant-ph/0307138
dc.identifierPhys. Rev. Lett. 94, 080501 (2005)
dc.identifierdoi:10.1103/PhysRevLett.94.080501
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135049
dc.subjectQuantum Physics
dc.titleIterative Optimization of Quantum Error Correcting Codes
dc.typetext

Files

Collections

arXiv