Quantum Information Theory, Fall 2010 at Institut Mittag-Leffler

msra(2010)

引用 23|浏览2
暂无评分
摘要
Since Shor's discovery in 1994 of a polynomial time algorithm for factoring large numbers with a quantum computer, interest in using quantum systems for infor- mation processing increased dramatically. Although building a quantum computer remains a formidable technological challenge, other types of quantum information processing devices, particularly those for cryptographic purposes, have been demon- strated to be feasible. The theoretical side of quantum information processing is also developing rapidly, raising many interesting and difficult mathematical ques- tions that go well beyond algorithm development and computational complexity. This semester at the Institut Mittag-Leffler will be devoted to mathematical ques- tions in quantum information theory, with a particular emphasis on questions in operator theory, non-commutative analysis and convex geometry. Quantum information theory today is a very multi-faceted field, with a multitude of mathematical connections: ranging from quantum error correcting codes (whose description and construction draws on classical coding theory as well as operator algebra theory), to quantum Shannon theory (linking with quantum versions of laws of large numbers, geometric measure concentration, and classical information the- ory), to quantum non-locality, i.e. "Bell inequalities" (convex geometry, and recently drawing on results on tensor norms), to quantum many-body physics (involving op- erator analysis, quantum laws of large numbers and, recently, increasing connections to theoretical computer science). Many of the interesting questions generated by quantum information theory appear as questions about "only" finite dimensional operators. Nevertheless, quantum information theory generates a wealth of highly nontrivial mathematical problems, due to several reasons: some questions involve asymptotic limits of the matrix size, others are concerned with nonlinear aspects of matrices such as functional calculus, the semidefinite partial order on matrices, or specific, well-motivated matrix norms. The topics mentioned above, as well as related ones such as quantification and classification of entanglement, quantum complexity, quantum state estimation and hypothesis testing, have both its mathematical language and the physical intuition in common. Thus, the subject of quantum information theory is truly interdisci- plinary, with collaborations often involving people in computer science and engi- neering as well as physics and mathematics. In addition to including most of the leading experts in quantum information theory among the participants, we plan to invite mathematicians working in related fields who have expressed an interest in interacting with quantum information theorists. We expect this cross-fertilization to be extremely productive and stimulating.
更多
查看译文
关键词
computational complexity,coding theory,hypothesis test,operator algebra,quantum information theory,partial order,convex geometry,quantum information,functional calculus,quantum computer,law of large numbers,bell inequality
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要