Escolar Documentos
Profissional Documentos
Cultura Documentos
Mark M. Wilde
Based on joint work with Sumeet Khatri and Kunal Sharma in arXiv:1903.07747
Much progress has been made during the past few years.
θ(N)
A B
1–γ
γ
E
for qubit thermal state θ(N) = (1 − N)|0ih0| + N|1ih1|
UB UB
χ(Aγ,N ) Cβ (Aγ,N ) UB
Ccov CEB CFil C E (Aγ,N )
QLB
CI QUB
2 QUB
4 QUB
6 QUB
7 QUB
8
QUB
1 QUB
3 QUB
5
↔,LB
QRCI Q1↔,UB Q2↔,UB Q3↔,UB Q4↔,UB Q5↔,UB
where
1 X
ΦM M̂ ≡ |mihm|M ⊗ |mihm|M̂ ,
dim(HM ) m
1
|M| = number of messages and the rate R = n log2 |M|.
Note that ΦM M̂ represents a classical state, and the goal is for the
coding scheme to preserve the classical correlations in this state.
Alice Bob
A’ B
N
A’ B M’
M N
E D
A’ B
N
There are other classes of channels, but we focus on the two above.
is a separable state.
N = P ◦ M.
k
A B
σk
A
Alice
B
Bob Channel
min 1 kN − Mk ≤ ε,
M∈E 2
Theorem ([LKDW18])
Let NA→B be an ε-entanglement-breaking quantum channel, with ε the
minimum in Definition 2. Then its classical capacity C (N ) is bounded as
where
g (ε) ≡ (ε + 1) log2 (ε + 1) − ε log2 ε
and MA→B is the EB channel achieving the minimum ε in Definition 2.
minimize: µ
subject to: TrB ZRB ≤ µIR
ZRB ≥ NA→B (ΓRA ) − MRB
TB
ZRB , MRB , MRB ≥0
TrB MRB = IR .
By applying the PPT criterion to the Choi state Aγ,N (Φ), we find the
region of parameters for which the generalized amplitude damping channel
is entanglement breaking [FRZ12, LG15]:
1.0
0.8
0.6
N
0.4
0.2
0.0
0.00 0.25 0.50 0.75 1.00
γ
UB UB
χ(Aγ,N ) Cβ (Aγ,N ) UB
Ccov CEB CFil C E (Aγ,N )
{(UA (g ), VB (g ))}g ∈G ,
if for all g ∈ G
1 X
UA (g )ρA UA (g )† = πA
|G |
g ∈G
1
for all states ρA , where πA = |A| IA is the completely mixed state.
Lemma ([Kin02])
Let NA→B be a qubit channel (|A| = |B| = 2) that is covariant with
respect to {(UA (g ), VB (g ))}g ∈G , and where VB (g ) is a one-design.
Then the Holevo information is equal to the classical capacity for such
covariant channels:
C (N ) = χ(N )
Phase covariance:
Flip transformation:
for all states ρ and all γ, N ∈ [0, 1]. I.e., GADC Aγ,N related to
Aγ,1−N via a simple pre- and post-processing by σx .
These symmetries imply that Aγ,N is covariant wrt Paulis for N = 1/2. So
then we know the classical capacity for these special values.
1
kN − NG k ≤ ε.
2
Theorem
Let NA→B be an arbitrary qubit channel (with |A| = |B| = 2), and set G
to the Pauli group.
Then the classical capacity of NA→B is bounded as
C (N ) ≤ χ(NG ) + 2ε + g (ε)
where
g (ε) ≡ (ε + 1) log2 (ε + 1) − ε log2 ε
and ε = 12 kN − NG k .
UB UB
χ(Aγ,N ) Cβ (Aγ,N ) UB
Ccov CEB CFil C E (Aγ,N )
C (N ) ≤ Cβ (N ) ≡ log2 β(N ),
where
min. Tr[SB ]
β(N ) ≡ subject to −LRB ≤ TB (NA→B (ΓRB )) ≤ LRB ,
−IR ⊗ SB ≤ TB (LRB ) ≤ IR ⊗ SB .
UB UB
χ(Aγ,N ) Cβ (Aγ,N ) UB
Ccov CEB CFil C E (Aγ,N )
1 X
ΦM M̂ ≡ |mihm0 |M ⊗ |mihm0 |M̂ ,
dim(HM ) 0
m,m
Alice Bob
A’ B
N
A’ N B
A1 B1
E D
A’ B
N
Ic (N ) ≤ Q(N )
where
Ic (N ) = max I (RiB)ω ,
φRA
c
A complementary channel NA→E of NA→B is defined as [DS05]
c N
NA→E = TrB ◦ UA→BE
Q(N ) = Ic (N )
Mark M. Wilde (LSU) 42 / 80
Approximately degradable channels [SSWR17]
Take defining condition for degradable channel and consider instead
c
DB→E ◦ NA→B ≈ NA→E
Definition ([SSWR17])
A channel N is ε-degradable if ∃ a channel D such that
1
kD ◦ N − N c k ≤ ε.
2
Minimal ε can be computed by an SDP
minimize: µ
subject to: TrE ZRE ≤ µIR
c
ZRE ≥ NA→E (ΓRA ) − hΓ|BB 0 NA→B (ΓRA ) ⊗ DB 0 E |ΓiBB 0
ZRE , DB 0 E ≥ 0
TrE DB 0 E = IB 0 .
Mark M. Wilde (LSU) 43 / 80
Upper bound on q. capacity from approximate degradability
where UD (N ) is defined as
QLB
CI QUB
2 QUB
4 QUB
6 QUB
7 QUB
8
QUB
1 QUB
3 QUB
5
Aγ,N = Aγ(1−N),0 ◦ A γN
,1
.
1−γ(1−N)
QLB
CI QUB
2 QUB
4 QUB
6 QUB
7 QUB
8
QUB
1 QUB
3 QUB
5
where ρAB ≡ NA0 →B (φAA0 ) and optimization over pure bipartite input
states φAA0 , with |A| = |A0 |.
Q(N ) ≤ R(N ).
QLB
CI QUB
2 QUB
4 QUB
6 QUB
7 QUB
8
QUB
1 QUB
3 QUB
5
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
Q ↔ (N ) ≤ Esq (N )
A
Aγ,N B = A
Aγ1,1 Aγ2,0 B
γN
γ1 = , γ2 = γ(1 − N)
1 − γ(1 − N)
|1〉 |0〉
A B
1–γ1 1–γ2
γ1 γ2
E1 E2
|1〉 |0〉
A B
1–γ1 1–γ2
γ1 γ2
E1 E2
F1 F2
|0〉 |0〉
½ ½
½ ½
discard discard
↔,LB
QRCI Q1↔,UB Q2↔,UB Q3↔,UB Q4↔,UB Q5↔,UB
Alice
Alice
A
A
N B
= R
LOCC
Bob
ω
B’ B
Bob
↔,LB
QRCI Q1↔,UB Q2↔,UB Q3↔,UB Q4↔,UB Q5↔,UB
where ΓN
AB is the Choi matrix of the channel N
↔,LB
QRCI Q1↔,UB Q2↔,UB Q3↔,UB Q4↔,UB Q5↔,UB
All programs used to generate plots and calculate bounds are available for
download, including a mixture of Mathematica, Python, and Matlab codes
[BW18] Mario Berta and Mark M. Wilde. Amortization does not enhance the
max-Rains information of a quantum channel. New Journal of Physics,
20(5):053044, 2018. arXiv:1709.04907.
[Dev05] Igor Devetak. The private classical capacity and quantum capacity of a
quantum channel. IEEE Transactions on Information Theory,
51(1):44–55, January 2005. arXiv:quant-ph/0304127.
[DS05] Igor Devetak and Peter W. Shor. The capacity of a quantum channel for
simultaneous transmission of classical and quantum information.
Communications in Mathematical Physics, 256(2):287–303, March 2005.
arXiv:quant-ph/0311131.
[FF18] Hamza Fawzi and Omar Fawzi. Efficient optimization of the quantum
relative entropy. Journal of Physics A: Mathematical and Theoretical,
51(15):154003, April 2018. arXiv:1705.06671.
[Fil18] Sergey N. Filippov. Lower and upper bounds on nonunital qubit channel
capacities. Reports on Mathematical Physics, 82(2):149–159, 2018.
arXiv:1802.00646.
[FRZ12] Sergey N. Filippov, Tomás Rybár, and Mário Ziman. Local two-qubit
entanglement-annihilating channels. Physical Review A, 85(1):012303,
January 2012. arXiv:1110.3757.
[Hol98] Alexander S. Holevo. The capacity of the quantum channel with general
signal states. IEEE Transactions on Information Theory, 44(1):269–273,
January 1998. arXiv:quant-ph/9611023.
[HSR03] Michael Horodecki, Peter W. Shor, and Mary Beth Ruskai. Entanglement
breaking channels. Reviews in Mathematical Physics, 15(6):629–641, May
2003. arXiv:quant-ph/0302031.
[LKDW18] Felix Leditzky, Eneet Kaur, Nilanjana Datta, and Mark M. Wilde.
Approaches for approximate additivity of the Holevo information of
quantum channels. Physical Review A, 97:012332, January 2018.
arXiv:1709.01111.
[Llo97] Seth Lloyd. Capacity of the noisy quantum channel. Physical Review A,
55:1613–1622, March 1997. arXiv:quant-ph/9604015.
[LLS18] Felix Leditzky, Debbie Leung, and Graeme Smith. Quantum and private
capacities of low-noise channels. Physical Review Letters, 120:160503,
April 2018. arXiv:1705.04335.
[Sho02b] Peter W. Shor. The quantum channel capacity and coherent information.
In Lecture Notes, MSRI Workshop on Quantum Computation, 2002.
[SSWR17] David Sutter, Volkher B. Scholz, Andreas Winter, and Renato Renner.
Approximate degradable quantum channels. IEEE Transactions on
Information Theory, 63(12):7832–7844, December 2017. arXiv:1412.0980.
[TGW14] Masahiro Takeoka, Saikat Guha, and Mark M. Wilde. The squashed
entanglement of a quantum channel. IEEE Transactions on Information
Theory, 60(8):4987–4998, August 2014. arXiv:1310.0129.
[WXD18] Xin Wang, Wei Xie, and Runyao Duan. Semidefinite programming strong
converse bounds for classical capacity. IEEE Transactions on Information
Theory, 64(1):640–653, January 2018. arXiv:1610.06381.