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;

Regev, Oded; Vidick, Thomas (2020) Bounds on Dimension Reduction in the Nuclear Norm Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II; Series.Lecture Notes in Mathematics; No. 2266;

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

Gheorghiu, Alexandru; Vidick, Thomas (2019) Computationally-Secure and Composable Remote State Preparation 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS); 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 9-12 November 2019 , Baltimore, MD

Fitzsimons, Joseph; Ji, Zhengfeng et al. (2019) Quantum proof systems for iterated exponential time, and beyond Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC '19); arXiv; 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), 23-26 June 2019 , Phoenix, AZ

Aggarwal, Divesh; Chung, Kai-Min et al. (2019) A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries Advances in Cryptology - EUROCRYPT 2019; arXiv; Series.Lecture Notes in Computer Science; No. 11477; 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 19-23 May 2019 , Darmstadt, Germany

Coladangelo, Andrea; Grilo, Alex B. et al. (2019) Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources Advances in Cryptology - EUROCRYPT 2019; arXiv; Series.Lecture Notes in Computer Science; No. 11478; 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 19-23 May 2019 , Darmstadt, Germany

Brakerski, Zvika; Christiano, Paul et al. (2018) A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS); 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 7-9 October 2018 , Paris, France

Natarajan, Anand; Vidick, Thomas (2018) Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS); 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 7-9 October 2018 , Paris, France

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

Bavarian, Mohammad; Vidick, Thomas et al. (2017) Parallel repetition via fortification: analytic view and the quantum case 8th Innovations in Theoretical Computer Science Conference; Series.Leibniz International Proceedings in Informatics; No. 67; 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 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

Natarajan, Anand; Vidick, Thomas (2017) A quantum linearity test for robustly verifying entanglement Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017; 49th Annual ACM SIGACT Symposium on Theory of Computing, 19-23 June 2017 , Montreal, Canada

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

Fitzsimons, Joseph; Vidick, Thomas (2015) A Multiprover Interactive Proof System for the Local Hamiltonian Problem ITCS'15 Innovations in Theoretical Computer Science; ITCS '15, 2015 Conference on Innovations in Theoretical Computer Science, January 11-13, 2015 , Rehovot, Israel

Dinur, Irit; Steurer, David et al. (2014) A parallel repetition theorem for entangled projection games Proceedings of the Annual IEEE Conference on Computational Complexity; IEEE 29th Conference on Computational Complexity, CCC 2014, June 11-13, 2014 , Vancouver, BC

Landau, Zeph; Vazirani, Umesh et al. (2014) An efficient algorithm for finding the ground state of 1D gapped local hamiltonians 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

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

Mančinska, Laura; Vidick, Thomas (2014) Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability Automata, Languages, and Programming; Lecture Notes in Computer Science; Series.Lecture Notes in Computer Science; No. 8572; 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 9-11 July 2014 , Copenhagen, Denmark

Vidick, Thomas (2013) Three-player entangled XOR games are NP-hard to approximate IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS); IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), 26-29 October 2013 , Berkeley, CA

Naor, Assaf; Regev, Oded et al. (2013) Efficient Rounding for the Noncommutative Grothendieck Inequality Proceedings of the forty-fifth annual ACM symposium on Theory of computing; Forty-fifth annual ACM symposium on Theory of Computing (ToC), June 1-4, 2013 , Palo Alto, CA

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

Molina, Abel; Vidick, Thomas et al. (2013) Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money Theory of Quantum Computation, Communication, and Cryptography; Series.Lecture Notes in Computer Science; No. 7582; 7th Conference on Theory of Quantum Computation (TQC), 17-19 May 2012 , Tokyo, Japan

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

Ito, Tsuyoshi; Vidick, Thomas (2012) A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS); IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), 20-23 October 2013 , New Brunswick, NJ

Vazirani, Umesh; Vidick, Thomas (2012) Certifiable Quantum Dice Or, True Random Number Generation Secure Against Quantum Adversaries STOC'12 Symposium on Theory of Computing Conference; STOC'12 Symposium on Theory of Computing Conference, May 19-22, 2012 , New York, NY

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

De, Anindya; Vidick, Thomas (2010) Near-Optimal Extractors Against Quantum Storage Proceedings of the 42nd ACM symposium on Theory of computing; 42nd ACM symposium on Theory of computing (STOC '10), June 5–8, 2010 , Cambridge, MA

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

Kempe, Julia; Kobayashi, Hirotada et al. (2008) Using Entanglement in Quantum Multi-Prover Interactive Proofs 23rd Annual IEEE Conference on Computational Complexity; 23rd Annual IEEE Conference on Computational Complexity, June 23-26, 2008 , College Park, MD