Optimal approach to quantum communication using dynamic programming
View/ Open
Author
Jiang, Liang
Taylor, Jacob
Khaneja, Navin
Lukin, Mikhail
Published Version
https://doi.org/10.1073/pnas.0703284104Metadata
Show full item recordCitation
Jiang, L., J. M. Taylor, N. Khaneja, and M. D. Lukin. 2007. “Optimal Approach to Quantum Communication Using Dynamic Programming.” Proceedings of the National Academy of Sciences 104 (44): 17291–96. https://doi.org/10.1073/pnas.0703284104.Abstract
Reliable preparation of entanglement between distant systems is an outstanding problem in quantum information science and quantum communication. In practice, this has to be accomplished by 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 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.Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAACitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467408
Collections
- FAS Scholarly Articles [17845]
Contact administrator regarding this item (to report mistakes or request changes)