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; Zhang, Tina
(2021)
Classical Proofs of Quantum Knowledge
Advances in Cryptology – EUROCRYPT 2021;
Lecture Notes in Computer Science;
Vol.
12697;
Series.Lecture Notes in Computer Science;
No.
12697;
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
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
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
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
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;
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
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
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
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
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
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.
(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