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
3882019
Sieve algorithms for the shortest vector problem are practical
PQ Nguyen, T Vidick
Journal of Mathematical Cryptology 2 (2), 181-207, 2008
1882008
Simple and tight device-independent security proofs
R Arnon-Friedman, R Renner, T Vidick
SIAM Journal on Computing 48 (1), 181-225, 2019
135*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
1242009
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
1102015
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
1072011
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
1012011
Guest column: the quantum PCP conjecture
D Aharonov, I Arad, T Vidick
Acm sigact news 44 (2), 47-79, 2013
902013
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
712012
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
642012
More nonlocality with less entanglement
T Vidick, S Wehner
Physical Review A 83 (5), 052310, 2011
632011
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
562017
Parallel repetition of entangled games
J Kempe, T Vidick
Arxiv preprint arXiv:1012.4728, 2010
512010
Using entanglement in quantum multi-prover interactive proofs
J Kempe, H Kobayashi, K Matsumoto, T Vidick
Computational Complexity 18 (2), 273-307, 2009
512009
Three-player entangled XOR games are NP-hard to approximate
T Vidick
SIAM Journal on Computing 45 (3), 1007-1063, 2016
502016
Explicit lower and upper bounds on the entangled value of multiplayer XOR games
J Briet, T Vidick
Arxiv preprint arXiv:1108.5647, 2011
502011
Certifiable quantum dice
U Vazirani, T Vidick
Philosophical Transactions of the Royal Society A: Mathematical, Physical …, 2012
482012
A concentration inequality for the overlap of a vector on a large set
T Vidick
Chicago Journal of Theoretical Computer Science 1, 1-12, 2012
442012
A parallel repetition theorem for entangled projection games
I Dinur, D Steurer, T Vidick
computational complexity 24 (2), 201-254, 2015
422015
Efficient rounding for the noncommutative Grothendieck inequality
A Naor, O Regev, T Vidick
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
402013
The system can't perform the operation now. Try again later.
Articles 1–20