Optimal path for a quantum teleportation protocol in entangled networks

Details Optimal path for a quantum teleportation protocol in entangled networks Optimal path for a quantum teleportation protocol in entangled networks

2010-08-10

arxiv.org/abs/1008.1679v2

Phys. Rev. A 85, 010303(R) (2012)

Physics

Quantum Physics

4 pages, 1 figure, RevTeX4

Scientific paper

10.1103/PhysRevA.85.010303

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.

Affiliated with

Also associated with

No associations

Rating

Optimal path for a quantum teleportation protocol in entangled networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal path for a quantum teleportation protocol in entangled networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal path for a quantum teleportation protocol in entangled networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583381