Optimal approach to quantum communication using dynamic programming

Simple item page
dc.creatorJiang, Liang
dc.creatorTaylor, Jacob M.
dc.creatorKhaneja, Navin
dc.creatorLukin, Mikhail D.
dc.date2007-10-31
dc.date.accessioned2026-07-07T08:39:40Z
dc.date.available2026-07-07T08:39:40Z
dc.descriptionReliable preparation of entanglement between distant systems is an outstanding problem in quantum information science and quantum communication. In practice, this has to be accomplished via noisy channels (such as optical fibers) that generally result in exponential attenuation of quantum signals at large distances. A special class of quantum error correction protocols--quantum repeater protocols--can be used to overcome such losses. In this work, we introduce a method for systematically optimizing existing protocols and developing new, more efficient protocols. Our approach makes use of a dynamic programming-based searching algorithm, the complexity of which scales only polynomially with the communication distance, letting us efficiently determine near-optimal solutions. We find significant improvements in both the speed and the final state fidelity for preparing long distance entangled states.
dc.description9 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/0710.5808
dc.identifierhttp://arxiv.org/abs/0710.5808
dc.identifierPNAS 104, 17291-17296, 2007
dc.identifierdoi:10.1073/pnas.0703284104
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141154
dc.subjectQuantum Physics
dc.titleOptimal approach to quantum communication using dynamic programming
dc.typetext

Files

Collections

arXiv