BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Quantum Pseudoentanglement - Soumik Ghosh\, University of Chicago
DTSTART:20230607T130000Z
DTEND:20230607T141500Z
UID:TALK202282@talks.cam.ac.uk
CONTACT:Sergii Strelchuk
DESCRIPTION:Entanglement is a quantum resource\, in some ways analogous to
  randomness in classical computation. Inspired by recent work of Gheorghiu
  and Hoban\, we define the notion of “pseudoentanglement”\, a property
  exhibited by ensembles of efficiently constructible quantum states which 
 are indistinguishable from quantum states with maximal entanglement. Our c
 onstruction relies on the notion of quantum pseudorandom states -- first d
 efined by Ji\, Liu and Song -- which are efficiently constructible states 
 indistinguishable from (maximally entangled) Haar-random states. Specifica
 lly\, we give a construction of pseudoentangled states with entanglement e
 ntropy arbitrarily close to logn across every cut\, a tight bound providin
 g an exponential separation between computational vs information theoretic
  quantum pseudorandomness. We discuss applications of this result to Matri
 x Product State testing\, entanglement distillation\, and the complexity o
 f the AdS/CFT correspondence. 
LOCATION:MR14
END:VEVENT
END:VCALENDAR