Thomas Vidick



  • CIFAR Azrieli Global Scholar 2017-2019
  • 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

Arad, I., Landau, Z., Vazirani, U., & Vidick, T. (2017). Rigorous RG
algorithms and area laws for low energy eigenstates in 1D.
Communications in Mathematical Physics, 356(1), 65-105.

Arnon-Friedman, R., Dupuis, F., Fawzi, O., Renner, R., & Vidick, T.
(2018). Practical device-independent quantum cryptography via entropy
accumulation. Nature communications, 9(1), 459.

Natarajan, A., & Vidick, T. (2018, October). Low-degree testing for
quantum states, and a quantum entangled games PCP for QMA
. In 2018 IEEE
59th Annual Symposium on Foundations of Computer Science (FOCS) (pp.
731-742). IEEE.

Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U., & Vidick, T.
(2018, October). A cryptographic test of quantumness and certifiable
randomness from a single quantum device
. In 2018 IEEE 59th Annual
Symposium on Foundations of Computer Science (FOCS) (pp. 320-331). IEEE.

Fitzsimons, J., Ji, Z., Vidick, T., & Yuen, H. (2019, June). Quantum
proof systems for iterated exponential time, and beyond
. In Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp.
473-480). ACM.