Quantum coding theorem from privacy and distinguishability

Simple item page
dc.creatorHorodecki, Michal
dc.creatorLloyd, Seth
dc.creatorWinter, Andreas
dc.date2007-01-31
dc.date2008-01-19
dc.date.accessioned2026-07-07T09:29:57Z
dc.date.available2026-07-07T09:29:57Z
dc.descriptionWe prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and that of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.
dc.descriptionPresented at the NATO ARW "Quantum Communication and Security", 10-13 September 2006, Gdansk, Poland; final version to appear in OSID special issue
dc.identifierhttps://arxiv.org/abs/quant-ph/0702006
dc.identifierhttp://arxiv.org/abs/quant-ph/0702006
dc.identifierOpen Syst. Inf. Dyn. 15 (2008) 47-69
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157978
dc.subjectQuantum Physics
dc.titleQuantum coding theorem from privacy and distinguishability
dc.typetext

Files

Collections

arXiv