Follow
Thomas Vidick
Thomas Vidick
Professor, CMS, Caltech
Verified email at caltech.edu - Homepage
Title
Cited by
Cited by
Year
Fully device independent quantum key distribution
U Vazirani, T Vidick
Communications of the ACM 62 (4), 133-133, 2019
5382019
Sieve algorithms for the shortest vector problem are practical
PQ Nguyen, T Vidick
Journal of Mathematical Cryptology 2 (2), 181-207, 2008
2382008
Simple and tight device-independent security proofs
R Arnon-Friedman, R Renner, T Vidick
SIAM Journal on Computing 48 (1), 181-225, 2019
222*2019
Trevisan's extractor in the presence of quantum side information
A De, C Portmann, T Vidick, R Renner
Arxiv preprint arXiv:0912.5514, 2009
1512009
MIP*= RE
Z Ji, A Natarajan, T Vidick, J Wright, H Yuen
arXiv preprint arXiv:2001.04383, 2020
1502020
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
1442015
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
U Vazirani, T Vidick
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
1342012
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
1342012
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
1232011
Guest column: the quantum PCP conjecture
D Aharonov, I Arad, T Vidick
Acm sigact news 44 (2), 47-79, 2013
1202013
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
1172011
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
922021
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 (1), 65-105, 2017
812017
More nonlocality with less entanglement
T Vidick, S Wehner
Physical Review A 83 (5), 052310, 2011
792011
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
732012
Parallel repetition of entangled games
J Kempe, T Vidick
Arxiv preprint arXiv:1012.4728, 2010
662010
Explicit lower and upper bounds on the entangled value of multiplayer XOR games
J Briet, T Vidick
Arxiv preprint arXiv:1108.5647, 2011
652011
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
622019
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
562017
Three-player entangled XOR games are NP-hard to approximate
T Vidick
SIAM Journal on Computing 45 (3), 1007-1063, 2016
562016
The system can't perform the operation now. Try again later.
Articles 1–20