11 views

Skip to first unread message

Apr 9, 2021, 4:58:53 PM4/9/21

to usc-theo...@googlegroups.com, usc-t...@googlegroups.com

USC CS Theory Lunch:

A tale of Turing Machines, Quantum Entangled Particles and Operator Algebras

A tale of Turing Machines, Quantum Entangled Particles and Operator Algebras

Speaker: Henry Yuen (Columbia University)

In a recent result known as "MIP* = RE," ideas from three disparate fields of study — computational complexity theory, quantum information, and operator algebras — have come together to simultaneously resolve long-standing open problems in each field, including a 45-year old mystery in mathematics known as Connes’ Embedding Problem. In this talk, I will describe the evolution and convergence of ideas behind MIP* = RE: it starts with three landmark discoveries from the 1930s (Turing’s notion of a universal computing machine, the phenomenon of quantum entanglement, and von Neumann’s theory of operators), and ends with some of the most cutting-edge developments from theoretical computer science and quantum computing.

This talk is aimed at a general scientific audience, and will not assume any specialized background in complexity theory, quantum physics, or operator algebras.

Bio:

Henry Yuen is an assistant professor of Computer Science at Columbia University. He received his PhD from MIT in 2016, and received his B.A. in Mathematics (minor in Computer Science) from the University of Southern California, where he has fond memories of the CS Theory Lunch. His research focuses on the intersection of complexity theory, quantum computing, and cryptography.

Reply all

Reply to author

Forward

0 new messages

Search

Clear search

Close search

Google apps

Main menu