University of Cambridge > Talks.cam > CQIF Seminar > Quantum Pseudoentanglement

Quantum Pseudoentanglement

Add to your list(s) Download to your calendar using vCal

  • UserSoumik Ghosh, University of Chicago
  • ClockWednesday 07 June 2023, 14:00-15:15
  • HouseMR14.

If you have a question about this talk, please contact Sergii Strelchuk.

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 construction relies on the notion of quantum pseudorandom states—first defined by Ji, Liu and Song—which are efficiently constructible states indistinguishable from (maximally entangled) Haar-random states. Specifically, we give a construction of pseudoentangled states with entanglement entropy arbitrarily close to logn across every cut, a tight bound providing an exponential separation between computational vs information theoretic quantum pseudorandomness. We discuss applications of this result to Matrix Product State testing, entanglement distillation, and the complexity of the AdS/CFT correspondence.

This talk is part of the CQIF Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity