Postdoctoral Seminar

Mizanur Rahaman, Department of Pure Mathematics, University of Waterloo

"Eventually Entanglement Breaking Maps"

Detecting separability is one of the important tasks in quantum information theory. Computationally it is an NP hard problem to decide whether a state is separable or not. The spooky phenomena called "entanglement", that is, states that are not separable, can be exploited in many counter intuitive applications related to quantum computing. Fortunately, we have a very nice mathematical description of all the "physics-words" written above.

In this talk, I will review these concepts in a mathematical framework and discuss about an (open) problem that arose directly from a LAB. This is known as a PPT-squared conjecture. I will also mention some recent progress that took place in solving the problem. The talk will be  accessible to everyone and no prior knowledge of quantum information or operator algebras will be assumed.

MC 5403