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

  • A monogamy-of-entanglement game for subspace coset states
    Eric Culf, Thomas Vidick
    Technical report, arXiv:2107.13324.
  • Almost synchronous quantum correlations
    Thomas Vidick
    Submitted, arXiv:2103.02468.
  • Quantum soundness of the classical low individual degree test
    Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen
    Proceedings of FOCS'21, arXiv:2009.12982.
  • 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
    Proceedings of Eurocrypt'21, arXiv:2005.01691.
  • Self-testing of a single quantum device under computational assumptions
    Tony Metger, Thomas Vidick
    Proceedings of ITCS'21. Journal version in Quantum, 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.

... see all publications

News

  • Caltech is a proud organizer of QIP 2022.
  • 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.

Teaching

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

Fall 2021: CS152, Introduction to cryptography.

Fall 2020: Cours FSMP, Interactive Proofs with Quantum Devices.

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

Fall 2019: CS/Ph 120, Quantum cryptography.

... see previous teaching

Recent talks

  • MIP* = RE and Tsirelson's problem. ICMP (invited Plenary). Geneva, 2021-08-04.
  • Classical proofs of Quantum Knowledge. Dagstuhl seminar on quantum complexity. Dagstuhl, 2021-06-29.
  • Cryptographic tests of quantumness. Seminaire du DI. Ecole Normale Superieure (online), 2021-03-17. (video)
  • Testing quantum systems in the high-complexity regime. Max Planck distinguished speaker series on quantum computing. Max Planck Institute, Germany (online), 2021-02-11.
  • Connes embedding problem, Tsirelson's problem, and MIP* = RE. Math Colloquium. Caltech (online), 2021-02-02.
  • MIP* = RE and Tsirelson's problem. QIP 2021. Munich, Germany (online), 2021-02-01. (video)

... see all talks