Back to Search
Start Over
Optimal path for a quantum teleportation protocol in entangled networks
- Publication Year :
- 2012
- Publisher :
- American Physical Society, 2012.
-
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.<br />4 pages, 1 figure, RevTeX4
- Subjects :
- Physics
Mathematical optimization
Quantum network
Quantum Physics
Evolution
FOS: Physical sciences
Quantum channel
Podolsky-Rosen channels
Decoherence
Atomic and Molecular Physics, and Optics
Superdense coding
Quantum mechanics
No-teleportation theorem
Quantum algorithm
Quantum information
Quantum Physics (quant-ph)
Coherence
Quantum teleportation
State
Quantum computer
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....9821cf1bae1d0ec3233fa19df68edb52