Ji, Zhengfeng; Natarajan, Anand et al.
(2022)
Quantum soundness of testing tensor codes
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);
arXiv;
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 7-10 February 2022
, Denver, CO
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;
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;
Brakerski, Zvika; Koppula, Venkata et al.
(2020)
Simpler Proofs of Quantumness
15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020);
arXiv;
Series.Leibniz International Proceedings in Informatics;
15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), 9-12 June 2020
, Riga, Latvia
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;
Ostrev, Dimiter; Vidick, Thomas
(2018)
Entanglement of approximate quantum strategies in XOR games
Quantum Information and Computation;
Vol.
18;
No.
7-8;
Natarajan, Anand; Vidick, Thomas
(2018)
Two-Player Entangled Games are NP-Hard
33rd Computational Complexity Conference (CCC 2018);
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany;
Series.Leibniz International Proceedings in Informatics;
33rd Computational Complexity Conference (CCC 2018), 22-24 June 2018
, San Diego, CA
Arnon-Friedman, Rotem; Dupuis, Frédéric et al.
(2018)
Practical device-independent quantum cryptography via entropy accumulation
Nature Communications;
Vol.
9;
Arad, Itai; Landau, Zeph et al.
(2017)
Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D
8th Innovations in Theoretical Computer Science Conference (ITCS 2017);
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany;
Series.Leibniz International Proceedings in Informatics;
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 9-11 January 2017
, Berkeley, CA
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;
Bavarian, Mohammad; Vidick, Thomas et al.
(2017)
Hardness amplification for entangled games via anchoring
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017;
49th Annual ACM SIGACT Symposium on Theory of Computing, June 19-23, 2017
, Montreal, QC
Chao, Rui; Reichardt, Ben W. et al.
(2017)
Overlapping Qubits
8th Innovations in Theoretical Computer Science Conference (ITCS 2017);
8th Innovations in Theoretical Computer Science Conference (ITCS 2017);
Series.Leibniz International Proceedings in Informatics;
No.
67;
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 9-11 January 2017
, Berkeley, CA
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;
Vidick, Thomas; Watrous, John
(2016)
Quantum Proofs
Foundations and Trends in Theoretical Computer Science;
Foundations and Trends in Theoretical Computer Science;
Vol.
11;
No.
1-2;
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;
Coudron, Matthew; Vidick, Thomas
(2015)
Interactive Proofs with Approximately Commuting Provers
Automata, Languages, and Programming;
Series.Lecture Notes in Computer Science;
No.
9134;
Automata, Languages, and Programming: 42nd International Colloquium (ICALP 2015), 6-10 July 2015
, Kyoto, Japan
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;
Vazirani, Umesh; Vidick, Thomas
(2014)
Robust device independent quantum key distribution
Proceedings of the 5th conference on Innovations in theoretical computer science ;
5th conference on Innovations in theoretical computer science (ITCS '14), January 12–14, 2014
, Princeton, NJ
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;
Regev, Oded; Vidick, Thomas
(2013)
Quantum XOR Games
28th Annual IEEE Conference on Computational Complexity (CCC);
28th Annual IEEE Conference on Computational Complexity (CCC), 5-7 June 2013
, Stanford, CA
Briët, Jop; Buhrman, Harry et al.
(2013)
Multipartite entanglement in XOR games
Quantum Information and Computation;
Vol.
13;
No.
3-4;
Coudron, Matthew; Vidick, Thomas et al.
(2013)
Robust Randomness Amplifiers: Upper and Lower Bounds
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;
Series.Lecture Notes in Computer Science;
No.
8096;
16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, 21-23 August 2013
, Berkeley, CA
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;
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;
Kempe, Julia; Kobayashi, Hirotada et al.
(2011)
Entangled Games Are Hard to Approximate
SIAM Journal on Computing;
Vol.
40;
No.
3;
Kempe, Julia; Vidick, Thomas
(2011)
Parallel Repetition of Entangled Games
Proceedings of the 43rd annual ACM symposium on Theory of computing ;
43rd annual ACM symposium on Theory of computing (STOC '11), June 6–8, 2011
, San Jose, CA
Vidick, Thomas; Wehner, Stephanie
(2011)
More nonlocality with less entanglement
Physical Review A;
Vol.
83;
No.
5;
Kempe, J.; Vidick, T.
(2010)
Quantum Algorithms
Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments;
Lecture Notes in Physics;
Series.Lecture Notes in Physics;
No.
808;
Brody, Joshua; Chakrabarti, Amit et al.
(2010)
Better Gap-Hamming Lower Bounds via Better Round Elimination
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;
arXiv;
Series.Lecture Notes in Computer Science;
No.
6302;
13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, 1-3 September 2010
, Barcelona, Spain
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;
Kempe, Julia; Kobayashi, Hirotada et al.
(2008)
Entangled games are hard to approximate
49th Annual Symposium on Foundations-of-Computer-Science (FOCS);
49th Annual Symposium on Foundations-of-Computer-Science (FOCS), 25-28 October 2008
, Philadelphia, PA
Nguyen, Phong Q.; Vidick, Thomas
(2008)
Sieve algorithms for the shortest vector problem are practical
Journal of Mathematical Cryptology;
Vol.
2;
No.
2;