Professor of Computing and Mathematical Sciences
California Institute of Technology

email: vidick [at] caltech [dot] edu
office: Annenberg 207
phone: (626) 395-8684
assistant: Bonnie Leung

Curriculum Vitae

I am CS option rep
Option manager: Carmen Nemer-Sirois
Office Hours: Tuesdays 2:30-3:30pm, 207 ANB

Recent publications

  • Simpler Proofs of Quantumness
    Zvika Brakerski, Venkata Koppula, Umesh Vazirani, Thomas Vidick
    Proceedings of TQC'20, arXiv:2005.04826.
  • Classical proofs of quantum knowledge
    Thomas Vidick, Tina Zhang
    Submitted, arXiv:2005.01691.
  • Self-testing of a single quantum device under computational assumptions
    Tony Metger, Thomas Vidick
    Submitted, arXiv:2001.09161.
  • MIP*=RE
    Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen
    Manuscript. See the related introductory article, blog post, and recorded overview talk, arXiv:2001.04383.
  • Non-interactive zero-knowledge arguments for QMA, with preprocessing
    Andrea Coladangelo, Thomas Vidick, Tina Zhang
    Crypto'20, arXiv:1911.07546.
  • From Operator Algebras to Complexity Theory and Back
    Thomas Vidick
    Notices of the AMS, November 2019.
  • Verifying quantum computations at scale A cryptographic leash on quantum devices
    Thomas Vidick
    Bull. Amer. Math. Soc., 2020.
  • Computationally-secure and composable remote state preparation
    Alexandru Gheorghiu, Thomas Vidick
    Presented at QCRYPT'19. Proceedings of FOCS'19, arXiv:1904.06320.
  • Classical zero-knowledge arguments for quantum computations
    Thomas Vidick, Tina Zhang
    Presented at TQC'19. Published inQuantum, arXiv:1902.05217.
  • Bounds on Dimension Reduction in the Nuclear Norm
    Oded Regev, Thomas Vidick
    GAFA seminar notes, arXiv:1901.09480.

... see all publications


  • In Spring 2020 I am co-organizing a semester on advances in quantum computing, entitled The Quantum Wave, at the Simons Institute in Berkeley.
  • I organize the Mathematics of Information (CMI) seminar.
  • I help organize TCS+, an online seminar series in theoretical computer science, accessible to the widest possible audience, and ensuring a carbon-free dissemination of ideas across the globe. See our website for more information.


Winter 2020: CS/CMS 139, Design & Analysis of Algorithms.

Fall 2019: CS/Ph 120, Quantum cryptography.

Winter 2019: CS/CMS 139, Design & Analysis of Algorithms.

Fall 2018: CS152, Introduction to cryptography.

... see previous teaching

Recent talks

  • Tsirelson's problem in quantum information and connections with operator algebras and quantum complexity theory. Math Colloquium. Tel-Aviv University (online), 2020-05-04.
  • The complexity-theoretic approach to Connes’ Embedding Problem. Functional Analysis Seminar. UCLA, 2020-01-08.
  • Quantum Protocols. Three lectures given at the 4th Winter School in Computer Science and Engineering. Hebrew Univerity, Jerusalem, 2019-12-15.
  • Secure Computation with Quantum Devices: From Device-Independent Cryptography to Verificationof Quantum Computers. Invited talk at US-Israel Blavatnik Scientific Forum on computer science and its impact on our future. Jerusalem, 2019-09-17.
  • A complexity-theoretic approach to disproving Connes' Embedding Problem. Workshop on The Many Faceted Connes Embedding Problem. Banff, 2019-07-15.
  • Topics in quantum complexity and cryptography. Invited survey at It for Qubit summer school. Kyoto, 2019-06-18.

... see all talks