Completely positive maps in quantum information

152
Completely Positive Maps in Quantum Information Yiu Tung Poon Department of Mathematics Iowa State University Ames, Iowa, USA INFAS November 14, 2009 Joint work with Chi-Kwong Li. This research was partially supported by an NSF grant. Yiu Tung Poon Completely Positive Maps in Quantum Information

Transcript of Completely positive maps in quantum information

Page 1: Completely positive maps in quantum information

Completely Positive Maps in Quantum Information

Yiu Tung PoonDepartment of Mathematics

Iowa State UniversityAmes, Iowa, USA

INFASNovember 14, 2009

Joint work with Chi-Kwong Li.

This research was partially supported by an NSF grant.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 2: Completely positive maps in quantum information

Basic notation and definitions

H, K : Hilbert space.

B(H) (B(H,K)) : Bounded Linear operators on H (from H to K).

When dimH = n, take H = Cn, and B(H) = Mn, the set of n× ncomplex matrices. Similarly, take (B(H,K)) = Mm, n when dimK = m.

B(H)+ : Positive semi-definite operators in B(H). For A ∈ B(H)+, writeA ≥ 0.

A C∗-algebra is a normed closed ∗-subalgebra of some B(H).

A linear map Φ : A → B(K) is said to be positive if Φ(A) ≥ 0 for everyA ≥ 0. (Φ ≥ 0)

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 3: Completely positive maps in quantum information

Basic notation and definitions

H, K : Hilbert space.

B(H) (B(H,K)) : Bounded Linear operators on H (from H to K).

When dimH = n, take H = Cn, and B(H) = Mn, the set of n× ncomplex matrices. Similarly, take (B(H,K)) = Mm, n when dimK = m.

B(H)+ : Positive semi-definite operators in B(H). For A ∈ B(H)+, writeA ≥ 0.

A C∗-algebra is a normed closed ∗-subalgebra of some B(H).

A linear map Φ : A → B(K) is said to be positive if Φ(A) ≥ 0 for everyA ≥ 0. (Φ ≥ 0)

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 4: Completely positive maps in quantum information

Basic notation and definitions

H, K : Hilbert space.

B(H) (B(H,K)) : Bounded Linear operators on H (from H to K).

When dimH = n, take H = Cn, and B(H) = Mn,

the set of n× ncomplex matrices. Similarly, take (B(H,K)) = Mm, n when dimK = m.

B(H)+ : Positive semi-definite operators in B(H). For A ∈ B(H)+, writeA ≥ 0.

A C∗-algebra is a normed closed ∗-subalgebra of some B(H).

A linear map Φ : A → B(K) is said to be positive if Φ(A) ≥ 0 for everyA ≥ 0. (Φ ≥ 0)

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 5: Completely positive maps in quantum information

Basic notation and definitions

H, K : Hilbert space.

B(H) (B(H,K)) : Bounded Linear operators on H (from H to K).

When dimH = n, take H = Cn, and B(H) = Mn, the set of n× ncomplex matrices.

Similarly, take (B(H,K)) = Mm, n when dimK = m.

B(H)+ : Positive semi-definite operators in B(H). For A ∈ B(H)+, writeA ≥ 0.

A C∗-algebra is a normed closed ∗-subalgebra of some B(H).

A linear map Φ : A → B(K) is said to be positive if Φ(A) ≥ 0 for everyA ≥ 0. (Φ ≥ 0)

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 6: Completely positive maps in quantum information

Basic notation and definitions

H, K : Hilbert space.

B(H) (B(H,K)) : Bounded Linear operators on H (from H to K).

When dimH = n, take H = Cn, and B(H) = Mn, the set of n× ncomplex matrices. Similarly, take (B(H,K)) = Mm, n when dimK = m.

B(H)+ : Positive semi-definite operators in B(H). For A ∈ B(H)+, writeA ≥ 0.

A C∗-algebra is a normed closed ∗-subalgebra of some B(H).

A linear map Φ : A → B(K) is said to be positive if Φ(A) ≥ 0 for everyA ≥ 0. (Φ ≥ 0)

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 7: Completely positive maps in quantum information

Basic notation and definitions

H, K : Hilbert space.

B(H) (B(H,K)) : Bounded Linear operators on H (from H to K).

When dimH = n, take H = Cn, and B(H) = Mn, the set of n× ncomplex matrices. Similarly, take (B(H,K)) = Mm, n when dimK = m.

B(H)+ : Positive semi-definite operators in B(H). For A ∈ B(H)+, writeA ≥ 0.

A C∗-algebra is a normed closed ∗-subalgebra of some B(H).

A linear map Φ : A → B(K) is said to be positive if Φ(A) ≥ 0 for everyA ≥ 0. (Φ ≥ 0)

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 8: Completely positive maps in quantum information

Basic notation and definitions

H, K : Hilbert space.

B(H) (B(H,K)) : Bounded Linear operators on H (from H to K).

When dimH = n, take H = Cn, and B(H) = Mn, the set of n× ncomplex matrices. Similarly, take (B(H,K)) = Mm, n when dimK = m.

B(H)+ : Positive semi-definite operators in B(H). For A ∈ B(H)+, writeA ≥ 0.

A C∗-algebra is a normed closed ∗-subalgebra of some B(H).

A linear map Φ : A → B(K) is said to be positive if Φ(A) ≥ 0 for everyA ≥ 0. (Φ ≥ 0)

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 9: Completely positive maps in quantum information

Basic notation and definitions

H, K : Hilbert space.

B(H) (B(H,K)) : Bounded Linear operators on H (from H to K).

When dimH = n, take H = Cn, and B(H) = Mn, the set of n× ncomplex matrices. Similarly, take (B(H,K)) = Mm, n when dimK = m.

B(H)+ : Positive semi-definite operators in B(H). For A ∈ B(H)+, writeA ≥ 0.

A C∗-algebra is a normed closed ∗-subalgebra of some B(H).

A linear map Φ : A → B(K) is said to be positive if Φ(A) ≥ 0 for everyA ≥ 0. (Φ ≥ 0)

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 10: Completely positive maps in quantum information

Completely positive maps

Let A be a C∗-algebra. Suppose we have a linear mapΦ : A → B(H).

Then for every k ≥ 1, we haveΦk : Mk(A)→Mk(B(H)) = B(Hk) such thatΦk([aij ]) = [Φ (aij)].

Φ is completely positive (CP) if Φk ≥ 0 for all k ≥ 1.

Define Φ : M2 →M2 by Φ(A) = At. Then Φ1 ≥ 0 but Φ2 6≥ 0

Φ2

[

1 00 0

] [0 10 0

][

0 01 0

] [0 00 1

] =

[

1 00 0

] [0 01 0

][

0 10 0

] [0 00 1

]

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 11: Completely positive maps in quantum information

Completely positive maps

Let A be a C∗-algebra. Suppose we have a linear mapΦ : A → B(H). Then for every k ≥ 1,

we haveΦk : Mk(A)→Mk(B(H)) = B(Hk) such thatΦk([aij ]) = [Φ (aij)].

Φ is completely positive (CP) if Φk ≥ 0 for all k ≥ 1.

Define Φ : M2 →M2 by Φ(A) = At. Then Φ1 ≥ 0 but Φ2 6≥ 0

Φ2

[

1 00 0

] [0 10 0

][

0 01 0

] [0 00 1

] =

[

1 00 0

] [0 01 0

][

0 10 0

] [0 00 1

]

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 12: Completely positive maps in quantum information

Completely positive maps

Let A be a C∗-algebra. Suppose we have a linear mapΦ : A → B(H). Then for every k ≥ 1, we haveΦk : Mk(A)→Mk(B(H)) = B(Hk) such thatΦk([aij ]) = [Φ (aij)].

Φ is completely positive (CP) if Φk ≥ 0 for all k ≥ 1.

Define Φ : M2 →M2 by Φ(A) = At. Then Φ1 ≥ 0 but Φ2 6≥ 0

Φ2

[

1 00 0

] [0 10 0

][

0 01 0

] [0 00 1

] =

[

1 00 0

] [0 01 0

][

0 10 0

] [0 00 1

]

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 13: Completely positive maps in quantum information

Completely positive maps

Let A be a C∗-algebra. Suppose we have a linear mapΦ : A → B(H). Then for every k ≥ 1, we haveΦk : Mk(A)→Mk(B(H)) = B(Hk) such thatΦk([aij ]) = [Φ (aij)].

Φ is completely positive (CP)

if Φk ≥ 0 for all k ≥ 1.

Define Φ : M2 →M2 by Φ(A) = At. Then Φ1 ≥ 0 but Φ2 6≥ 0

Φ2

[

1 00 0

] [0 10 0

][

0 01 0

] [0 00 1

] =

[

1 00 0

] [0 01 0

][

0 10 0

] [0 00 1

]

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 14: Completely positive maps in quantum information

Completely positive maps

Let A be a C∗-algebra. Suppose we have a linear mapΦ : A → B(H). Then for every k ≥ 1, we haveΦk : Mk(A)→Mk(B(H)) = B(Hk) such thatΦk([aij ]) = [Φ (aij)].

Φ is completely positive (CP) if Φk ≥ 0 for all k ≥ 1.

Define Φ : M2 →M2 by Φ(A) = At. Then Φ1 ≥ 0 but Φ2 6≥ 0

Φ2

[

1 00 0

] [0 10 0

][

0 01 0

] [0 00 1

] =

[

1 00 0

] [0 01 0

][

0 10 0

] [0 00 1

]

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 15: Completely positive maps in quantum information

Completely positive maps

Let A be a C∗-algebra. Suppose we have a linear mapΦ : A → B(H). Then for every k ≥ 1, we haveΦk : Mk(A)→Mk(B(H)) = B(Hk) such thatΦk([aij ]) = [Φ (aij)].

Φ is completely positive (CP) if Φk ≥ 0 for all k ≥ 1.

