Abstract: I'll discuss the notion of pseudorandom quantum states, which is a pseudorandomness notion in the quantum world. Pseudorandom states (PRS) are states that are efficiently computable and are computationally indistinguishable from the Haar distribution. PRS has applications to many areas including quantum gravity theory, quantum machine learning, quantum complexity theory and finally, quantum cryptography. I'll discuss some constructions and cryptographic applications of PRS. 

Bio: Prabhanjan Ananth is an assistant professor in the department of computer science at UCSB. He did his Ph.D. at UCLA and subsequently, was a postdoc at MIT. His research interests lie in the intersection of quantum information and cryptography.