Leírás
Abstract:
In quantum communication, information is encoded by quantum states. Mathematically, a quantum state is described by a density operator on a Hilbert space which, for us, will have a fixed finite dimension $n$. Communication is most efficient if we use pure states. In this talk, however, we consider a noisy quantum channel where each state used for the encoding is mixed "to at least a certain extent". If shared randomness is available to the sender and the receiver, then any such channel can be simulated by an $n$-state classical channel using classical states that are "at least as mixed" as the corresponding quantum states. In mathematical terms, this theorem boils down to inequalities regarding mixed discriminants and eigenvalues of positive semidefinite matrices. The aim of the talk is to present the proof in such linear algebra terms.
https://zoom.us/j/93566694314?pwd=UkQybXRPWkhpZ3RCOFV5Ly9PV1RWUT09
Meeting ID: 935 6669 4314
Passcode: 233745