Define Φ : M2 →M2 by Φ(A) = At. Then Φ1 ≥ 0 but Φ2 6≥ 0

Φ2

[

1 00 0

] [0 10 0

][

0 01 0

] [0 00 1

] =

[

1 00 0

] [0 01 0

][

0 10 0

] [0 00 1

]

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 16: Completely positive maps in quantum information

Completely positive maps

Let A be a C∗-algebra. Suppose we have a linear mapΦ : A → B(H). Then for every k ≥ 1, we haveΦk : Mk(A)→Mk(B(H)) = B(Hk) such thatΦk([aij ]) = [Φ (aij)].

Φ is completely positive (CP) if Φk ≥ 0 for all k ≥ 1.

Define Φ : M2 →M2 by Φ(A) = At. Then Φ1 ≥ 0 but Φ2 6≥ 0

Φ2

[

1 00 0

] [0 10 0

][

0 01 0

] [0 00 1

] =

[

1 00 0

] [0 01 0

][

0 10 0

] [0 00 1

]

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 17: Completely positive maps in quantum information

Stinespring’s Theorem

Stinespring’s Theorem 1955Let A be a C∗-algebra with a unit, let H be a Hilbert space, and let Φ bea linear function from A to B(H). Then a necessary and sufficientcondition for Φ to be completely positive is that Φ have the form

Φ(A) = V ∗π(A)V

for all A ∈ A, where V ∈ B(H,K); and π is a ∗-representation of A intoB(K).

We may assume that π(I) = IK. Φ is unital if and only if V is anisometry, i.e. V ∗V = IH. In this case, we say that Φ(A) is acompression of π(A), or π(A) is a dilation of Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 18: Completely positive maps in quantum information

Stinespring’s Theorem

Stinespring’s Theorem 1955Let A be a C∗-algebra with a unit, let H be a Hilbert space, and let Φ bea linear function from A to B(H). Then a necessary and sufficientcondition for Φ to be completely positive is that Φ have the form

Φ(A) = V ∗π(A)V

for all A ∈ A, where V ∈ B(H,K); and π is a ∗-representation of A intoB(K).

We may assume that π(I) = IK.

Φ is unital if and only if V is anisometry, i.e. V ∗V = IH. In this case, we say that Φ(A) is acompression of π(A), or π(A) is a dilation of Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 19: Completely positive maps in quantum information

Stinespring’s Theorem

Stinespring’s Theorem 1955Let A be a C∗-algebra with a unit, let H be a Hilbert space, and let Φ bea linear function from A to B(H). Then a necessary and sufficientcondition for Φ to be completely positive is that Φ have the form

Φ(A) = V ∗π(A)V

for all A ∈ A, where V ∈ B(H,K); and π is a ∗-representation of A intoB(K).

We may assume that π(I) = IK. Φ is unital if and only if V is anisometry,

i.e. V ∗V = IH. In this case, we say that Φ(A) is acompression of π(A), or π(A) is a dilation of Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 20: Completely positive maps in quantum information

Stinespring’s Theorem

Stinespring’s Theorem 1955Let A be a C∗-algebra with a unit, let H be a Hilbert space, and let Φ bea linear function from A to B(H). Then a necessary and sufficientcondition for Φ to be completely positive is that Φ have the form

Φ(A) = V ∗π(A)V

for all A ∈ A, where V ∈ B(H,K); and π is a ∗-representation of A intoB(K).

We may assume that π(I) = IK. Φ is unital if and only if V is anisometry, i.e. V ∗V = IH.

In this case, we say that Φ(A) is acompression of π(A), or π(A) is a dilation of Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 21: Completely positive maps in quantum information

Stinespring’s Theorem

Stinespring’s Theorem 1955Let A be a C∗-algebra with a unit, let H be a Hilbert space, and let Φ bea linear function from A to B(H). Then a necessary and sufficientcondition for Φ to be completely positive is that Φ have the form

Φ(A) = V ∗π(A)V

for all A ∈ A, where V ∈ B(H,K); and π is a ∗-representation of A intoB(K).

We may assume that π(I) = IK. Φ is unital if and only if V is anisometry, i.e. V ∗V = IH. In this case, we say that Φ(A) is acompression of π(A),

or π(A) is a dilation of Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 22: Completely positive maps in quantum information

Stinespring’s Theorem

Stinespring’s Theorem 1955Let A be a C∗-algebra with a unit, let H be a Hilbert space, and let Φ bea linear function from A to B(H). Then a necessary and sufficientcondition for Φ to be completely positive is that Φ have the form

Φ(A) = V ∗π(A)V

for all A ∈ A, where V ∈ B(H,K); and π is a ∗-representation of A intoB(K).

We may assume that π(I) = IK. Φ is unital if and only if V is anisometry, i.e. V ∗V = IH. In this case, we say that Φ(A) is acompression of π(A), or π(A) is a dilation of Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 23: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps, i.e. trΦ(A) = tr A. tr (ai j) =

∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1). rcan be interpreted as the dimension of the external environment Erequired to couple with the principal system so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 24: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps, i.e. trΦ(A) = tr A. tr (ai j) =

∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1). rcan be interpreted as the dimension of the external environment Erequired to couple with the principal system so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 25: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps,

i.e. trΦ(A) = tr A. tr (ai j) =∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1). rcan be interpreted as the dimension of the external environment Erequired to couple with the principal system so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 26: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps, i.e. trΦ(A) = tr A.

tr (ai j) =∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1). rcan be interpreted as the dimension of the external environment Erequired to couple with the principal system so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 27: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps, i.e. trΦ(A) = tr A. tr (ai j) =

∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1). rcan be interpreted as the dimension of the external environment Erequired to couple with the principal system so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 28: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps, i.e. trΦ(A) = tr A. tr (ai j) =

∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1). rcan be interpreted as the dimension of the external environment Erequired to couple with the principal system so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 29: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps, i.e. trΦ(A) = tr A. tr (ai j) =

∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1).

rcan be interpreted as the dimension of the external environment Erequired to couple with the principal system so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 30: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps, i.e. trΦ(A) = tr A. tr (ai j) =

∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1). rcan be interpreted as the dimension of the external environment E

required to couple with the principal system so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 31: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps, i.e. trΦ(A) = tr A. tr (ai j) =

∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1). rcan be interpreted as the dimension of the external environment Erequired to couple with the principal system

so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 32: Completely positive maps in quantum information

Choi’s Theorems

Choi’s Theorem 1975Let Φ : Mn →Mm. Then Φ is completely positive if and only if Φ is ofthe form

Φ(A) =r∑j=1

F ∗j AFj , (1)

where F1, . . . , Fr ∈Mn,m.

Φ is unital if and only if∑rj=1 F

∗j Fj = Im.

In quantum information, quantum channels are trace preservingcompletely positive maps, i.e. trΦ(A) = tr A. tr (ai j) =

∑i ai i.

Φ is trace preserving if and only if∑rj=1 FjF

∗j = In.

Φ is said to have Choi’s rank ≤ r if it can be represented in (1). rcan be interpreted as the dimension of the external environment Erequired to couple with the principal system so that the CP mapcan be evaluated from the composite system.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 33: Completely positive maps in quantum information

Duality

〈A,B〉 = tr AB∗ defines an inner product on Mn,m.

SupposeΦ : Mn →Mm is linear. Then the dual map Φ∗ : Mm →Mn isdefined by 〈Φ(A), B〉 = 〈A,Φ∗(B)〉 for all A ∈Mn, B ∈Mm.

If

Φ(A) =r∑j=1

F ∗j AFj ,

then

Φ∗(B) =r∑j=1

FjBF∗j .

A completely positive map Φ : Mn →Mm is unital if and only if Φ∗is trace preserving.

Can we use this duality to deduce results in trace preservingcompletely positive maps from those in unital completely positivemaps and vice versa?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 34: Completely positive maps in quantum information

Duality

〈A,B〉 = tr AB∗ defines an inner product on Mn,m. SupposeΦ : Mn →Mm is linear.

Then the dual map Φ∗ : Mm →Mn isdefined by 〈Φ(A), B〉 = 〈A,Φ∗(B)〉 for all A ∈Mn, B ∈Mm.

If

Φ(A) =r∑j=1

F ∗j AFj ,

then

Φ∗(B) =r∑j=1

FjBF∗j .

A completely positive map Φ : Mn →Mm is unital if and only if Φ∗is trace preserving.

Can we use this duality to deduce results in trace preservingcompletely positive maps from those in unital completely positivemaps and vice versa?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 35: Completely positive maps in quantum information

Duality

〈A,B〉 = tr AB∗ defines an inner product on Mn,m. SupposeΦ : Mn →Mm is linear. Then the dual map Φ∗ : Mm →Mn isdefined by 〈Φ(A), B〉 = 〈A,Φ∗(B)〉 for all A ∈Mn, B ∈Mm.

If

Φ(A) =r∑j=1

F ∗j AFj ,

then

Φ∗(B) =r∑j=1

FjBF∗j .

A completely positive map Φ : Mn →Mm is unital if and only if Φ∗is trace preserving.

Can we use this duality to deduce results in trace preservingcompletely positive maps from those in unital completely positivemaps and vice versa?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 36: Completely positive maps in quantum information

Duality

〈A,B〉 = tr AB∗ defines an inner product on Mn,m. SupposeΦ : Mn →Mm is linear. Then the dual map Φ∗ : Mm →Mn isdefined by 〈Φ(A), B〉 = 〈A,Φ∗(B)〉 for all A ∈Mn, B ∈Mm.

If

Φ(A) =r∑j=1

F ∗j AFj ,

then

Φ∗(B) =r∑j=1

FjBF∗j .

A completely positive map Φ : Mn →Mm is unital if and only if Φ∗is trace preserving.

Can we use this duality to deduce results in trace preservingcompletely positive maps from those in unital completely positivemaps and vice versa?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 37: Completely positive maps in quantum information

