BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Nonlocal games involving quantum graphs - Priyanga Ganesan (Univer
 sity of California\, San Diego)
DTSTART:20241202T111000Z
DTEND:20241202T115000Z
UID:TALK218587@talks.cam.ac.uk
DESCRIPTION:Quantum graphs are a non-commutative generalization of classic
 al graphs that have received significant attention in recent years due to 
 their&nbsp\;close connections to operator spaces\, C*-algebras\, quantum i
 nformation theory and quantum groups. In this talk\, I will provide an int
 roduction to quantum graphs and discuss some quantum-input and quantum-out
 put nonlocal games involving quantum graphs.&nbsp\;\n&nbsp\;\nA nonlocal g
 ame typically involves two non-communicating players who jointly try to co
 nvince a verifier about something by answering with a winning pair of resp
 onses to questions posed by the verifier. In this talk\, I will survey som
 e recent approaches to nonlocal homomorphism games for quantum graphs and 
 discuss how these notions connect with one another. In the case of classic
 al graphs\, it is well-known that winning strategies for the graph isomorp
 hism game arise from certain quantum permutation matrices that intertwine 
 the adjacency matrices of the two graphs. It will be highlighted that anal
 ogous results also hold true in the setting of quantum graphs\, where the 
 quantum permutation matrix may be replaced by more general non-commutative
  permutation matrices over quantum sets intertwining the respective quantu
 m graph structures.&nbsp\;\n&nbsp\;
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR