题目：On Positive Partial Transpose Squared Conjecture
报告人：杨宇（重庆工商大学）
时间：7月13日, 16:30-17:30
地点：格物楼522学术报告厅
摘要：Linear maps that are both completely positive and completely copositive are often called PPT binding maps. Here PPT stands for “pos- itive partial transposition” since the Choi matrix of such a map is positive under partial transpose. The PPT squared conjecture asks whether the composition φ2 ◦ φ1 of two PPT maps φ1 and φ2 is entanglement break- ing where φ1, φ2 ∈ Mn(C) ⊗ Mn(C). We shall talk about our proof of PPT squared conjecture in the case n=3. Another proof is claimed by Alexzander Muller Hermes from University of Copenhagen independently. The validity of PPT squared conjecture in the case n=4 is widely believed to fail but no counterexample is given so far.
