Lecture 2: Entanglement in quantum interactive proofs (tutorial)
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani.
Mathematical Challenges in Quantum Information
In the first lecture I will present the reasonably well-understood topic of entanglement in XOR games. We will review results by Tsirelson and Slofstra which provide lower and upper bounds on the dimension of entanglement required to play (near-)optimally. These results are obtained through connections with semidefinite programming and the theory of C*-algebras.
In the second lecture I will move to more general classes of games. I will introduce an interesting “universal” class of entangled states, embezzlement states, and discuss some of their properties. I will present some lower bounds on entanglement dimension, leaving the proof of upper bounds as an exercise to the audience. Time permitting I will connect these results to the complexity theory of multi-prover interactive proofs.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|