Vidick, Thomas (2022) Almost synchronous quantum correlations Journal of Mathematical Physics; Vol. 63; No. 2;

Ji, Zhengfeng; Natarajan, Anand et al. (2021) MIP* = RE Communications of the ACM; Vol. 64; No. 11;

Metger, Tony; Vidick, Thomas (2021) Self-testing of a single quantum device under computational assumptions Quantum; Vol. 5;

Brakerski, Zvika; Christiano, Paul et al. (2021) A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device Journal of the ACM; Vol. 68; No. 5;

Coudron, Matthew; Stark, Jalex et al. (2021) Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits Communications in Mathematical Physics; Vol. 382; No. 1;

Ji, Zhengfeng; Leung, Debbie et al. (2020) A three-player coherent state embezzlement game Quantum; Vol. 4;

Vidick, Thomas; Zhang, Tina (2020) Classical zero-knowledge arguments for quantum computations Quantum; Vol. 4;

Vidick, Thomas (2020) Verifying quantum computations at scale: A cryptographic leash on quantum devices Bulletin of the American Mathematical Society; Vol. 57; No. 1;

Vidick, Thomas (2019) From Operator Algebras to Complexity Theory and Back Notices of the American Mathematical Society; Vol. 66; No. 10;

Vazirani, Umesh; Vidick, Thomas (2019) Fully device independent quantum key distribution Communications of the ACM; Vol. 62; No. 4;

Arnon-Friedman, Rotem; Renner, Renato et al. (2019) Simple and tight device-independent security proofs SIAM Journal on Computing; Vol. 48; No. 1;

Slofstra, William; Vidick, Thomas (2018) Entanglement in Non-local Games and the Hyperlinear Profile of Groups Annales Henri Poincaré; Vol. 19; No. 10;

Chao, Rui; Reichardt, Ben W. et al. (2018) Test for a large amount of entanglement, using few measurements Quantum; Vol. 2;

Ostrev, Dimiter; Vidick, Thomas (2018) Entanglement of approximate quantum strategies in XOR games Quantum Information and Computation; Vol. 18; No. 7-8;

Arnon-Friedman, Rotem; Dupuis, Frédéric et al. (2018) Practical device-independent quantum cryptography via entropy accumulation Nature Communications; Vol. 9;

Roberts, Brenden; Vidick, Thomas et al. (2017) Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians Physical Review B; Vol. 96; No. 21;

Arad, Itai; Landau, Zeph et al. (2017) Rigorous RG algorithms and area laws for low energy eigenstates in 1D Communications in Mathematical Physics; Vol. 356; No. 1;

Gosset, David; Mehta, Jenish C. et al. (2017) QCMA hardness of ground space connectivity for commuting Hamiltonians Quantum; Vol. 1;

Pironio, S.; Scarani, V. et al. (2016) Focus on device independent quantum information New Journal of Physics; Vol. 18; No. 10;

Vidick, Thomas (2016) Three-Player Entangled XOR Games are NP-Hard to Approximate SIAM Journal on Computing; Vol. 45; No. 3;

Anshu, Anurag; Arad, Itai et al. (2016) A simple proof of the detectability lemma and spectral gap amplification Physical Review B; Vol. 93; No. 20;

Arnon-Friedman, Rotem; Renner, Renato et al. (2016) Non-Signaling Parallel Repetition Using de Finetti Reductions IEEE Transactions on Information Theory; Vol. 62; No. 3;

Palazuelos, Carlos; Vidick, Thomas (2016) Survey on nonlocal games and operator space theory Journal of Mathematical Physics; Vol. 57; No. 1;

Mančinska, Laura; Vidick, Thomas (2015) Unbounded entanglement in nonlocal games Quantum Information and Computation; Vol. 15; No. 15-16;

Regev, Oded; Vidick, Thomas (2015) Quantum XOR Games ACM Transactions on Computation Theory; Vol. 7; No. 4;

Landau, Zeph; Vazirani, Umesh et al. (2015) A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians Nature Physics; Vol. 11; No. 7;

Dinur, Irit; Steurer, David et al. (2015) A parallel repetition theorem for entangled projection games Computational Complexity; Vol. 24; No. 2;

Vazirani, Umesh; Vidick, Thomas (2014) Fully Device-Independent Quantum Key Distribution Physical Review Letters; Vol. 113; No. 14;

Naor, Assaf; Regev, Oded et al. (2014) Efficient Rounding for the Noncommutative Grothendieck Inequality Theory of Computing; Vol. 10; No. 1;

Regev, Oded; Vidick, Thomas (2014) Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms Journal of Operator Theory; Vol. 71; No. 2;

Briët, Jop; Vidick, Thomas (2013) Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games Communications in Mathematical Physics; Vol. 321; No. 1;

Aharonov, Dorit; Arad, Itai et al. (2013) Guest Column: The Quantum PCP Conjecture ACM SIGACT News; Vol. 44; No. 2;

Briët, Jop; Buhrman, Harry et al. (2013) Multipartite entanglement in XOR games Quantum Information and Computation; Vol. 13; No. 3-4;

De, Anindya; Portmann, Christopher et al. (2012) Trevisan's Extractor in the Presence of Quantum Side Information SIAM Journal on Computing; Vol. 41; No. 4;

Vazirani, Umesh; Vidick, Thomas (2012) Certifiable quantum dice Philosophical Transactions A: Mathematical, Physical and Engineering Sciences; Vol. 370; No. 1971;

Vidick, Thomas (2012) A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem Chicago Journal of Theoretical Computer Science; Vol. 18; No. 1;

Briët, Jop; Buhrman, Harry et al. (2012) All Schatten spaces endowed with the Schur product are Q-algebras Journal of Functional Analysis; Vol. 262; No. 1;

Vidick, Thomas; Wehner, Stephanie (2011) Does Ignorance of the Whole Imply Ignorance of the Parts? Large Violations of Noncontextuality in Quantum Theory Physical Review Letters; Vol. 107; No. 3;

Kempe, Julia; Kobayashi, Hirotada et al. (2011) Entangled Games Are Hard to Approximate SIAM Journal on Computing; Vol. 40; No. 3;

Vidick, Thomas; Wehner, Stephanie (2011) More nonlocality with less entanglement Physical Review A; Vol. 83; No. 5;

Kempe, Julia; Kobayashi, Hirotada et al. (2009) Using Entanglement in Quantum Multi-Prover Interactive Proofs Computational Complexity; Vol. 18; No. 2;

Ricotta, Guillaume; Vidick, Thomas (2008) Hauteur asymptotique des points de Heegner Canadian Journal of Mathematics; Vol. 60; No. 6;

Nguyen, Phong Q.; Vidick, Thomas (2008) Sieve algorithms for the shortest vector problem are practical Journal of Mathematical Cryptology; Vol. 2; No. 2;