Duality

〈A,B〉 = tr AB∗ defines an inner product on Mn,m. SupposeΦ : Mn →Mm is linear. Then the dual map Φ∗ : Mm →Mn isdefined by 〈Φ(A), B〉 = 〈A,Φ∗(B)〉 for all A ∈Mn, B ∈Mm.

If

Φ(A) =r∑j=1

F ∗j AFj ,

then

Φ∗(B) =r∑j=1

FjBF∗j .

A completely positive map Φ : Mn →Mm is unital if and only if Φ∗is trace preserving.

Can we use this duality to deduce results in trace preservingcompletely positive maps from those in unital completely positivemaps and vice versa?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 38: Completely positive maps in quantum information

Duality

〈A,B〉 = tr AB∗ defines an inner product on Mn,m. SupposeΦ : Mn →Mm is linear. Then the dual map Φ∗ : Mm →Mn isdefined by 〈Φ(A), B〉 = 〈A,Φ∗(B)〉 for all A ∈Mn, B ∈Mm.

If

Φ(A) =r∑j=1

F ∗j AFj ,

then

Φ∗(B) =r∑j=1

FjBF∗j .

A completely positive map Φ : Mn →Mm is unital if and only if Φ∗is trace preserving.

Can we use this duality to deduce results in trace preservingcompletely positive maps from those in unital completely positivemaps and vice versa?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 39: Completely positive maps in quantum information

Duality

〈A,B〉 = tr AB∗ defines an inner product on Mn,m. SupposeΦ : Mn →Mm is linear. Then the dual map Φ∗ : Mm →Mn isdefined by 〈Φ(A), B〉 = 〈A,Φ∗(B)〉 for all A ∈Mn, B ∈Mm.

If

Φ(A) =r∑j=1

F ∗j AFj ,

then

Φ∗(B) =r∑j=1

FjBF∗j .

A completely positive map Φ : Mn →Mm is unital if and only if Φ∗is trace preserving.

Can we use this duality to deduce results in trace preservingcompletely positive maps from those in unital completely positivemaps and vice versa?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 40: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices. Φ is determined by its action on Hn.

5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under whatcondition can we have a completely positive map Φ such thatΦ(Ai) = Bi? If Φ exists, can we choose Φ with additionalproperties? E.g. unital, trace preserving, Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 41: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices. Φ is determined by its action on Hn.

5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under whatcondition can we have a completely positive map Φ such thatΦ(Ai) = Bi? If Φ exists, can we choose Φ with additionalproperties? E.g. unital, trace preserving, Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 42: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices. Φ is determined by its action on Hn.

5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under whatcondition can we have a completely positive map Φ such thatΦ(Ai) = Bi? If Φ exists, can we choose Φ with additionalproperties? E.g. unital, trace preserving, Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 43: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices.

Φ is determined by its action on Hn.5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under what

condition can we have a completely positive map Φ such thatΦ(Ai) = Bi? If Φ exists, can we choose Φ with additionalproperties? E.g. unital, trace preserving, Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 44: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices. Φ is determined by its action on Hn.

5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under whatcondition can we have a completely positive map Φ such thatΦ(Ai) = Bi? If Φ exists, can we choose Φ with additionalproperties? E.g. unital, trace preserving, Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 45: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices. Φ is determined by its action on Hn.

5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under whatcondition can we have a completely positive map Φ such thatΦ(Ai) = Bi?

If Φ exists, can we choose Φ with additionalproperties? E.g. unital, trace preserving, Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 46: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices. Φ is determined by its action on Hn.

5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under whatcondition can we have a completely positive map Φ such thatΦ(Ai) = Bi? If Φ exists, can we choose Φ with additionalproperties?

E.g. unital, trace preserving, Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 47: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices. Φ is determined by its action on Hn.

5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under whatcondition can we have a completely positive map Φ such thatΦ(Ai) = Bi? If Φ exists, can we choose Φ with additionalproperties? E.g. unital,

trace preserving, Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 48: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices. Φ is determined by its action on Hn.

5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under whatcondition can we have a completely positive map Φ such thatΦ(Ai) = Bi? If Φ exists, can we choose Φ with additionalproperties? E.g. unital, trace preserving,

Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 49: Completely positive maps in quantum information

General problems

1 Given A ∈Mn and B ∈Mm, when is there a completely positivemap Φ(A) = B?

2 What about Φ(Ai) = Bi for A1, . . . , Ak ∈Mn andB1, . . . , Bk ∈Mm?

3 Deduce properties of Φ based on the information of Φ(A) for somespecial matrices A.

4 Let Hn = {A ∈Mn : A = A∗} be the set of n× n Hermitianmatrices. Φ is determined by its action on Hn.

5 Given A1, . . . , Ak ∈ Hn and B1, . . . , Bk ∈ Hm, under whatcondition can we have a completely positive map Φ such thatΦ(Ai) = Bi? If Φ exists, can we choose Φ with additionalproperties? E.g. unital, trace preserving, Choi’s rank ≤ r.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 50: Completely positive maps in quantum information

Why study?

It is a general interpolation problem for completely positive maps.

It is related to dilation/compression problems of operators.

In quantum information, quantum operations and channels arecompletely positive maps. The study is relevant to problems inquantum tomography, quantum control and quantum errorcorrection.

One often tries to deduce the properties of Φ through the study ofΦ(A) for some special A.

The study is related to other topics such as matrix inequalities(majorization), unitary orbits (algebraic, analytic and geometricproperties), algebraic combinatorics etc.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 51: Completely positive maps in quantum information

Why study?

It is a general interpolation problem for completely positive maps.

It is related to dilation/compression problems of operators.

In quantum information, quantum operations and channels arecompletely positive maps. The study is relevant to problems inquantum tomography, quantum control and quantum errorcorrection.

One often tries to deduce the properties of Φ through the study ofΦ(A) for some special A.

The study is related to other topics such as matrix inequalities(majorization), unitary orbits (algebraic, analytic and geometricproperties), algebraic combinatorics etc.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 52: Completely positive maps in quantum information

Why study?

It is a general interpolation problem for completely positive maps.

It is related to dilation/compression problems of operators.

In quantum information, quantum operations and channels arecompletely positive maps. The study is relevant to problems inquantum tomography, quantum control and quantum errorcorrection.

One often tries to deduce the properties of Φ through the study ofΦ(A) for some special A.

The study is related to other topics such as matrix inequalities(majorization), unitary orbits (algebraic, analytic and geometricproperties), algebraic combinatorics etc.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 53: Completely positive maps in quantum information

Why study?

It is a general interpolation problem for completely positive maps.

It is related to dilation/compression problems of operators.

In quantum information, quantum operations and channels arecompletely positive maps.

The study is relevant to problems inquantum tomography, quantum control and quantum errorcorrection.

One often tries to deduce the properties of Φ through the study ofΦ(A) for some special A.

The study is related to other topics such as matrix inequalities(majorization), unitary orbits (algebraic, analytic and geometricproperties), algebraic combinatorics etc.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 54: Completely positive maps in quantum information

Why study?

It is a general interpolation problem for completely positive maps.

It is related to dilation/compression problems of operators.

In quantum information, quantum operations and channels arecompletely positive maps. The study is relevant to problems inquantum tomography, quantum control and quantum errorcorrection.

One often tries to deduce the properties of Φ through the study ofΦ(A) for some special A.

The study is related to other topics such as matrix inequalities(majorization), unitary orbits (algebraic, analytic and geometricproperties), algebraic combinatorics etc.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 55: Completely positive maps in quantum information

Why study?

It is a general interpolation problem for completely positive maps.

It is related to dilation/compression problems of operators.

In quantum information, quantum operations and channels arecompletely positive maps. The study is relevant to problems inquantum tomography, quantum control and quantum errorcorrection.

One often tries to deduce the properties of Φ through the study ofΦ(A) for some special A.

The study is related to other topics such as matrix inequalities(majorization), unitary orbits (algebraic, analytic and geometricproperties), algebraic combinatorics etc.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 56: Completely positive maps in quantum information

Why study?

It is a general interpolation problem for completely positive maps.

It is related to dilation/compression problems of operators.

In quantum information, quantum operations and channels arecompletely positive maps. The study is relevant to problems inquantum tomography, quantum control and quantum errorcorrection.

One often tries to deduce the properties of Φ through the study ofΦ(A) for some special A.

The study is related to other topics such as matrix inequalities(majorization), unitary orbits (algebraic, analytic and geometricproperties), algebraic combinatorics etc.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 57: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. Then there is a completely positive mapΦ : Mn →Mm such that Φ(A) = B if and only if there are real numbersγ1, γ2 ≥ 0 such that

γ1λ1(A) ≥ λ1(B) and λm(B) ≥ γ2λn(A). (2)

Moreover, there is γ = γ1 = γ2 > 0 satisfies (2) if and only if there is acompletely positive map Φ : Mn →Mm such that Φ(In) = γIm andΦ(A) = B. Here, λ1(A) ≥ · · · ≥ λn(A) are the eigenvalues of A. Letλ(A) = (λ1(A) ≥ · · · ≥ λn(A)).

MajorizationLet a = (a1, . . . , an) and b = (b1, . . . , bn), with ai ≥ ai+1 and bi ≥ bi+1for 1 ≤ i ≤ n− 1. b is said to be majorized by a, b ≺ a if∑ki=1 bi ≤

∑ki=1 ai for all 1 ≤ k ≤ n− 1 and

∑ni=1 bi =

∑ni=1 ai.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 58: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. Then there is a completely positive mapΦ : Mn →Mm such that Φ(A) = B if and only if there are real numbersγ1, γ2 ≥ 0 such that

γ1λ1(A) ≥ λ1(B) and λm(B) ≥ γ2λn(A). (2)

Moreover, there is γ = γ1 = γ2 > 0 satisfies (2)

