Quantum coding theorem from privacy and distinguishability

Micha Horodecki; Seth Lloyd; Andreas Winter

doi:10.1142/S1230161208000067

Quantum coding theorem from privacy and distinguishability

Micha Horodecki
, Seth Lloyd
, Andreas Winter

University of Gdansk
National Quantum Information Centre of Gdańsk
Massachusetts Institute of Technology
University of Bristol

Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung

12 Zitate (Scopus)

Abstract

We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.

Originalsprache	Englisch
Seiten (von - bis)	47-69
Seitenumfang	23
Fachzeitschrift	Open Systems and Information Dynamics
Jahrgang	15
Ausgabenummer	1
DOIs	https://doi.org/10.1142/S1230161208000067
Publikationsstatus	Veröffentlicht - März 2008
Extern publiziert	Ja

Zugriff auf Dokument

10.1142/S1230161208000067

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Dieses zitieren

@article{e57aef7a38e54d6d9b289d6c51c07efc,

title = "Quantum coding theorem from privacy and distinguishability",

abstract = "We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.",

author = "Micha Horodecki and Seth Lloyd and Andreas Winter",

note = "Funding Information: MH is supported by Polish Ministry of Scientific Research and Information Technology under the (solicited) grant no. PBZ-MIN-008/P03/2003 and EC IP SCALA. SL acknowledges the support by NEC and W. M. Keck foundation. AW is supported by the U.K. EPSRC (project “QIP IRC” and the Advanced Research Fellowship), by a Royal Society Wolfson Merit Award, and the EC, IP “QAP”.",

year = "2008",

month = mar,

doi = "10.1142/S1230161208000067",

language = "English",

volume = "15",

pages = "47--69",

journal = "Open Systems and Information Dynamics",

issn = "1230-1612",

publisher = "World Scientific",

number = "1",

}

TY - JOUR

T1 - Quantum coding theorem from privacy and distinguishability

AU - Horodecki, Micha

AU - Lloyd, Seth

AU - Winter, Andreas

N1 - Funding Information: MH is supported by Polish Ministry of Scientific Research and Information Technology under the (solicited) grant no. PBZ-MIN-008/P03/2003 and EC IP SCALA. SL acknowledges the support by NEC and W. M. Keck foundation. AW is supported by the U.K. EPSRC (project “QIP IRC” and the Advanced Research Fellowship), by a Royal Society Wolfson Merit Award, and the EC, IP “QAP”.

PY - 2008/3

Y1 - 2008/3

N2 - We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.

AB - We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.

UR - https://www.scopus.com/pages/publications/53449101214

U2 - 10.1142/S1230161208000067

DO - 10.1142/S1230161208000067

M3 - Article

AN - SCOPUS:53449101214

SN - 1230-1612

VL - 15

SP - 47

EP - 69

JO - Open Systems and Information Dynamics

JF - Open Systems and Information Dynamics

IS - 1

ER -

Quantum coding theorem from privacy and distinguishability

Abstract

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Dieses zitieren