• Rapid Communication

Optimal path for a quantum teleportation protocol in entangled networks

C. Di Franco and D. Ballester
Phys. Rev. A 85, 010303(R) – Published 9 January 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 bipartite entanglement will be a tough problem and will require further investigation.

  • Figure
  • Received 18 August 2010

DOI:https://doi.org/10.1103/PhysRevA.85.010303

©2012 American Physical Society

Authors & Affiliations

C. Di Franco1,2 and D. Ballester2

  • 1Department of Physics, University College Cork, Cork, Republic of Ireland
  • 2Departamento de Química Física, Universidad del País Vasco-Euskal Herriko Unibertsitatea, Apartado 644, E-48080 Bilbao, Spain

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 85, Iss. 1 — January 2012

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×