if and only if there is acompletely positive map Φ : Mn →Mm such that Φ(In) = γIm andΦ(A) = B. Here, λ1(A) ≥ · · · ≥ λn(A) are the eigenvalues of A. Letλ(A) = (λ1(A) ≥ · · · ≥ λn(A)).

MajorizationLet a = (a1, . . . , an) and b = (b1, . . . , bn), with ai ≥ ai+1 and bi ≥ bi+1for 1 ≤ i ≤ n− 1. b is said to be majorized by a, b ≺ a if∑ki=1 bi ≤

∑ki=1 ai for all 1 ≤ k ≤ n− 1 and

∑ni=1 bi =

∑ni=1 ai.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 59: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. Then there is a completely positive mapΦ : Mn →Mm such that Φ(A) = B if and only if there are real numbersγ1, γ2 ≥ 0 such that

γ1λ1(A) ≥ λ1(B) and λm(B) ≥ γ2λn(A). (2)

Moreover, there is γ = γ1 = γ2 > 0 satisfies (2) if and only if there is acompletely positive map Φ : Mn →Mm such that Φ(In) = γIm andΦ(A) = B.

Here, λ1(A) ≥ · · · ≥ λn(A) are the eigenvalues of A. Letλ(A) = (λ1(A) ≥ · · · ≥ λn(A)).

MajorizationLet a = (a1, . . . , an) and b = (b1, . . . , bn), with ai ≥ ai+1 and bi ≥ bi+1for 1 ≤ i ≤ n− 1. b is said to be majorized by a, b ≺ a if∑ki=1 bi ≤

∑ki=1 ai for all 1 ≤ k ≤ n− 1 and

∑ni=1 bi =

∑ni=1 ai.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 60: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. Then there is a completely positive mapΦ : Mn →Mm such that Φ(A) = B if and only if there are real numbersγ1, γ2 ≥ 0 such that

γ1λ1(A) ≥ λ1(B) and λm(B) ≥ γ2λn(A). (2)

Moreover, there is γ = γ1 = γ2 > 0 satisfies (2) if and only if there is acompletely positive map Φ : Mn →Mm such that Φ(In) = γIm andΦ(A) = B. Here, λ1(A) ≥ · · · ≥ λn(A) are the eigenvalues of A.

Letλ(A) = (λ1(A) ≥ · · · ≥ λn(A)).

MajorizationLet a = (a1, . . . , an) and b = (b1, . . . , bn), with ai ≥ ai+1 and bi ≥ bi+1for 1 ≤ i ≤ n− 1. b is said to be majorized by a, b ≺ a if∑ki=1 bi ≤

∑ki=1 ai for all 1 ≤ k ≤ n− 1 and

∑ni=1 bi =

∑ni=1 ai.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 61: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. Then there is a completely positive mapΦ : Mn →Mm such that Φ(A) = B if and only if there are real numbersγ1, γ2 ≥ 0 such that

γ1λ1(A) ≥ λ1(B) and λm(B) ≥ γ2λn(A). (2)

Moreover, there is γ = γ1 = γ2 > 0 satisfies (2) if and only if there is acompletely positive map Φ : Mn →Mm such that Φ(In) = γIm andΦ(A) = B. Here, λ1(A) ≥ · · · ≥ λn(A) are the eigenvalues of A. Letλ(A) = (λ1(A) ≥ · · · ≥ λn(A)).

MajorizationLet a = (a1, . . . , an) and b = (b1, . . . , bn), with ai ≥ ai+1 and bi ≥ bi+1for 1 ≤ i ≤ n− 1. b is said to be majorized by a, b ≺ a if∑ki=1 bi ≤

∑ki=1 ai for all 1 ≤ k ≤ n− 1 and

∑ni=1 bi =

∑ni=1 ai.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 62: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. Then there is a completely positive mapΦ : Mn →Mm such that Φ(A) = B if and only if there are real numbersγ1, γ2 ≥ 0 such that

γ1λ1(A) ≥ λ1(B) and λm(B) ≥ γ2λn(A). (2)

Moreover, there is γ = γ1 = γ2 > 0 satisfies (2) if and only if there is acompletely positive map Φ : Mn →Mm such that Φ(In) = γIm andΦ(A) = B. Here, λ1(A) ≥ · · · ≥ λn(A) are the eigenvalues of A. Letλ(A) = (λ1(A) ≥ · · · ≥ λn(A)).

MajorizationLet a = (a1, . . . , an) and b = (b1, . . . , bn), with ai ≥ ai+1 and bi ≥ bi+1for 1 ≤ i ≤ n− 1.

b is said to be majorized by a, b ≺ a if∑ki=1 bi ≤

∑ki=1 ai for all 1 ≤ k ≤ n− 1 and

∑ni=1 bi =

∑ni=1 ai.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 63: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. Then there is a completely positive mapΦ : Mn →Mm such that Φ(A) = B if and only if there are real numbersγ1, γ2 ≥ 0 such that

γ1λ1(A) ≥ λ1(B) and λm(B) ≥ γ2λn(A). (2)

Moreover, there is γ = γ1 = γ2 > 0 satisfies (2) if and only if there is acompletely positive map Φ : Mn →Mm such that Φ(In) = γIm andΦ(A) = B. Here, λ1(A) ≥ · · · ≥ λn(A) are the eigenvalues of A. Letλ(A) = (λ1(A) ≥ · · · ≥ λn(A)).

MajorizationLet a = (a1, . . . , an) and b = (b1, . . . , bn), with ai ≥ ai+1 and bi ≥ bi+1for 1 ≤ i ≤ n− 1. b is said to be majorized by a, b ≺ a if

∑ki=1 bi ≤

∑ki=1 ai for all 1 ≤ k ≤ n− 1 and

∑ni=1 bi =

∑ni=1 ai.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 64: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. Then there is a completely positive mapΦ : Mn →Mm such that Φ(A) = B if and only if there are real numbersγ1, γ2 ≥ 0 such that

γ1λ1(A) ≥ λ1(B) and λm(B) ≥ γ2λn(A). (2)

Moreover, there is γ = γ1 = γ2 > 0 satisfies (2) if and only if there is acompletely positive map Φ : Mn →Mm such that Φ(In) = γIm andΦ(A) = B. Here, λ1(A) ≥ · · · ≥ λn(A) are the eigenvalues of A. Letλ(A) = (λ1(A) ≥ · · · ≥ λn(A)).

MajorizationLet a = (a1, . . . , an) and b = (b1, . . . , bn), with ai ≥ ai+1 and bi ≥ bi+1for 1 ≤ i ≤ n− 1. b is said to be majorized by a, b ≺ a if∑ki=1 bi ≤

∑ki=1 ai for all 1 ≤ k ≤ n− 1 and

∑ni=1 bi =

∑ni=1 ai.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 65: Completely positive maps in quantum information

Some results for k = 1

TheoremSuppose A ∈ Hn has k non-negative eigenvalues and n− k negativeeigenvalues, and B ∈ Hm. The following conditions are equivalent.

(a) There is a trace preserving completely positive linear mapΦ : Mn →Mm such that φ(A) = B.

(b) λ(B) ≺ (a+, 0, . . . , 0, a−) ∈ Rm wherea+ =

∑kj=1 λj(A) and a− =

∑nj=k+1 λj(A).

(c) There is an n×m row stochastic matrix D such thatλ(B) = λ(A)D. D = (di j) with di j ≥ 0,

∑nj=1 di j = 1 for all

1 ≤ i ≤ n.

(d) There is an n×m row stochastic matrix D with the first k rows allequal and the last n− k rows all equal such that λ(B) = λ(A)D.

Remark For density matrices, (A, B ≥ 0, tr A = tr B = 1), we haveλ(B) ≺ (1, 0, . . . , 0) and condition (b) holds.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 66: Completely positive maps in quantum information

Some results for k = 1

TheoremSuppose A ∈ Hn has k non-negative eigenvalues and n− k negativeeigenvalues, and B ∈ Hm. The following conditions are equivalent.

(a) There is a trace preserving completely positive linear mapΦ : Mn →Mm such that φ(A) = B.

(b) λ(B) ≺ (a+, 0, . . . , 0, a−) ∈ Rm wherea+ =

∑kj=1 λj(A) and a− =

∑nj=k+1 λj(A).

(c) There is an n×m row stochastic matrix D such thatλ(B) = λ(A)D. D = (di j) with di j ≥ 0,

∑nj=1 di j = 1 for all

1 ≤ i ≤ n.

(d) There is an n×m row stochastic matrix D with the first k rows allequal and the last n− k rows all equal such that λ(B) = λ(A)D.

Remark For density matrices, (A, B ≥ 0, tr A = tr B = 1), we haveλ(B) ≺ (1, 0, . . . , 0) and condition (b) holds.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 67: Completely positive maps in quantum information

Some results for k = 1

TheoremSuppose A ∈ Hn has k non-negative eigenvalues and n− k negativeeigenvalues, and B ∈ Hm. The following conditions are equivalent.

(a) There is a trace preserving completely positive linear mapΦ : Mn →Mm such that φ(A) = B.

(b) λ(B) ≺ (a+, 0, . . . , 0, a−) ∈ Rm wherea+ =

∑kj=1 λj(A) and a− =

∑nj=k+1 λj(A).

(c) There is an n×m row stochastic matrix D such thatλ(B) = λ(A)D. D = (di j) with di j ≥ 0,

∑nj=1 di j = 1 for all

1 ≤ i ≤ n.

(d) There is an n×m row stochastic matrix D with the first k rows allequal and the last n− k rows all equal such that λ(B) = λ(A)D.

Remark For density matrices, (A, B ≥ 0, tr A = tr B = 1), we haveλ(B) ≺ (1, 0, . . . , 0) and condition (b) holds.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 68: Completely positive maps in quantum information

Some results for k = 1

TheoremSuppose A ∈ Hn has k non-negative eigenvalues and n− k negativeeigenvalues, and B ∈ Hm. The following conditions are equivalent.

