Académique Documents
Professionnel Documents
Culture Documents
Quantum Capacity
Mark M. Wilde
joint work with Mario Berta, Department of Computing, Imperial College, London, UK
z
where {EA→A z
0 }z and {FB→B 0 }z are sets of completely positive, trace
A1 B1 A2 B2 An Bn
LOCC N LOCC N LOCC LOCC N LOCC
From definitions, Q ↔ (N ) ≤ Q ↔† (N ).
A1 B1 A2 B2 An Bn
PPT-P N PPT-P N PPT-P PPT-P N PPT-P
|ψ〉SA
A B
N
Alice
A B
NA→B
Bob
B’
E (N ) ≤ EA (N )
E (MA ; MB )ω ≤ E (A0n ; Bn Bn0 )σ(n) = E (A0n ; Bn Bn0 )σ(n) − E (A01 A1 ; B10 )ρ(1)
n
X
= E (A0n ; Bn Bn0 )σ(n) − E (A01 A1 ; B10 )ρ(1) + E (A0i Ai ; Bi0 )ρ(i) − E (A0i Ai ; Bi0 )ρ(i)
i=2
n
X
≤ E (A0i ; Bi Bi0 )σ(i) − E (A0i Ai ; Bi0 )ρ(i)
i=1
≤ n · EA (N )
Mark M. Wilde (LSU) 13 / 24
Amortized entanglement as a general bound (ctd.)
E (MA ; MB )ω ≤ n · EA (N )
1 − ε ≤ 2−n[Q−Rmax (N )]
1
where Q = n log2 M is the quantum communication rate.
where
Our main technical result is that amortization does not increase the
max-Rains information of a quantum channel, in the sense that
Amortization collapse
Let ρA0 AB 0 be a state and let NA→B be a quantum channel. Then
[WFD17] Xin Wang, Kun Fang, and Runyao Duan. Semidefinite programming
converse bounds for quantum communication. September 2017.
arXiv:1709.00200.