Culf, Eric; Vidick, Thomas et al. (2022) Group coset monogamy games and an application to device-independent continuous-variable QKD arXiv;
Lewis, Laura; Zhu, Daiwei et al. (2022) Experimental Implementation of an Efficient Test of Quantumness arXiv;
Culf, Eric; Vidick, Thomas (2022) A monogamy-of-entanglement game for subspace coset states Quantum; Vol. 6;
Bartusek, James; Kalai, Yael Tauman et al. (2022) Succinct Classical Verification of Quantum Computation arXiv;
Dinur, Irit; Hsieh, Min-Hsiu et al. (2022) Good Quantum LDPC Codes with Linear Time Decoders arXiv;
Mahadev, Urmila; Vazirani, Umesh et al. (2022) Efficient Certifiable Randomness from a Single Quantum Device arXiv;
Bavarian, Mohammad; Vidick, Thomas et al. (2022) Anchored Parallel Repetition for Nonlocal Games SIAM Journal on Computing; Vol. 51; No. 2;
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;
Zhu, Daiwei; Kahanamoku-Meyer, Gregory D. et al. (2021) Interactive Protocols for Classically-Verifiable Quantum Advantage arXiv;
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;
Culf, Eric; Vidick, Thomas (2021) A monogamy-of-entanglement game for subspace coset states arXiv;
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;
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;
Ji, Zhengfeng; Natarajan, Anand et al. (2020) Quantum soundness of the classical low individual degree test arXiv;
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
Vidick, Thomas; Zhang, Tina (2020) Classical zero-knowledge arguments for quantum computations Quantum; Vol. 4;
Vidick, Thomas; Zhang, Tina (2020) Classical proofs of quantum knowledge arXiv;
Vidick, Thomas (2020) Verifying quantum computations at scale: A cryptographic leash on quantum devices Bulletin of the American Mathematical Society; Vol. 57; No. 1;
Coladangelo, Andrea; Vidick, Thomas et al. (2019) Non-interactive zero-knowledge arguments for QMA, with preprocessing arXiv;
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
Vidick, Thomas (2019) From Operator Algebras to Complexity Theory and Back Notices of the American Mathematical Society; Vol. 66; No. 10;
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
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;
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
Slofstra, William; Vidick, Thomas (2018) Entanglement in Non-local Games and the Hyperlinear Profile of Groups Annales Henri Poincaré; Vol. 19; No. 10;
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
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;
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;
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;
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
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;
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
Vidick, Thomas (2017) Parallel DIQKD from parallel repetition
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; Yuen, Henry (2016) A simple proof of Renner's exponential de Finetti theorem
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;
Chung, Kai-Min; Cohen, Gil et al. (2016) Quantum-Proof Extractors: Optimal up to Constant Factors arXiv; (Submitted)
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;
Heilman, Steven; Vidick, Thomas (2016) A Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem
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;
Natarajan, Anand; Vidick, Thomas (2015) Constant-Soundness Interactive Proofs for Local Hamiltonians (Submitted)
Mančinska, Laura; Vidick, Thomas (2015) Unbounded entanglement in nonlocal games Quantum Information and Computation; Vol. 15; No. 15-16;
Bavarian, Mohammad; Vidick, Thomas et al. (2015) Anchoring games for parallel repetition (Submitted)
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;
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;
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
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;
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
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;
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
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;
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
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;
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
Molina, Abel; Vidick, Thomas et al. (2012) Optimal counterfeiting attacks and generalizations for Wiesner's quantum money
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;
Vazirani, Umesh; Vidick, Thomas (2011) Certifiable Quantum Dice - Or, testable exponential randomness expansion
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;
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;
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
Briët, Jop; Buhrman, Harry et al. (2009) Multiplayer XOR games and quantum communication complexity with clique-wise entanglement arXiv;
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;
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
Kempe, Julia; Vidick, Thomas (2006) On the Power of Entangled Quantum Provers (Submitted)