(a) There is a trace preserving completely positive linear mapΦ : Mn →Mm such that φ(A) = B.

(b) λ(B) ≺ (a+, 0, . . . , 0, a−) ∈ Rm wherea+ =

∑kj=1 λj(A) and a− =

∑nj=k+1 λj(A).

(c) There is an n×m row stochastic matrix D such thatλ(B) = λ(A)D.

D = (di j) with di j ≥ 0,∑nj=1 di j = 1 for all

1 ≤ i ≤ n.

(d) There is an n×m row stochastic matrix D with the first k rows allequal and the last n− k rows all equal such that λ(B) = λ(A)D.

Remark For density matrices, (A, B ≥ 0, tr A = tr B = 1), we haveλ(B) ≺ (1, 0, . . . , 0) and condition (b) holds.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 69: Completely positive maps in quantum information

Some results for k = 1

TheoremSuppose A ∈ Hn has k non-negative eigenvalues and n− k negativeeigenvalues, and B ∈ Hm. The following conditions are equivalent.

(a) There is a trace preserving completely positive linear mapΦ : Mn →Mm such that φ(A) = B.

(b) λ(B) ≺ (a+, 0, . . . , 0, a−) ∈ Rm wherea+ =

∑kj=1 λj(A) and a− =

∑nj=k+1 λj(A).

(c) There is an n×m row stochastic matrix D such thatλ(B) = λ(A)D. D = (di j) with di j ≥ 0,

∑nj=1 di j = 1 for all

1 ≤ i ≤ n.

(d) There is an n×m row stochastic matrix D with the first k rows allequal and the last n− k rows all equal such that λ(B) = λ(A)D.

Remark For density matrices, (A, B ≥ 0, tr A = tr B = 1), we haveλ(B) ≺ (1, 0, . . . , 0) and condition (b) holds.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 70: Completely positive maps in quantum information

Some results for k = 1

TheoremSuppose A ∈ Hn has k non-negative eigenvalues and n− k negativeeigenvalues, and B ∈ Hm. The following conditions are equivalent.

(a) There is a trace preserving completely positive linear mapΦ : Mn →Mm such that φ(A) = B.

(b) λ(B) ≺ (a+, 0, . . . , 0, a−) ∈ Rm wherea+ =

∑kj=1 λj(A) and a− =

∑nj=k+1 λj(A).

(c) There is an n×m row stochastic matrix D such thatλ(B) = λ(A)D. D = (di j) with di j ≥ 0,

∑nj=1 di j = 1 for all

1 ≤ i ≤ n.

(d) There is an n×m row stochastic matrix D with the first k rows allequal and the last n− k rows all equal such that λ(B) = λ(A)D.

Remark For density matrices, (A, B ≥ 0, tr A = tr B = 1), we haveλ(B) ≺ (1, 0, . . . , 0) and condition (b) holds.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 71: Completely positive maps in quantum information

Some results for k = 1

TheoremSuppose A ∈ Hn has k non-negative eigenvalues and n− k negativeeigenvalues, and B ∈ Hm. The following conditions are equivalent.

(a) There is a trace preserving completely positive linear mapΦ : Mn →Mm such that φ(A) = B.

(b) λ(B) ≺ (a+, 0, . . . , 0, a−) ∈ Rm wherea+ =

∑kj=1 λj(A) and a− =

∑nj=k+1 λj(A).

(c) There is an n×m row stochastic matrix D such thatλ(B) = λ(A)D. D = (di j) with di j ≥ 0,

∑nj=1 di j = 1 for all

1 ≤ i ≤ n.

(d) There is an n×m row stochastic matrix D with the first k rows allequal and the last n− k rows all equal such that λ(B) = λ(A)D.

Remark For density matrices, (A, B ≥ 0, tr A = tr B = 1), we haveλ(B) ≺ (1, 0, . . . , 0) and condition (b) holds.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 72: Completely positive maps in quantum information

Some results for k = 1

TheoremSuppose A ∈ Hn has k non-negative eigenvalues and n− k negativeeigenvalues, and B ∈ Hm. The following conditions are equivalent.

(a) There is a trace preserving completely positive linear mapΦ : Mn →Mm such that φ(A) = B.

(b) λ(B) ≺ (a+, 0, . . . , 0, a−) ∈ Rm wherea+ =

∑kj=1 λj(A) and a− =

∑nj=k+1 λj(A).

(c) There is an n×m row stochastic matrix D such thatλ(B) = λ(A)D. D = (di j) with di j ≥ 0,

∑nj=1 di j = 1 for all

1 ≤ i ≤ n.

(d) There is an n×m row stochastic matrix D with the first k rows allequal and the last n− k rows all equal such that λ(B) = λ(A)D.

Remark For density matrices, (A, B ≥ 0, tr A = tr B = 1), we haveλ(B) ≺ (1, 0, . . . , 0) and condition (b) holds.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 73: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. The following conditions are equivalent.

There is a unital completely positive linear map Φ such thatΦ(A) = B.

λn(A) ≤ λj(B) ≤ λ1(A) for all j = 1, . . . ,m.

There is an n×m column stochastic matrix D such thatλ(B) = λ(A)D.

Remark The condition may fail even if A and B are density matrices.

QuestionSuppose there is a unital completely positive map sending A to B, anda trace preserving completely positive map sending A to B.Is there a unital and trace preserving completely positive map sending Ato B?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 74: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. The following conditions are equivalent.

There is a unital completely positive linear map Φ such thatΦ(A) = B.

λn(A) ≤ λj(B) ≤ λ1(A) for all j = 1, . . . ,m.

There is an n×m column stochastic matrix D such thatλ(B) = λ(A)D.

Remark The condition may fail even if A and B are density matrices.

QuestionSuppose there is a unital completely positive map sending A to B, anda trace preserving completely positive map sending A to B.Is there a unital and trace preserving completely positive map sending Ato B?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 75: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. The following conditions are equivalent.

There is a unital completely positive linear map Φ such thatΦ(A) = B.

λn(A) ≤ λj(B) ≤ λ1(A) for all j = 1, . . . ,m.

There is an n×m column stochastic matrix D such thatλ(B) = λ(A)D.

Remark The condition may fail even if A and B are density matrices.

QuestionSuppose there is a unital completely positive map sending A to B, anda trace preserving completely positive map sending A to B.Is there a unital and trace preserving completely positive map sending Ato B?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 76: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. The following conditions are equivalent.

There is a unital completely positive linear map Φ such thatΦ(A) = B.

λn(A) ≤ λj(B) ≤ λ1(A) for all j = 1, . . . ,m.

There is an n×m column stochastic matrix D such thatλ(B) = λ(A)D.

Remark The condition may fail even if A and B are density matrices.

QuestionSuppose there is a unital completely positive map sending A to B, anda trace preserving completely positive map sending A to B.Is there a unital and trace preserving completely positive map sending Ato B?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 77: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. The following conditions are equivalent.

There is a unital completely positive linear map Φ such thatΦ(A) = B.

λn(A) ≤ λj(B) ≤ λ1(A) for all j = 1, . . . ,m.

There is an n×m column stochastic matrix D such thatλ(B) = λ(A)D.

Remark The condition may fail even if A and B are density matrices.

QuestionSuppose there is a unital completely positive map sending A to B, anda trace preserving completely positive map sending A to B.Is there a unital and trace preserving completely positive map sending Ato B?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 78: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. The following conditions are equivalent.

There is a unital completely positive linear map Φ such thatΦ(A) = B.

λn(A) ≤ λj(B) ≤ λ1(A) for all j = 1, . . . ,m.

There is an n×m column stochastic matrix D such thatλ(B) = λ(A)D.

Remark The condition may fail even if A and B are density matrices.

QuestionSuppose there is a unital completely positive map sending A to B,

anda trace preserving completely positive map sending A to B.Is there a unital and trace preserving completely positive map sending Ato B?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 79: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. The following conditions are equivalent.

There is a unital completely positive linear map Φ such thatΦ(A) = B.

λn(A) ≤ λj(B) ≤ λ1(A) for all j = 1, . . . ,m.

There is an n×m column stochastic matrix D such thatλ(B) = λ(A)D.

Remark The condition may fail even if A and B are density matrices.

QuestionSuppose there is a unital completely positive map sending A to B, anda trace preserving completely positive map sending A to B.

Is there a unital and trace preserving completely positive map sending Ato B?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 80: Completely positive maps in quantum information

Some results for k = 1

TheoremLet A ∈ Hn and B ∈ Hm. The following conditions are equivalent.

There is a unital completely positive linear map Φ such thatΦ(A) = B.

λn(A) ≤ λj(B) ≤ λ1(A) for all j = 1, . . . ,m.

There is an n×m column stochastic matrix D such thatλ(B) = λ(A)D.

Remark The condition may fail even if A and B are density matrices.

QuestionSuppose there is a unital completely positive map sending A to B, anda trace preserving completely positive map sending A to B.Is there a unital and trace preserving completely positive map sending Ato B?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 81: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0).

Then there is atrace preserving CP map sending A to B, and also a unital CP mapsending A to B. LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).Then there is no trace preserving CP map sending A1 to B1. Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1. Then Φ is

known as a randomized unitary channel in quantum information. Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 82: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0). Then there is atrace preserving CP map sending A to B,

and also a unital CP mapsending A to B. LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).Then there is no trace preserving CP map sending A1 to B1. Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1. Then Φ is

known as a randomized unitary channel in quantum information. Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 83: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0). Then there is atrace preserving CP map sending A to B, and also a unital CP mapsending A to B.

LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).Then there is no trace preserving CP map sending A1 to B1. Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1. Then Φ is

known as a randomized unitary channel in quantum information. Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 84: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0). Then there is atrace preserving CP map sending A to B, and also a unital CP mapsending A to B. LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).

