Optimal path for a quantum teleportation protocol in entangled networks
arXiv:1008.1679 · doi:10.1103/PhysRevA.85.010303
Abstract
Bellman's optimality principle has been of enormous importance in the development of whole branches of applied mathematics, computer science, optimal control theory, economics, decision making, and classical physics. Examples are numerous: dynamic programming, Markov chains, stochastic dynamics, calculus of variations, and the brachistochrone problem. Here we show that Bellman's optimality principle is violated in a teleportation problem on a quantum network. This implies that finding the optimal fidelity route for teleporting a quantum state between two distant nodes on a quantum network with bi-partite entanglement will be a tough problem and will require further investigation.
4 pages, 1 figure, RevTeX4
References in corpus (12)
- The Quantum Internet
- Experimental quantum teleportation
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- Dephasing assisted transport: Quantum networks and biomolecules
- Non-Markovian effects on the dynamics of entanglement
- Quantum control and entanglement in a chemical compass
- Algebraic characterization of X-states in quantum information
- Entanglement Evolution in the Presence of Decoherence
- Nonmaximally entangled states can be better for multiple linear optical teleportation
- A dissipative scheme to approach the boundary of two-qubit entangled mixed states
- Entanglement accumulation, retrieval, and concentration in cavity QED
- Teleportation protocol with non-ideal conditional local operations