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

  • Computationally-secure and composable remote state preparation
    Alexandru Gheorghiu, Thomas Vidick
    Submitted, arXiv:1904.06320.
  • Classical zero-knowledge arguments for quantum computations
    Thomas Vidick, Tina Zhang
    Presented at TQC'19. Manuscript, arXiv:1902.05217.
  • Bounds on Dimension Reduction in the Nuclear Norm
    Oded Regev, Thomas Vidick
    GAFA seminar notes, arXiv:1901.09480.
  • Trading locality for time: certifiable randomness from low-depth circuits
    Matthew Coudron, Jalex Stark, Thomas Vidick
    Presented at QIP'19. Manuscript, arXiv:1810.04233.
  • Quantum proof systems for iterated exponential time, and beyond
    Joseph Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen
    Presented at QIP'19. Proceedings of STOC'19, arXiv:1805.12166.
  • Certifiable Randomness from a Single Quantum Device
    Zvika Brakerski, Paul Christiano, Urmila Mahadev, Umesh Vazirani, Thomas Vidick
    Proceedings of FOCS'18. Presented at QIP'19, arXiv:1804.00640.
  • A three-player coherent state embezzlement game
    Zhengfeng Ji, Debbie Leung, Thomas Vidick
    Manuscript, arXiv:1802.04926.
  • Low-degree testing for quantum states
    Anand Natarajan, Thomas Vidick
    Presented at QIP'18. Proceedings of FOCS'18, arXiv:1801.03821.
  • Entanglement in non-local games and the hyperlinear profile of groups
    William Slofstra, Thomas Vidick
    Annales Henri Poincare (2018) (journal link). Presented at QIP'18, arXiv:1711.10676.
  • Practical device-independent quantum cryptography via entropy accumulation
    Rotem Arnon-Friedman, Frederic Dupuis, Omar Fawzi, Renato Renner, Thomas Vidick
    Nature Communications 9:459(2018). Journal version of "Simple and tight device-independent security proofs", arXiv:1607.01797.

... 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

  • 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.
  • Survey on quantum program checking and quantum multiprover interactive proof systems. Invited talk at HALG 2019. Copenhagen, 2019-06-15.
  • Computationally-secure and composable remote state preparation. Bay area crypto day. Stanford, 2019-05-10.
  • Classical Zero Knowledge Arguments for Quantum Computations. Blockchains, Micropayments and Zero Knowledge (ZK Day 2019). Simons Institute, Berkeley, 2019-04-13. (video)

... see all talks