Then there is no trace preserving CP map sending A1 to B1. Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1. Then Φ is

known as a randomized unitary channel in quantum information. Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 85: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0). Then there is atrace preserving CP map sending A to B, and also a unital CP mapsending A to B. LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).Then there is no trace preserving CP map sending A1 to B1.

Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1. Then Φ is

known as a randomized unitary channel in quantum information. Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 86: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0). Then there is atrace preserving CP map sending A to B, and also a unital CP mapsending A to B. LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).Then there is no trace preserving CP map sending A1 to B1. Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1. Then Φ is

known as a randomized unitary channel in quantum information. Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 87: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0). Then there is atrace preserving CP map sending A to B, and also a unital CP mapsending A to B. LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).Then there is no trace preserving CP map sending A1 to B1. Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1.

Then Φ isknown as a randomized unitary channel in quantum information. Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 88: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0). Then there is atrace preserving CP map sending A to B, and also a unital CP mapsending A to B. LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).Then there is no trace preserving CP map sending A1 to B1. Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1. Then Φ is

known as a randomized unitary channel in quantum information.

Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 89: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0). Then there is atrace preserving CP map sending A to B, and also a unital CP mapsending A to B. LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).Then there is no trace preserving CP map sending A1 to B1. Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1. Then Φ is

known as a randomized unitary channel in quantum information. Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 90: Completely positive maps in quantum information

Some results for k = 1

ExampleSuppose A = diag (4, 1, 1, 0) and B = diag (3, 3, 0, 0). Then there is atrace preserving CP map sending A to B, and also a unital CP mapsending A to B. LetA1 = A− I4 = diag (3, 0, 0,−1) and B1 = B − I4 = diag (2, 2,−1,−1).Then there is no trace preserving CP map sending A1 to B1. Hence,there is no unital trace preserving CP map sending A to B.

Randomized unitary channel

Suppose Φ : Mn →Mn is given by Φ(A) =∑rj=1 tiU

∗j AUj , where

U1, . . . , Ur are unitaries and ti ≥ 0, with∑rj=1 ti = 1. Then Φ is

known as a randomized unitary channel in quantum information. Inthis case, Φ is a unital and trace preserving CP map.

For n ≥ 3, there exists a unital and trace preserving CP mapΦ : Mn →Mn which is not a randomized unitary channel.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 91: Completely positive maps in quantum information

TheoremLet A,B ∈ Hn. The following conditions are equivalent.

Φ(A) = B for a unital trace preserving CP map Φ.

Φ(A) = B for a randomized unitary channel Φ.

Φ(A) = B for a randomized unitary channel Φ, with all ti = 1/n.

For each t ∈ R, there exists a trace preserving CP map Φt such thatΦt(A− tI) = B − tI.

λ(B) = diag (U∗AU) for some unitary U .

λ(B) ≺ λ(A)

There is an n× n doubly stochastic (d.s.) matrix D such thatλ(B) = λ(A)D.

D is d.s. if it is both row stochastic and column stochastic.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 92: Completely positive maps in quantum information

TheoremLet A,B ∈ Hn. The following conditions are equivalent.

Φ(A) = B for a unital trace preserving CP map Φ.

Φ(A) = B for a randomized unitary channel Φ.

Φ(A) = B for a randomized unitary channel Φ, with all ti = 1/n.

For each t ∈ R, there exists a trace preserving CP map Φt such thatΦt(A− tI) = B − tI.

λ(B) = diag (U∗AU) for some unitary U .

λ(B) ≺ λ(A)

There is an n× n doubly stochastic (d.s.) matrix D such thatλ(B) = λ(A)D.

D is d.s. if it is both row stochastic and column stochastic.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 93: Completely positive maps in quantum information

TheoremLet A,B ∈ Hn. The following conditions are equivalent.

Φ(A) = B for a unital trace preserving CP map Φ.

Φ(A) = B for a randomized unitary channel Φ.

Φ(A) = B for a randomized unitary channel Φ, with all ti = 1/n.

For each t ∈ R, there exists a trace preserving CP map Φt such thatΦt(A− tI) = B − tI.

λ(B) = diag (U∗AU) for some unitary U .

λ(B) ≺ λ(A)

There is an n× n doubly stochastic (d.s.) matrix D such thatλ(B) = λ(A)D.

D is d.s. if it is both row stochastic and column stochastic.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 94: Completely positive maps in quantum information

TheoremLet A,B ∈ Hn. The following conditions are equivalent.

Φ(A) = B for a unital trace preserving CP map Φ.

Φ(A) = B for a randomized unitary channel Φ.

Φ(A) = B for a randomized unitary channel Φ, with all ti = 1/n.

For each t ∈ R, there exists a trace preserving CP map Φt such thatΦt(A− tI) = B − tI.

λ(B) = diag (U∗AU) for some unitary U .

λ(B) ≺ λ(A)

There is an n× n doubly stochastic (d.s.) matrix D such thatλ(B) = λ(A)D.

D is d.s. if it is both row stochastic and column stochastic.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 95: Completely positive maps in quantum information

TheoremLet A,B ∈ Hn. The following conditions are equivalent.

Φ(A) = B for a unital trace preserving CP map Φ.

Φ(A) = B for a randomized unitary channel Φ.

Φ(A) = B for a randomized unitary channel Φ, with all ti = 1/n.

For each t ∈ R, there exists a trace preserving CP map Φt such thatΦt(A− tI) = B − tI.

λ(B) = diag (U∗AU) for some unitary U .

λ(B) ≺ λ(A)

There is an n× n doubly stochastic (d.s.) matrix D such thatλ(B) = λ(A)D.

D is d.s. if it is both row stochastic and column stochastic.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 96: Completely positive maps in quantum information

TheoremLet A,B ∈ Hn. The following conditions are equivalent.

Φ(A) = B for a unital trace preserving CP map Φ.

Φ(A) = B for a randomized unitary channel Φ.

Φ(A) = B for a randomized unitary channel Φ, with all ti = 1/n.

For each t ∈ R, there exists a trace preserving CP map Φt such thatΦt(A− tI) = B − tI.

λ(B) = diag (U∗AU) for some unitary U .

λ(B) ≺ λ(A)

There is an n× n doubly stochastic (d.s.) matrix D such thatλ(B) = λ(A)D.

D is d.s. if it is both row stochastic and column stochastic.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 97: Completely positive maps in quantum information

TheoremLet A,B ∈ Hn. The following conditions are equivalent.

Φ(A) = B for a unital trace preserving CP map Φ.

Φ(A) = B for a randomized unitary channel Φ.

Φ(A) = B for a randomized unitary channel Φ, with all ti = 1/n.

For each t ∈ R, there exists a trace preserving CP map Φt such thatΦt(A− tI) = B − tI.

λ(B) = diag (U∗AU) for some unitary U .

λ(B) ≺ λ(A)

There is an n× n doubly stochastic (d.s.) matrix D such thatλ(B) = λ(A)D.

D is d.s. if it is both row stochastic and column stochastic.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 98: Completely positive maps in quantum information

TheoremLet A,B ∈ Hn. The following conditions are equivalent.

Φ(A) = B for a unital trace preserving CP map Φ.

Φ(A) = B for a randomized unitary channel Φ.

Φ(A) = B for a randomized unitary channel Φ, with all ti = 1/n.

For each t ∈ R, there exists a trace preserving CP map Φt such thatΦt(A− tI) = B − tI.

λ(B) = diag (U∗AU) for some unitary U .

λ(B) ≺ λ(A)

There is an n× n doubly stochastic (d.s.) matrix D such thatλ(B) = λ(A)D.

D is d.s. if it is both row stochastic and column stochastic.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 99: Completely positive maps in quantum information

TheoremLet A,B ∈ Hn. The following conditions are equivalent.

Φ(A) = B for a unital trace preserving CP map Φ.

Φ(A) = B for a randomized unitary channel Φ.

Φ(A) = B for a randomized unitary channel Φ, with all ti = 1/n.

For each t ∈ R, there exists a trace preserving CP map Φt such thatΦt(A− tI) = B − tI.

λ(B) = diag (U∗AU) for some unitary U .

λ(B) ≺ λ(A)

There is an n× n doubly stochastic (d.s.) matrix D such thatλ(B) = λ(A)D.

D is d.s. if it is both row stochastic and column stochastic.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 100: Completely positive maps in quantum information

Restricted rank

We will use CPr(n,m) to denote CP maps with Choi’s rank ≤ r andCP (n,m) =

⋃r≥1 CPr(n,m).

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists Φ ∈ CPr(n,m) such that Φ(A) = B.

There exists an (nr)×m matrix F such that B = F ∗(A⊗ Ir)F .

The number of positive (negative) eigenvalues of A⊗ Ir is not lessthan the number of positive (negative) eigenvalues of B.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 101: Completely positive maps in quantum information

Restricted rank

We will use CPr(n,m) to denote CP maps with Choi’s rank ≤ r

andCP (n,m) =

⋃r≥1 CPr(n,m).

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists Φ ∈ CPr(n,m) such that Φ(A) = B.

There exists an (nr)×m matrix F such that B = F ∗(A⊗ Ir)F .

The number of positive (negative) eigenvalues of A⊗ Ir is not lessthan the number of positive (negative) eigenvalues of B.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 102: Completely positive maps in quantum information

Restricted rank

We will use CPr(n,m) to denote CP maps with Choi’s rank ≤ r andCP (n,m) =

⋃r≥1 CPr(n,m).

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists Φ ∈ CPr(n,m) such that Φ(A) = B.

There exists an (nr)×m matrix F such that B = F ∗(A⊗ Ir)F .

The number of positive (negative) eigenvalues of A⊗ Ir is not lessthan the number of positive (negative) eigenvalues of B.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 103: Completely positive maps in quantum information

Restricted rank

We will use CPr(n,m) to denote CP maps with Choi’s rank ≤ r andCP (n,m) =

