| M. Horodecki, P. Horodecki, R. Horodecki: "Unified approach to quantum capacities: towards quantum noisy coding theorem," Phys. Rev. Lett. 85, 433 (2000) (quant-ph/0003040) |
....into a capacity like expression by this procedure. Since this quantity is known not to be additive [26] the candidate for the right hand side of the quantum coding theorem is CS (T) sup # 1 # C S,1 (T# # ) 6.31) in analogy to (6. 21) So far there are some good heuristic arguments [27, 28] in that direction, but a full proof remains one of the main challenges in the field. An interesting upper bound on C q (T ) can be written in terms of the transpose operation # on the output system [16] one has C q (T ) # log 2 ##T# cb . 6.32) Hence if #T happens to be completely positive ....
M. Horodecki, P. Horodecki, R. Horodecki: "Unified approach to quantum capacities: towards quantum noisy coding theorem," Phys. Rev. Lett. 85, 433 (2000) (quant-ph/0003040)
No context found.
M. Horodecki, P. Horodecki, R. Horodecki: "Unified approach to quantum capacities: towards quantum noisy coding theorem," Phys. Rev. Lett. 85, 433 (2000) (quant-ph/0003040)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC