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. After a postdoctoral position at the Massachusetts Institute of Technology, supervised by Scott Aaronson, he joined the California Institute of Technology in 2014 and was named Professor of Computing and Mathematical Sciences in 2018. He is director of the Center for the Mathematics of Information (CMI). He holds visiting positions at the Centre for Quantum Technologies in Singapore and the Perimeter Institute in Waterloo. In 2020-2021 he was awarded an FSMP Research Chair in Paris, France. In 2017 he was named a CIFAR Azrieli Global Scholar. In 2019 he received a Presidential Early-Career Award (PECASE). 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.

  • Our result that MIP* =RE was reported on by Quanta magazine, Nature News, Science News, and other outlets. For a personal take, see my blog post. For a more technical introduction, see my co-author’s blog post.
  • Quanta magazine article from June 2019 on our randomness generation paper, with Christiano, Brakerski, Mahadev and Vazirani.
  • article from October 2014 on my paper with Vazirani on device-independent quantum key distribution.
  • MIT news piece from July 2012 on my paper with Ito.

Online talks

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

General-audience talks


  • Three lectures on “Quantum Protocols” at a Winter School on the Mathematics of Quantum Computation organized at the Hebrew University in Jerusalem in December 2019: the first and second lecture on delegated computation with a single server and a partially quantum client (the first lecture focuses on blindness and the second on verifiability), and the third lecture on using entanglement to achieve two-server delegation with a classical client. (See the UCSD lecture notes in my teaching page for related notes.)

  • At QIP’19 in Boulder, Colorado I gave a 3-hour tutorial on the topic of “Verification of Quantum Computation”: see part 1 and part 2. Slides for the tutorial are available in ppsx and (without the animations) pdf.

Technical talks


Graduate students

  • Alexander Poremba
  • Jiaqing Jiang
  • Hsin-Yuan Huang (w./ John Preskill)
  • Spencer Gordon (w./ Leonard Schulman)
  • Jenish Mehta (w./ Leonard Schulman)

Graduated students

Undergraduate students




Workshop organization


  • I am a co-PI on NSF's "[Challenge Institute for Quantum Computation](" (CIQC)
  • AFOSR MURI award "Scalable Certification of Quantum Computing Devices and Networks", 2018-2021.
  • CIFAR Azrieli Global Scholar, 2017-2019.
  • I am a PI of the Institute for Quantum Information and Matter (IQIM), a National Science Foundation Physics Frontiers Center (2018-2023) at Caltech directed by John Preskill.
  • NSF CAREER "Interactions with Untrusted Quantum Devices", 02/2016-01/2021.
  • Air Force Young Investigator Award "Towards a Secure Quantum Network", 2016-2019.
  • Okawa Foundation Research Grant 2015-2016.