⋃r≥1 CPr(n,m).

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists Φ ∈ CPr(n,m) such that Φ(A) = B.

There exists an (nr)×m matrix F such that B = F ∗(A⊗ Ir)F .

The number of positive (negative) eigenvalues of A⊗ Ir is not lessthan the number of positive (negative) eigenvalues of B.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 104: Completely positive maps in quantum information

Restricted rank

We will use CPr(n,m) to denote CP maps with Choi’s rank ≤ r andCP (n,m) =

⋃r≥1 CPr(n,m).

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists Φ ∈ CPr(n,m) such that Φ(A) = B.

There exists an (nr)×m matrix F such that B = F ∗(A⊗ Ir)F .

The number of positive (negative) eigenvalues of A⊗ Ir is not lessthan the number of positive (negative) eigenvalues of B.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 105: Completely positive maps in quantum information

Restricted rank

We will use CPr(n,m) to denote CP maps with Choi’s rank ≤ r andCP (n,m) =

⋃r≥1 CPr(n,m).

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists Φ ∈ CPr(n,m) such that Φ(A) = B.

There exists an (nr)×m matrix F such that B = F ∗(A⊗ Ir)F .

The number of positive (negative) eigenvalues of A⊗ Ir is not lessthan the number of positive (negative) eigenvalues of B.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 106: Completely positive maps in quantum information

Restricted rank

We will use CPr(n,m) to denote CP maps with Choi’s rank ≤ r andCP (n,m) =

⋃r≥1 CPr(n,m).

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists Φ ∈ CPr(n,m) such that Φ(A) = B.

There exists an (nr)×m matrix F such that B = F ∗(A⊗ Ir)F .

The number of positive (negative) eigenvalues of A⊗ Ir is not lessthan the number of positive (negative) eigenvalues of B.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 107: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists a unital Φ ∈ CPr(n,m) such that Φ(A) = B.

B is a compression of A⊗ Ir, i.e. B = F ∗(A⊗ Ir)F for some(nr)×m F such that F ∗F = Im.

The eigenvalues of A⊗ Ir interlace those of B, i.e.,

λj(A⊗ Ir) ≥ λj(B) and λm+1−j(B) ≥ λn+1−j(A⊗ Ir)

for 1 ≤ j ≤ m.

Remark Even if A,B are density matrices, the roles of A and B are notsymmetric in the last two theorems.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 108: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists a unital Φ ∈ CPr(n,m) such that Φ(A) = B.

B is a compression of A⊗ Ir, i.e. B = F ∗(A⊗ Ir)F for some(nr)×m F such that F ∗F = Im.

The eigenvalues of A⊗ Ir interlace those of B, i.e.,

λj(A⊗ Ir) ≥ λj(B) and λm+1−j(B) ≥ λn+1−j(A⊗ Ir)

for 1 ≤ j ≤ m.

Remark Even if A,B are density matrices, the roles of A and B are notsymmetric in the last two theorems.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 109: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists a unital Φ ∈ CPr(n,m) such that Φ(A) = B.

B is a compression of A⊗ Ir, i.e. B = F ∗(A⊗ Ir)F for some(nr)×m F such that F ∗F = Im.

The eigenvalues of A⊗ Ir interlace those of B, i.e.,

λj(A⊗ Ir) ≥ λj(B) and λm+1−j(B) ≥ λn+1−j(A⊗ Ir)

for 1 ≤ j ≤ m.

Remark Even if A,B are density matrices, the roles of A and B are notsymmetric in the last two theorems.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 110: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists a unital Φ ∈ CPr(n,m) such that Φ(A) = B.

B is a compression of A⊗ Ir, i.e. B = F ∗(A⊗ Ir)F for some(nr)×m F such that F ∗F = Im.

The eigenvalues of A⊗ Ir interlace those of B, i.e.,

λj(A⊗ Ir) ≥ λj(B) and λm+1−j(B) ≥ λn+1−j(A⊗ Ir)

for 1 ≤ j ≤ m.

Remark Even if A,B are density matrices, the roles of A and B are notsymmetric in the last two theorems.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 111: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm. Suppose nr ≥ m. The following conditionsare equivalent.

There exists a unital Φ ∈ CPr(n,m) such that Φ(A) = B.

B is a compression of A⊗ Ir, i.e. B = F ∗(A⊗ Ir)F for some(nr)×m F such that F ∗F = Im.

The eigenvalues of A⊗ Ir interlace those of B, i.e.,

λj(A⊗ Ir) ≥ λj(B) and λm+1−j(B) ≥ λn+1−j(A⊗ Ir)

for 1 ≤ j ≤ m.

Remark Even if A,B are density matrices, the roles of A and B are notsymmetric in the last two theorems.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 112: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm with B =

∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm, andunitary matrices U1, . . . , Ur ∈Mn such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 113: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm with B =

∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm, andunitary matrices U1, . . . , Ur ∈Mn such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 114: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm

with B =∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm, andunitary matrices U1, . . . , Ur ∈Mn such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 115: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm with B =

∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm, andunitary matrices U1, . . . , Ur ∈Mn such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 116: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm with B =

∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm,

andunitary matrices U1, . . . , Ur ∈Mn such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 117: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm with B =

∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm, andunitary matrices U1, . . . , Ur ∈Mn

such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 118: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm with B =

∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm, andunitary matrices U1, . . . , Ur ∈Mn such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 119: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm with B =

∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm, andunitary matrices U1, . . . , Ur ∈Mn such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 120: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm with B =

∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm, andunitary matrices U1, . . . , Ur ∈Mn such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 121: Completely positive maps in quantum information

Restricted rank

TheoremLet A ∈ Hn and B ∈ Hm be positive semidefinite, with mr ≥ n. Thefollowing conditions are equivalent.

(a) There exists a trace preserving Φ ∈ CPr(n,m) such that Φ(A) = B.

(b) There exists a unitary U ∈Mmr such thatU∗(A⊕Omr−n)U = (Ci j), Ci j ∈Mm with B =

∑rj=1 Cjj .

(c) There exist positive semidefinite matrices C1, . . . , Cr ∈ Hm, andunitary matrices U1, . . . , Ur ∈Mn such thatA =

∑rj=1 U

∗j (Cj ⊕On−m)Uj and B =

∑rj=1 Cj .

(d) There exists a trace preserving Ψ ∈ CPr(m,n) such thatΨ(B) = A.

Cj can be choose in the unitary orbit of some C ∈ Hm.

Remark Conditions (c) can be expressed in terms of eigenvalueinequalities using Littlewood-Richardson rules in Schubert calculus.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 122: Completely positive maps in quantum information

Results and questions on multiple matrices

TheoremSuppose {A1, . . . , Ak} and {B1, . . . , Bk} are commuting families ofmatrices in Mn and Mm. Then there is a unital / trace preserving /unital and trace preserving completely positive linear maps Φ such that

Φ(Aj) = Bj for j = 1, . . . , k

if and only if there is an n×m column / row / doubly stochastic matrixD such that λ(Bj) = λ(Aj)D for j = 1, . . . , k.

Question What about non-commuting families? Restricted Choi’s rank?

Consider the case when k = 2. Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm.Let A = A1 + iA2 ∈Mn and B = B1 + iB2. We will study B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 123: Completely positive maps in quantum information

Results and questions on multiple matrices

TheoremSuppose {A1, . . . , Ak} and {B1, . . . , Bk} are commuting families ofmatrices in Mn and Mm. Then there is a unital / trace preserving /unital and trace preserving completely positive linear maps Φ such that

Φ(Aj) = Bj for j = 1, . . . , k

if and only if there is an n×m column / row / doubly stochastic matrixD such that λ(Bj) = λ(Aj)D for j = 1, . . . , k.

Question What about non-commuting families? Restricted Choi’s rank?

Consider the case when k = 2. Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm.Let A = A1 + iA2 ∈Mn and B = B1 + iB2. We will study B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 124: Completely positive maps in quantum information

Results and questions on multiple matrices

TheoremSuppose {A1, . . . , Ak} and {B1, . . . , Bk} are commuting families ofmatrices in Mn and Mm. Then there is a unital / trace preserving /unital and trace preserving completely positive linear maps Φ such that

Φ(Aj) = Bj for j = 1, . . . , k

if and only if there is an n×m column / row / doubly stochastic matrixD such that λ(Bj) = λ(Aj)D for j = 1, . . . , k.

Question What about non-commuting families?

Restricted Choi’s rank?

Consider the case when k = 2. Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm.Let A = A1 + iA2 ∈Mn and B = B1 + iB2. We will study B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 125: Completely positive maps in quantum information

Results and questions on multiple matrices

TheoremSuppose {A1, . . . , Ak} and {B1, . . . , Bk} are commuting families ofmatrices in Mn and Mm. Then there is a unital / trace preserving /unital and trace preserving completely positive linear maps Φ such that

Φ(Aj) = Bj for j = 1, . . . , k

if and only if there is an n×m column / row / doubly stochastic matrixD such that λ(Bj) = λ(Aj)D for j = 1, . . . , k.

Question What about non-commuting families? Restricted Choi’s rank?

Consider the case when k = 2. Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm.Let A = A1 + iA2 ∈Mn and B = B1 + iB2. We will study B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 126: Completely positive maps in quantum information

Results and questions on multiple matrices

TheoremSuppose {A1, . . . , Ak} and {B1, . . . , Bk} are commuting families ofmatrices in Mn and Mm. Then there is a unital / trace preserving /unital and trace preserving completely positive linear maps Φ such that

Φ(Aj) = Bj for j = 1, . . . , k

if and only if there is an n×m column / row / doubly stochastic matrixD such that λ(Bj) = λ(Aj)D for j = 1, . . . , k.

Question What about non-commuting families? Restricted Choi’s rank?

Consider the case when k = 2. Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm.

Let A = A1 + iA2 ∈Mn and B = B1 + iB2. We will study B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 127: Completely positive maps in quantum information

