![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 03 September 2013, 09:00-10:00
Lecture 2: Entanglement in quantum interactive proofs (tutorial)
- đ¤ Speaker: Vidick, T (Massachusetts Institute of Technology)
- đ Date & Time: Tuesday 03 September 2013, 09:00 - 10:00
- đ Venue: Seminar Room 1, Newton Institute
Abstract
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.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- CMS Events
- CQIF Seminar
- DAMTP info aggregator
- dh539
- Featured lists
- Hanchen DaDaDash
- INI info aggregator
- Interested Talks
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.