(orcid 0000-0002-6405-365X)
Ji, Zhengfeng; Natarajan, Anand et al. (2022) Quantum soundness of testing tensor codes In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS); arXiv; In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 7-10 February 2022, Denver, CO https://doi.org/10.1109/FOCS52979.2021.00064
Vidick, Thomas; Zhang, Tina (2021) Classical Proofs of Quantum Knowledge In: Advances in Cryptology – EUROCRYPT 2021; Lecture Notes in Computer Science; Vol. 12697; Series Lecture Notes in Computer Science; No. 12697; https://doi.org/10.1007/978-3-030-77886-6_22
Regev, Oded; Vidick, Thomas (2020) Bounds on Dimension Reduction in the Nuclear Norm In: Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II; Series Lecture Notes in Mathematics; No. 2266; https://doi.org/10.1007/978-3-030-46762-3_13
Brakerski, Zvika; Koppula, Venkata et al. (2020) Simpler Proofs of Quantumness In: 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020); arXiv; Series Leibniz International Proceedings in Informatics; In: 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), 9-12 June 2020, Riga, Latvia https://doi.org/10.4230/LIPIcs.TQC.2020.8
Gheorghiu, Alexandru; Vidick, Thomas (2019) Computationally-Secure and Composable Remote State Preparation In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS); In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 9-12 November 2019, Baltimore, MD https://doi.org/10.1109/focs.2019.00066
Fitzsimons, Joseph; Ji, Zhengfeng et al. (2019) Quantum proof systems for iterated exponential time, and beyond In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC '19); arXiv; In: 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), 23-26 June 2019, Phoenix, AZ https://doi.org/10.1145/3313276.3316343
Aggarwal, Divesh; Chung, Kai-Min et al. (2019) A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries In: Advances in Cryptology - EUROCRYPT 2019; arXiv; Series Lecture Notes in Computer Science; No. 11477; In: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 19-23 May 2019, Darmstadt, Germany https://doi.org/10.1007/978-3-030-17656-3_16
Coladangelo, Andrea; Grilo, Alex B. et al. (2019) Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources In: Advances in Cryptology - EUROCRYPT 2019; arXiv; Series Lecture Notes in Computer Science; No. 11478; In: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 19-23 May 2019, Darmstadt, Germany https://doi.org/10.1007/978-3-030-17659-4_9
Brakerski, Zvika; Christiano, Paul et al. (2018) A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS); In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 7-9 October 2018, Paris, France https://doi.org/10.1109/focs.2018.00038
Natarajan, Anand; Vidick, Thomas (2018) Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS); In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 7-9 October 2018, Paris, France https://doi.org/10.1109/focs.2018.00075
Natarajan, Anand; Vidick, Thomas (2018) Two-Player Entangled Games are NP-Hard In: 33rd Computational Complexity Conference (CCC 2018); Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany; Series Leibniz International Proceedings in Informatics; In: 33rd Computational Complexity Conference (CCC 2018), 22-24 June 2018, San Diego, CA https://doi.org/10.4230/LIPIcs.CCC.2018.20
Bavarian, Mohammad; Vidick, Thomas et al. (2017) Parallel repetition via fortification: analytic view and the quantum case In: 8th Innovations in Theoretical Computer Science Conference; Series Leibniz International Proceedings in Informatics; No. 67; In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 9-11 January 2017, Berkeley, CA https://doi.org/10.4230/LIPIcs.ITCS.2017.22
Arad, Itai; Landau, Zeph et al. (2017) Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D In: 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; In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 9-11 January 2017, Berkeley, CA https://doi.org/10.4230/LIPIcs.ITCS.2017.46
Natarajan, Anand; Vidick, Thomas (2017) A quantum linearity test for robustly verifying entanglement In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017; In: 49th Annual ACM SIGACT Symposium on Theory of Computing, 19-23 June 2017, Montreal, Canada https://doi.org/10.1145/3055399.3055468
Bavarian, Mohammad; Vidick, Thomas et al. (2017) Hardness amplification for entangled games via anchoring In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017; In: 49th Annual ACM SIGACT Symposium on Theory of Computing, June 19-23, 2017, Montreal, QC https://doi.org/10.1145/3055399.3055433
Chao, Rui; Reichardt, Ben W. et al. (2017) Overlapping Qubits In: 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; In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 9-11 January 2017, Berkeley, CA https://doi.org/10.4230/LIPIcs.ITCS.2017.48
Vidick, Thomas; Watrous, John (2016) Quantum Proofs In: Foundations and Trends in Theoretical Computer Science; Foundations and Trends in Theoretical Computer Science; Vol. 11; No. 1-2; https://doi.org/10.1561/0400000068
Coudron, Matthew; Vidick, Thomas (2015) Interactive Proofs with Approximately Commuting Provers In: Automata, Languages, and Programming; Series Lecture Notes in Computer Science; No. 9134; In: Automata, Languages, and Programming: 42nd International Colloquium (ICALP 2015), 6-10 July 2015, Kyoto, Japan https://doi.org/10.1007/978-3-662-47672-7_29
Fitzsimons, Joseph; Vidick, Thomas (2015) A Multiprover Interactive Proof System for the Local Hamiltonian Problem In: ITCS'15 Innovations in Theoretical Computer Science; In: ITCS '15, 2015 Conference on Innovations in Theoretical Computer Science, January 11-13, 2015, Rehovot, Israel https://doi.org/10.1145/2688073.2688094
Dinur, Irit; Steurer, David et al. (2014) A parallel repetition theorem for entangled projection games In: Proceedings of the Annual IEEE Conference on Computational Complexity; In: IEEE 29th Conference on Computational Complexity, CCC 2014, June 11-13, 2014, Vancouver, BC https://doi.org/10.1109/CCC.2014.28
Landau, Zeph; Vazirani, Umesh et al. (2014) An efficient algorithm for finding the ground state of 1D gapped local hamiltonians In: Proceedings of the 5th conference on Innovations in theoretical computer science ; In: 5th conference on Innovations in theoretical computer science (ITCS '14), January 12–14, 2014, Princeton, NJ https://doi.org/10.1145/2554797.2554825
Vazirani, Umesh; Vidick, Thomas (2014) Robust device independent quantum key distribution In: Proceedings of the 5th conference on Innovations in theoretical computer science ; In: 5th conference on Innovations in theoretical computer science (ITCS '14), January 12–14, 2014, Princeton, NJ https://doi.org/10.1145/2554797.2554802
Mančinska, Laura; Vidick, Thomas (2014) Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability In: Automata, Languages, and Programming; Lecture Notes in Computer Science; Series Lecture Notes in Computer Science; No. 8572; In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 9-11 July 2014, Copenhagen, Denmark https://doi.org/10.1007/978-3-662-43948-7_69
Vidick, Thomas (2013) Three-player entangled XOR games are NP-hard to approximate In: IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS); In: IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), 26-29 October 2013, Berkeley, CA https://doi.org/10.1109/FOCS.2013.87
Naor, Assaf; Regev, Oded et al. (2013) Efficient Rounding for the Noncommutative Grothendieck Inequality In: Proceedings of the forty-fifth annual ACM symposium on Theory of computing; In: Forty-fifth annual ACM symposium on Theory of Computing (ToC), June 1-4, 2013, Palo Alto, CA https://doi.org/10.1145/2488608.2488618
Regev, Oded; Vidick, Thomas (2013) Quantum XOR Games In: 28th Annual IEEE Conference on Computational Complexity (CCC); In: 28th Annual IEEE Conference on Computational Complexity (CCC), 5-7 June 2013, Stanford, CA https://doi.org/10.1109/CCC.2013.23
Molina, Abel; Vidick, Thomas et al. (2013) Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money In: Theory of Quantum Computation, Communication, and Cryptography; Series Lecture Notes in Computer Science; No. 7582; In: 7th Conference on Theory of Quantum Computation (TQC), 17-19 May 2012, Tokyo, Japan https://doi.org/10.1007/978-3-642-35656-8_4
Coudron, Matthew; Vidick, Thomas et al. (2013) Robust Randomness Amplifiers: Upper and Lower Bounds In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; Series Lecture Notes in Computer Science; No. 8096; In: 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, 21-23 August 2013, Berkeley, CA https://doi.org/10.1007/978-3-642-40328-6_33
Ito, Tsuyoshi; Vidick, Thomas (2012) A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS); In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), 20-23 October 2013, New Brunswick, NJ https://doi.org/10.1109/FOCS.2012.11
Vazirani, Umesh; Vidick, Thomas (2012) Certifiable Quantum Dice Or, True Random Number Generation Secure Against Quantum Adversaries In: STOC'12 Symposium on Theory of Computing Conference; In: STOC'12 Symposium on Theory of Computing Conference, May 19-22, 2012, New York, NY https://doi.org/10.1145/2213977.2213984
Kempe, Julia; Vidick, Thomas (2011) Parallel Repetition of Entangled Games In: Proceedings of the 43rd annual ACM symposium on Theory of computing ; In: 43rd annual ACM symposium on Theory of computing (STOC '11), June 6–8, 2011, San Jose, CA https://doi.org/10.1145/1993636.1993684
De, Anindya; Vidick, Thomas (2010) Near-Optimal Extractors Against Quantum Storage In: Proceedings of the 42nd ACM symposium on Theory of computing; In: 42nd ACM symposium on Theory of computing (STOC '10), June 5–8, 2010, Cambridge, MA https://doi.org/10.1145/1806689.1806713
Kempe, J.; Vidick, T. (2010) Quantum Algorithms In: Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments; Lecture Notes in Physics; Series Lecture Notes in Physics; No. 808; https://doi.org/10.1007/978-3-642-11914-9_10
Brody, Joshua; Chakrabarti, Amit et al. (2010) Better Gap-Hamming Lower Bounds via Better Round Elimination In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; arXiv; Series Lecture Notes in Computer Science; No. 6302; In: 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, 1-3 September 2010, Barcelona, Spain https://doi.org/10.1007/978-3-642-15369-3_36
Kempe, Julia; Kobayashi, Hirotada et al. (2008) Entangled games are hard to approximate In: 49th Annual Symposium on Foundations-of-Computer-Science (FOCS); In: 49th Annual Symposium on Foundations-of-Computer-Science (FOCS), 25-28 October 2008, Philadelphia, PA https://doi.org/10.1109/FOCS.2008.8
Kempe, Julia; Kobayashi, Hirotada et al. (2008) Using Entanglement in Quantum Multi-Prover Interactive Proofs In: 23rd Annual IEEE Conference on Computational Complexity; In: 23rd Annual IEEE Conference on Computational Complexity, June 23-26, 2008, College Park, MD https://doi.org/10.1109/CCC.2008.6