Thomas Vidick



  • Fellow
  • Quantum Information Science


  • California Institute of Technology
Department of Computing and Mathematical Sciences


  • United States


PhD, University of California, Berkeley
Masters, Université Paris
BS, École normale supérieure


Thomas Vidick’s research is 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 Vidick has made important contributions to the field of device-independent cryptography.


Co-winner of the FOCS 2012 Best Paper Award

Bernard Friedman Memorial Prize in Applied Mathematics

Air Force Young Investigator Award

Relevant Publications

Natarajan, A., and T. Vidick. "A quantum linearity test for robustly verifying entanglement." In the Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017: 1003–1015.
Vidick, T., and J. Watrous. Quantum Proofs. Foundations and Trends in Theoretical Computer Science, 11, No. 1–2. Boston: now publishers, 2016.

Landau, Z., U. Vazirani, and T. Vidick. "A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians." Nature Physics 11 (2015).

Vazirani, U., and T. Vidick. "Fully Device-Independent Quantum Key Distribution." Phys. Rev. Lett. 113 (September 2014).

Naor, A., O. Regev, and T. Vidick. "Efficient rounding for the noncommutative Grothendieck inequality." In the Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), New York, 2013: 71–80.

Ito, T., and T. Vidick. "A multi-prover interactive proof for NEXP sound against entangled provers." In the Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS 2012).