World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
5539
World Ranking
10798
National Ranking
4496

Overview

Thomas Vidick is affiliated with the California Institute of Technology in the United States. Their research primarily spans the field of Computer Science, with a focus on several specialized subfields.

Vidick's main areas of study include:

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Atomic and Molecular Physics, and Optics
  • Statistics and Probability
  • Information Systems

The scientist's work extensively covers topics related to quantum computing and cryptography, including:

  • Quantum Computing Algorithms and Architecture
  • Quantum Information and Cryptography
  • Quantum Mechanics and Applications
  • Cryptography and Data Security
  • Complexity and Algorithms in Graphs
  • Computability, Logic, AI Algorithms
  • Benford's Law and Fraud Detection

Thomas Vidick has contributed to numerous publications in various venues. Their frequent publication venues include:

  • arXiv (Cornell University)
  • SIAM Journal on Computing
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Communications of the ACM
  • Quantum

Recent papers by Vidick include:

  • MIP* = RE, 2021, Communications of the ACM
  • MIP*=RE, 2020, arXiv (Cornell University)
  • A monogamy-of-entanglement game for subspace coset states, 2022, Quantum
  • Interactive cryptographic proofs of quantumness using mid-circuit measurements, 2023, Nature Physics
  • Simpler Proofs of Quantumness, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Their frequent collaborators include:

  • Henry Yuen
  • Alexandru Gheorghiu
  • Zhengfeng Ji
  • John C. Wright
  • Umesh Vazirani

Thomas Vidick has also authored a book titled Introduction to Quantum Cryptography, published by Cambridge University Press in 2023.

Best Publications

  • Fully device independent quantum key distribution

    Umesh Vazirani;Thomas Vidick

  • Sieve Algorithms for the Shortest Vector Problem are Practical

    Phong Q. Nguyen;Thomas Vidick

  • Practical device-independent quantum cryptography via entropy accumulation.

    Rotem Arnon-Friedman;Frédéric Dupont Dupuis;Omar Fawzi;Renato Renner

  • MIP* = RE

    Zhengfeng Ji;Anand Natarajan;Thomas Vidick;John Wright

  • A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians

    Zeph Landau;Umesh Vazirani;Thomas Vidick

  • Trevisan's Extractor in the Presence of Quantum Side Information

    Anindya De;Christopher Portmann;Christopher Portmann;Thomas Vidick;Renato Renner;Renato Renner

  • Guest column: the quantum PCP conjecture

    Dorit Aharonov;Itai Arad;Thomas Vidick

  • Certifiable quantum dice: or, true random number generation secure against quantum adversaries

    Umesh Vazirani;Thomas Vidick

  • Simple and tight device-independent security proofs

    Rotem Arnon-Friedman;Renato Renner;Thomas Vidick

  • Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D.

    Itai Arad;Zeph Landau;Umesh V. Vazirani;Thomas Vidick

  • Entangled Games Are Hard to Approximate

    Julia Kempe;Hirotada Kobayashi;Keiji Matsumoto;Ben Toner

  • A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device

    Zvika Brakerski;Paul Christiano;Urmila Mahadev;Umesh Vazirani

  • A multi-prover interactive proof for NEXP sound against entangled provers.

    Tsuyoshi Ito;Thomas Vidick

  • Quantum XOR Games

    Oded Regev;Thomas Vidick

  • Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources.

    Andrea Coladangelo;Alex Bredariol Grilo;Stacey Jeffery;Thomas Vidick

  • A quantum linearity test for robustly verifying entanglement

    Anand Natarajan;Thomas Vidick

  • Parallel repetition of entangled games

    Julia Kempe;Thomas Vidick

  • Certifiable quantum dice

    Umesh Vazirani;Thomas Vidick

  • Computationally-Secure and Composable Remote State Preparation

    Alexandru Gheorghiu;Thomas Vidick

  • A parallel repetition theorem for entangled projection games

    Irit Dinur;David Steurer;Thomas Vidick

  • Three-Player Entangled XOR Games are NP-Hard to Approximate

    Thomas Vidick

  • Trevisan's extractor in the presence of quantum side information (計算機科学とアルゴリズムの数理的基礎とその応用--RIMS研究集会報告集)

    Anindya De;Christopher Portmann;Thomas Vidick;Renato Renner

Frequent Co-Authors

Umesh Vazirani
Umesh Vazirani University of California, Berkeley
Renato Renner
Renato Renner ETH Zurich
Oded Regev
Oded Regev Courant Institute of Mathematical Sciences
Julia Kempe
Julia Kempe New York University
Zvika Brakerski
Zvika Brakerski Weizmann Institute of Science
Harry Buhrman
Harry Buhrman University of Amsterdam
Assaf Naor
Assaf Naor Princeton University
David Steurer
David Steurer ETH Zurich
Stephanie Wehner
Stephanie Wehner Delft University of Technology
Irit Dinur
Irit Dinur Weizmann Institute of Science

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees in Computer Science opens a world of flexible and affordable learning options. Many students are drawn to cheap online colleges to minimize debt while gaining in-demand tech skills. These institutions help lower the financial barriers to top-tier education without sacrificing quality.

Some prospective students worry about academic requirements, but options exist. There are online graduate programs that accept 2.0 gpa, making advanced degrees more accessible, even with less-than-perfect undergraduate records.

Career possibilities extend beyond software development. For example, computer science expertise can enhance roles in emerging fields such as environmental science. Graduates can explore a variety of jobs for environmental science majors, where technical skills are increasingly valuable for data analysis, modeling, and sustainability solutions.

For those looking to quickly enter the workforce, there are fastest computer science degree programs designed to compress the timeline between education and employment. These accelerated paths are perfect for ambitious students eager to launch or pivot their careers.

Best Scientists Citing Thomas Vidick

Trending Scientists