Results and questions on multiple matrices

TheoremSuppose {A1, . . . , Ak} and {B1, . . . , Bk} are commuting families ofmatrices in Mn and Mm. Then there is a unital / trace preserving /unital and trace preserving completely positive linear maps Φ such that

Φ(Aj) = Bj for j = 1, . . . , k

if and only if there is an n×m column / row / doubly stochastic matrixD such that λ(Bj) = λ(Aj)D for j = 1, . . . , k.

Question What about non-commuting families? Restricted Choi’s rank?

Consider the case when k = 2. Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm.Let A = A1 + iA2 ∈Mn and B = B1 + iB2.

We will study B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 128: Completely positive maps in quantum information

Results and questions on multiple matrices

TheoremSuppose {A1, . . . , Ak} and {B1, . . . , Bk} are commuting families ofmatrices in Mn and Mm. Then there is a unital / trace preserving /unital and trace preserving completely positive linear maps Φ such that

Φ(Aj) = Bj for j = 1, . . . , k

if and only if there is an n×m column / row / doubly stochastic matrixD such that λ(Bj) = λ(Aj)D for j = 1, . . . , k.

Question What about non-commuting families? Restricted Choi’s rank?

Consider the case when k = 2. Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm.Let A = A1 + iA2 ∈Mn and B = B1 + iB2. We will study B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 129: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H).

The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 130: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 131: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if

W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 132: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 133: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

].

Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 134: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 135: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].

Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 136: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only if

W (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 137: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 138: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

].

Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 139: Completely positive maps in quantum information

Dilation and compressionLet T ∈ B(H). The numerical range of A isW (T ) = {〈Tx,x〉 : ‖x‖ = 1}.

(Mirman, 1968) Let A ∈M3 be normal. Then B = Φ(A) for aunital CP map Φ if and only if W (B) ⊆W (A).

(Ando, 1973) Let A =[

0 20 0

]. Then B = Φ(A) for a unital CP

map Φ if and only if W (B) ⊆W (A).

(Choi, Li, 2000, 2001) Let A1 ∈M2 and A = A1 or A = A1 ⊕ [a].Then B = Φ(A) for a unital CP map Φ if and only ifW (B) ⊆W (A).

(Choi, Li, 2000) Let A = diag (1,−1, i,−i) or

0 1 00 0 10 0 0

and

B =[

0√

20 0

]. Then W (B) ⊆W (A) but there is no unital CP

map Φ such that B = Φ(A).

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 140: Completely positive maps in quantum information

Choi’s rank = 1

Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm.

Let A = A1 + iA2 andB = B1 + iB2.

There exists a trace preserving Φ ∈ CP1(n,m) such thatΦ(Aj) = Bj for j = 1, 2 if and only if the B is unitary similar toA⊕Om−n.

There exists a unital Φ ∈ CP1(n,m) such that Φ(Aj) = Bj forj = 1, 2 if and only if B is a compression of A, i.e. there is a unitaryU such that B is a principal submatrix of U∗AU . The problem isunsolved for n = 4, m = 2 even when A1 and A2 commute.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 141: Completely positive maps in quantum information

Choi’s rank = 1

Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm. Let A = A1 + iA2 andB = B1 + iB2.

There exists a trace preserving Φ ∈ CP1(n,m) such thatΦ(Aj) = Bj for j = 1, 2 if and only if the B is unitary similar toA⊕Om−n.

There exists a unital Φ ∈ CP1(n,m) such that Φ(Aj) = Bj forj = 1, 2 if and only if B is a compression of A, i.e. there is a unitaryU such that B is a principal submatrix of U∗AU . The problem isunsolved for n = 4, m = 2 even when A1 and A2 commute.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 142: Completely positive maps in quantum information

Choi’s rank = 1

Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm. Let A = A1 + iA2 andB = B1 + iB2.

There exists a trace preserving Φ ∈ CP1(n,m) such thatΦ(Aj) = Bj for j = 1, 2 if and only if the B is unitary similar toA⊕Om−n.

There exists a unital Φ ∈ CP1(n,m) such that Φ(Aj) = Bj forj = 1, 2 if and only if B is a compression of A, i.e. there is a unitaryU such that B is a principal submatrix of U∗AU . The problem isunsolved for n = 4, m = 2 even when A1 and A2 commute.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 143: Completely positive maps in quantum information

Choi’s rank = 1

Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm. Let A = A1 + iA2 andB = B1 + iB2.

There exists a trace preserving Φ ∈ CP1(n,m) such thatΦ(Aj) = Bj for j = 1, 2 if and only if the B is unitary similar toA⊕Om−n.

There exists a unital Φ ∈ CP1(n,m) such that Φ(Aj) = Bj forj = 1, 2 if and only if B is a compression of A,

i.e. there is a unitaryU such that B is a principal submatrix of U∗AU . The problem isunsolved for n = 4, m = 2 even when A1 and A2 commute.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 144: Completely positive maps in quantum information

Choi’s rank = 1

Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm. Let A = A1 + iA2 andB = B1 + iB2.

There exists a trace preserving Φ ∈ CP1(n,m) such thatΦ(Aj) = Bj for j = 1, 2 if and only if the B is unitary similar toA⊕Om−n.

There exists a unital Φ ∈ CP1(n,m) such that Φ(Aj) = Bj forj = 1, 2 if and only if B is a compression of A, i.e. there is a unitaryU such that B is a principal submatrix of U∗AU .

The problem isunsolved for n = 4, m = 2 even when A1 and A2 commute.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 145: Completely positive maps in quantum information

Choi’s rank = 1

Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm. Let A = A1 + iA2 andB = B1 + iB2.

There exists a trace preserving Φ ∈ CP1(n,m) such thatΦ(Aj) = Bj for j = 1, 2 if and only if the B is unitary similar toA⊕Om−n.

There exists a unital Φ ∈ CP1(n,m) such that Φ(Aj) = Bj forj = 1, 2 if and only if B is a compression of A, i.e. there is a unitaryU such that B is a principal submatrix of U∗AU . The problem isunsolved for n = 4, m = 2

even when A1 and A2 commute.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 146: Completely positive maps in quantum information

Choi’s rank = 1

Suppose A1, A2 ∈ Hn and B1, B2 ∈ Hm. Let A = A1 + iA2 andB = B1 + iB2.

There exists a trace preserving Φ ∈ CP1(n,m) such thatΦ(Aj) = Bj for j = 1, 2 if and only if the B is unitary similar toA⊕Om−n.

There exists a unital Φ ∈ CP1(n,m) such that Φ(Aj) = Bj forj = 1, 2 if and only if B is a compression of A, i.e. there is a unitaryU such that B is a principal submatrix of U∗AU . The problem isunsolved for n = 4, m = 2 even when A1 and A2 commute.

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 147: Completely positive maps in quantum information

Restricted rank on multiple matrices

Theorem [Poon 1992]Let Φ ∈ CP (n,m) be unital and A1, . . . , Ak ∈ Hn.

If 1 ≤ r ≤ mn− 1and m2(k + 1)− 1 < (r + 1)2 − δmn, r+1, then there exists a unitalΨ ∈ CPr(nm) such that for all 1 ≤ i ≤ k,

Ψ(Ai) = Φ(Ai)

For example, if n > 2, k = 3 and r = 2m− 1 , then the condition issatisfied.

What about trace preserving completely positive maps?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 148: Completely positive maps in quantum information

Restricted rank on multiple matrices

Theorem [Poon 1992]Let Φ ∈ CP (n,m) be unital and A1, . . . , Ak ∈ Hn. If 1 ≤ r ≤ mn− 1and m2(k + 1)− 1 < (r + 1)2 − δmn, r+1,

then there exists a unitalΨ ∈ CPr(nm) such that for all 1 ≤ i ≤ k,

Ψ(Ai) = Φ(Ai)

For example, if n > 2, k = 3 and r = 2m− 1 , then the condition issatisfied.

What about trace preserving completely positive maps?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 149: Completely positive maps in quantum information

Restricted rank on multiple matrices

Theorem [Poon 1992]Let Φ ∈ CP (n,m) be unital and A1, . . . , Ak ∈ Hn. If 1 ≤ r ≤ mn− 1and m2(k + 1)− 1 < (r + 1)2 − δmn, r+1, then there exists a unitalΨ ∈ CPr(nm) such that for all 1 ≤ i ≤ k,

Ψ(Ai) = Φ(Ai)

For example, if n > 2, k = 3 and r = 2m− 1 , then the condition issatisfied.

What about trace preserving completely positive maps?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 150: Completely positive maps in quantum information

Restricted rank on multiple matrices

Theorem [Poon 1992]Let Φ ∈ CP (n,m) be unital and A1, . . . , Ak ∈ Hn. If 1 ≤ r ≤ mn− 1and m2(k + 1)− 1 < (r + 1)2 − δmn, r+1, then there exists a unitalΨ ∈ CPr(nm) such that for all 1 ≤ i ≤ k,

Ψ(Ai) = Φ(Ai)

For example, if n > 2, k = 3 and r = 2m− 1 , then the condition issatisfied.

What about trace preserving completely positive maps?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 151: Completely positive maps in quantum information

Restricted rank on multiple matrices

Theorem [Poon 1992]Let Φ ∈ CP (n,m) be unital and A1, . . . , Ak ∈ Hn. If 1 ≤ r ≤ mn− 1and m2(k + 1)− 1 < (r + 1)2 − δmn, r+1, then there exists a unitalΨ ∈ CPr(nm) such that for all 1 ≤ i ≤ k,

Ψ(Ai) = Φ(Ai)

For example, if n > 2, k = 3 and r = 2m− 1 , then the condition issatisfied.

What about trace preserving completely positive maps?

Yiu Tung Poon Completely Positive Maps in Quantum Information

Page 152: Completely positive maps in quantum information

Thank you for your attention!

Yiu Tung Poon Completely Positive Maps in Quantum Information