| Fully device independent quantum key distribution U Vazirani, T Vidick Communications of the ACM 62 (4), 133-133, 2019 | 716 | 2019 |
| MIP*= RE Z Ji, A Natarajan, T Vidick, J Wright, H Yuen arXiv preprint arXiv:2001.04383, 2020 | 368 | 2020 |
| Simple and tight device-independent security proofs R Arnon-Friedman, R Renner, T Vidick SIAM Journal on Computing 48 (1), 181-225, 2019 | 357* | 2019 |
| Sieve algorithms for the shortest vector problem are practical PQ Nguyen, T Vidick Journal of Mathematical Cryptology 2 (2), 181-207, 2008 | 315 | 2008 |
| A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians Z Landau, U Vazirani, T Vidick Nature Physics 11 (7), 566-569, 2015 | 203 | 2015 |
| A cryptographic test of quantumness and certifiable randomness from a single quantum device Z Brakerski, P Christiano, U Mahadev, U Vazirani, T Vidick Journal of the ACM (JACM) 68 (5), 1-47, 2021 | 194 | 2021 |
| Trevisan's extractor in the presence of quantum side information A De, C Portmann, T Vidick, R Renner Arxiv preprint arXiv:0912.5514, 2009 | 187 | 2009 |
| Guest column: the quantum PCP conjecture D Aharonov, I Arad, T Vidick Acm sigact news 44 (2), 47-79, 2013 | 180 | 2013 |
| Entangled games are hard to approximate J Kempe, H Kobayashi, K Matsumoto, B Toner, T Vidick SIAM Journal on Computing 40 (3), 848-877, 2011 | 134 | 2011 |
| Good quantum LDPC codes with linear time decoders I Dinur, MH Hsieh, TC Lin, T Vidick Proceedings of the 55th annual ACM symposium on theory of computing, 905-918, 2023 | 106 | 2023 |
| Certifiable quantum dice: or, true random number generation secure against quantum adversaries U Vazirani, T Vidick Proceedings of the 44th symposium on Theory of Computing, 61-76, 2012 | 105 | 2012 |
| Rigorous RG algorithms and area laws for low energy eigenstates in 1D I Arad, Z Landau, U Vazirani, T Vidick Communications in Mathematical Physics 356, 65-105, 2017 | 102 | 2017 |
| Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources A Coladangelo, AB Grilo, S Jeffery, T Vidick Annual international conference on the theory and applications of …, 2019 | 93 | 2019 |
| A multi-prover interactive proof for NEXP sound against entangled provers T Ito, T Vidick 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 243-252, 2012 | 89 | 2012 |
| More nonlocality with less entanglement T Vidick, S Wehner Physical Review A 83 (5), 052310, 2011 | 88 | 2011 |
| Computationally-secure and composable remote state preparation A Gheorghiu, T Vidick 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 81 | 2019 |
| Quantum proofs T Vidick, J Watrous Foundations and Trends® in Theoretical Computer Science 11 (1-2), 1-215, 2016 | 81 | 2016 |
| A quantum linearity test for robustly verifying entanglement A Natarajan, T Vidick Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 79 | 2017 |
| Quantum XOR games O Regev, T Vidick ACM Transactions on Computation Theory (ToCT) 7 (4), 1-43, 2015 | 75 | 2015 |
| Parallel repetition of entangled games J Kempe, T Vidick Arxiv preprint arXiv:1012.4728, 2010 | 71 | 2010 |
Anand NatarajanAssistant Professor, EECS, MIT在 mit.edu 的电子邮件经过验证