"Convex Geometric Analysis, Random Matrices, and Their Applications to Quantum Information Theory"

点击翻译按钮获取中文摘要

In recent years, random constructions have become a very fruitful tool in Quantum Information Theory (QIT). The high-dimensional setting is very common in QIT since mathematical descriptions of QIT (as well as other scientific and engineering) questions often involve a large number of degrees of freedom (which can be interpreted as the dimension). For instance, the state space of an 8 qutrit quantum system is of dimension of more than 43 million. Such a high-dimensional setting makes the numerical approach impractical. However, Geometric Functional Analysis (GFA) and Random Matrices (RM) bring the "blessing of dimensionality" because of the "central limit theorem-like" effects. These areas aim to understand typical features of geometric objects and matrix valued probability measures as the dimension become large. Another common feature for QIT is convexity. Many objects of interest in QIT are convex bodies. Hence, understanding the geometric properties of convex bodies is important for QIT, and is the main goal for Convex Geometric Analysis (CGA).