Thomas Vidick’s research is situated at the interface of theoretical computer science, quantum information and cryptography. He is interested in applying techniques from computer science, such as complexity theory, to study problems in quantum computing. He has investigated the role of entanglement in multi-prover interactive proof systems and obtained the first substantial computational hardness results on the power of entangled provers. Entanglement also plays a major role in quantum cryptography, and he has made important contributions to the field of device-independent cryptography. He is also interested in using quantum information theory to shed new light on fundamental techniques in theoretical computer science such as semidefinite programming and approximation algorithms.

Vidick received a B.A. in pure mathematics from Ecole Normale Superieure in Paris, a Masters in Computer Science from Universite Paris 7 and a Ph.D. from UC Berkeley. His Ph.D. thesis was awarded the Bernard Friedman memorial prize in applied mathematics. Before joining Caltech he was a postdoctoral associate at the Massachusetts Institute of Technology. He has also held visiting positions at the Centre for Quantum Technologies in Singapore, the Perimeter Institute in Waterloo, and the Simons Institute for the Theory of Computing in Berkeley. His paper “A multi-prover interactive proof for NEXP sound against entangled provers”, with Tsuyoshi Ito, was co-awarded the best paper award at FOCS’12.

Online talks

You can see me talk about my research in the following recorded talks.

General-audience talks

Technical talks


Graduate students

Undergraduate students

  • Jalex Stark (2017-2018, now at Berkeley)
  • Chinmay Nirkhe (2016-2017, now at Berkeley)
  • Shannon Wang (Summer 2015, now at UCSD)