|
Abstract |
A long-standing open question asks for the minimum number of vectors needed to form an unextendible product basis in a given bipartite or multipartite Hilbert space. A partial solution was found by Alon and Lovasz in 2001, but since then only a few other cases have been solved. We solve all remaining bipartite cases, as well as a large family of multipartite cases. Based on arXiv:1301.1406
Short Bio: Dr. Jianxin Chen completed his Ph.D in Computer Science at Tsinghua University in 2010, under the supervision of Prof. Mingsheng Ying. He joined IQC as a Postdoctoral Fellow (jointly with University of Guelph) in the Fall of 2010. He will move to University of Maryland this fall. Dr. Jianxin Chen's research focuses on the theory of quantum information and its applications to algorithms, complexity theory and cryptography. Specific topics that he is currently interested in include algebraic geometry applications in quantum information theory, the theory of entanglement, quantum channels and many-body quantum systems. |
