| 2025 | TCC | Quantum Interactive Oracle Proofs. | Baocheng Sun, Thomas Vidick |
| 2024 | FOCS | Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes. | Irit Dinur, Ting-Chun Lin, Thomas Vidick |
| 2023 | CRYPTO | Simple Tests of Quantumness Also Certify Qubits. | Zvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick |
| 2023 | ICALP | Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk). | Thomas Vidick |
| 2023 | STOC | Good Quantum LDPC Codes with Linear Time Decoders. | Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick |
| 2022 | CRYPTO | Succinct Classical Verification of Quantum Computation. | James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang |
| 2021 | EuroCrypt | Classical Proofs of Quantum Knowledge. | Thomas Vidick, Tina Zhang |
| 2021 | FOCS | Quantum soundness of testing tensor codes. | Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen |
| 2020 | CRYPTO | Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing. | Andrea Coladangelo, Thomas Vidick, Tina Zhang |
| 2019 | EuroCrypt | A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries. | Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick |
| 2019 | EuroCrypt | Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources. | Andrea Coladangelo, Alex Bredariol Grilo, Stacey Jeffery, Thomas Vidick |
| 2019 | FOCS | Computationally-Secure and Composable Remote State Preparation. | Alexandru Gheorghiu, Thomas Vidick |
| 2019 | STOC | Quantum proof systems for iterated exponential time, and beyond. | Joseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen |
| 2018 | FOCS | A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. | Zvika Brakerski, Paul F. Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick |
| 2018 | FOCS | Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA. | Anand Natarajan, Thomas Vidick |
| 2017 | STOC | Hardness amplification for entangled games via anchoring. | Mohammad Bavarian, Thomas Vidick, Henry Yuen |
| 2017 | STOC | A quantum linearity test for robustly verifying entanglement. | Anand Natarajan, Thomas Vidick |
| 2015 | ICALP | Interactive Proofs with Approximately Commuting Provers. | Matthew Coudron, Thomas Vidick |
| 2014 | ICALP | Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability. | Laura Mancinska, Thomas Vidick |
| 2013 | STOC | Efficient rounding for the noncommutative grothendieck inequality. | Assaf Naor, Oded Regev, Thomas Vidick |
| 2012 | FOCS | A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers. | Tsuyoshi Ito, Thomas Vidick |
| 2012 | STOC | Certifiable quantum dice: or, true random number generation secure against quantum adversaries. | Umesh V. Vazirani, Thomas Vidick |
| 2011 | STOC | Parallel repetition of entangled games. | Julia Kempe, Thomas Vidick |
| 2010 | STOC | Near-optimal extractors against quantum storage. | Anindya De, Thomas Vidick |
| 2008 | FOCS | Entangled Games are Hard to Approximate. | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick |