<h1>Vidick, Thomas</h1>
<h2>Book Chapter from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Ji, Zhengfeng and Natarajan, Anand, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220202-191902193">Quantum soundness of testing tensor codes</a>; ISBN 978-1-6654-2056-3; 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS); 586-597; <a href="https://doi.org/10.1109/FOCS52979.2021.00064">10.1109/FOCS52979.2021.00064</a></li>
<li>Vidick, Thomas and Zhang, Tina (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221011-458984000.5">Classical Proofs of Quantum Knowledge</a>; ISBN 9783030778859; Advances in Cryptology – EUROCRYPT 2021; 630-660; <a href="https://doi.org/10.1007/978-3-030-77886-6_22">10.1007/978-3-030-77886-6_22</a></li>
<li>Regev, Oded and Vidick, Thomas (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-095834301">Bounds on Dimension Reduction in the Nuclear Norm</a>; ISBN 978-3-030-46761-6; Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II; 279-299; <a href="https://doi.org/10.1007/978-3-030-46762-3_13">10.1007/978-3-030-46762-3_13</a></li>
<li>Brakerski, Zvika and Koppula, Venkata, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200728-144326318">Simpler Proofs of Quantumness</a>; <a href="https://doi.org/10.4230/LIPIcs.TQC.2020.8">10.4230/LIPIcs.TQC.2020.8</a></li>
<li>Gheorghiu, Alexandru and Vidick, Thomas (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200109-143243905">Computationally-Secure and Composable Remote State Preparation</a>; ISBN 9781728149523; 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS); 1024-1033; <a href="https://doi.org/10.1109/focs.2019.00066">10.1109/focs.2019.00066</a></li>
<li>Fitzsimons, Joseph and Ji, Zhengfeng, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190204-112657116">Quantum proof systems for iterated exponential time, and beyond</a>; ISBN 978-1-4503-6705-9; Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC '19); 473-480; <a href="https://doi.org/10.1145/3313276.3316343">10.1145/3313276.3316343</a></li>
<li>Aggarwal, Divesh and Chung, Kai-Min, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-102401828">A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries</a>; ISBN 978-3-030-17655-6; Advances in Cryptology - EUROCRYPT 2019; 442-469; <a href="https://doi.org/10.1007/978-3-030-17656-3_16">10.1007/978-3-030-17656-3_16</a></li>
<li>Coladangelo, Andrea and Grilo, Alex B., el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-123759874">Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources</a>; ISBN 978-3-030-17658-7; Advances in Cryptology - EUROCRYPT 2019; 247-277; <a href="https://doi.org/10.1007/978-3-030-17659-4_9">10.1007/978-3-030-17659-4_9</a></li>
<li>Natarajan, Anand and Vidick, Thomas (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229217">Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA</a>; ISBN 9781538642306; 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS); 731-742; <a href="https://doi.org/10.1109/focs.2018.00075">10.1109/focs.2018.00075</a></li>
<li>Brakerski, Zvika and Christiano, Paul, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229032">A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device</a>; ISBN 9781538642306; 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS); 320-331; <a href="https://doi.org/10.1109/focs.2018.00038">10.1109/focs.2018.00038</a></li>
<li>Natarajan, Anand and Vidick, Thomas (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180822-141142977">Two-Player Entangled Games are NP-Hard</a>; ISBN 978-3-95977-069-9; 33rd Computational Complexity Conference (CCC 2018); Art. No. 20; <a href="https://doi.org/10.4230/LIPIcs.CCC.2018.20">10.4230/LIPIcs.CCC.2018.20</a></li>
<li>Bavarian, Mohammad and Vidick, Thomas, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160321-071142064">Parallel repetition via fortification: analytic view and
the quantum case</a>; ISBN 9783959770293; 8th Innovations in Theoretical Computer Science Conference; Art. No. 22; <a href="https://doi.org/10.4230/LIPIcs.ITCS.2017.22">10.4230/LIPIcs.ITCS.2017.22</a></li>
<li>Arad, Itai and Landau, Zeph, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200804-100730896">Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D</a>; <a href="https://doi.org/10.4230/LIPIcs.ITCS.2017.46">10.4230/LIPIcs.ITCS.2017.46</a></li>
<li>Bavarian, Mohammad and Vidick, Thomas, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170710-152910604">Hardness amplification for entangled games via anchoring</a>; ISBN 978-1-4503-4528-6; Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017; 303-316; <a href="https://doi.org/10.1145/3055399.3055433">10.1145/3055399.3055433</a></li>
<li>Natarajan, Anand and Vidick, Thomas (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170710-154654821">A quantum linearity test for robustly verifying entanglement</a>; ISBN 978-1-4503-4528-6; Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017; 1003-1015; <a href="https://doi.org/10.1145/3055399.3055468">10.1145/3055399.3055468</a></li>
<li>Chao, Rui and Reichardt, Ben W., el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20171011-113818136">Overlapping Qubits</a>; ISBN 9783959770293; 8th Innovations in Theoretical Computer Science Conference (ITCS 2017); Art. No. 48; <a href="https://doi.org/10.4230/LIPIcs.ITCS.2017.48">10.4230/LIPIcs.ITCS.2017.48</a></li>
<li>Vidick, Thomas and Watrous, John (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160622-144016671">Quantum Proofs</a>; ISBN 978-1-68083-126-9; Foundations and Trends in Theoretical Computer Science; 1-215; <a href="https://doi.org/10.1561/0400000068">10.1561/0400000068</a></li>
<li>Coudron, Matthew and Vidick, Thomas (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151207-141218015">Interactive Proofs with Approximately Commuting Provers</a>; ISBN 978-3-662-47671-0; Automata, Languages, and Programming; 355-366; <a href="https://doi.org/10.1007/978-3-662-47672-7_29">10.1007/978-3-662-47672-7_29</a></li>
<li>Fitzsimons, Joseph and Vidick, Thomas (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150218-115725417">A Multiprover Interactive Proof System for the Local Hamiltonian Problem</a>; ISBN 978-1-4503-3333-7; ITCS'15 Innovations in Theoretical Computer Science; 103-112; <a href="https://doi.org/10.1145/2688073.2688094">10.1145/2688073.2688094</a></li>
<li>Dinur, Irit and Steurer, David, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-132001940">A parallel repetition theorem for entangled projection games</a>; ISBN 978-1-4799-3626-7; Proceedings of the Annual IEEE Conference on Computational Complexity; 197-208; <a href="https://doi.org/10.1109/CCC.2014.28">10.1109/CCC.2014.28</a></li>
<li>Vazirani, Umesh and Vidick, Thomas (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140909-145320191">Robust device independent quantum key distribution</a>; ISBN 978-1-4503-2698-8; Proceedings of the 5th conference on Innovations in theoretical computer science; 35-36; <a href="https://doi.org/10.1145/2554797.2554802">10.1145/2554797.2554802</a></li>
<li>Landau, Zeph and Vazirani, Umesh, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140909-142344205">An efficient algorithm for finding the ground state of 1D gapped local hamiltonians</a>; ISBN 978-1-4503-2698-8; Proceedings of the 5th conference on Innovations in theoretical computer science; 301; <a href="https://doi.org/10.1145/2554797.2554825">10.1145/2554797.2554825</a></li>
<li>Mančinska, Laura and Vidick, Thomas (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200805-153500961">Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability</a>; ISBN 978-3-662-43947-0; Automata, Languages, and Programming; 835-846; <a href="https://doi.org/10.1007/978-3-662-43948-7_69">10.1007/978-3-662-43948-7_69</a></li>
<li>Vidick, Thomas (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-100149541">Three-player entangled XOR games are NP-hard to approximate</a>; ISBN 978-0-7695-5135-7; IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS); 766-775; <a href="https://doi.org/10.1109/FOCS.2013.87">10.1109/FOCS.2013.87</a></li>
<li>Naor, Assaf and Regev, Oded, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-115031387">Efficient Rounding for the Noncommutative Grothendieck Inequality</a>; ISBN 978-1-4503-2029-0; Proceedings of the forty-fifth annual ACM symposium on Theory of computing; 71-80; <a href="https://doi.org/10.1145/2488608.2488618">10.1145/2488608.2488618</a></li>
<li>Regev, Oded and Vidick, Thomas (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160329-155246836">Quantum XOR Games</a>; ISBN 978-0-7695-4997-2; 28th Annual IEEE Conference on Computational Complexity (CCC); 144-155; <a href="https://doi.org/10.1109/CCC.2013.23">10.1109/CCC.2013.23</a></li>
<li>Molina, Abel and Vidick, Thomas, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-155200133">Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money</a>; ISBN 978-3-642-35655-1; Theory of Quantum Computation, Communication, and Cryptography; 45-64; <a href="https://doi.org/10.1007/978-3-642-35656-8_4">10.1007/978-3-642-35656-8_4</a></li>
<li>Coudron, Matthew and Vidick, Thomas, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-153752227">Robust Randomness Amplifiers: Upper and Lower Bounds</a>; ISBN 978-3-642-40327-9; Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; 468-483; <a href="https://doi.org/10.1007/978-3-642-40328-6_33">10.1007/978-3-642-40328-6_33</a></li>
<li>Ito, Tsuyoshi and Vidick, Thomas (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-100733064">A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers</a>; ISBN 978-1-4673-4383-1; IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS); 243-252; <a href="https://doi.org/10.1109/FOCS.2012.11">10.1109/FOCS.2012.11</a></li>
<li>Vazirani, Umesh and Vidick, Thomas (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-141425231">Certifiable Quantum Dice Or, True Random Number Generation Secure Against Quantum Adversaries</a>; ISBN 978-1-4503-1245-5; STOC'12 Symposium on Theory of Computing Conference; 61-76; <a href="https://doi.org/10.1145/2213977.2213984">10.1145/2213977.2213984</a></li>
<li>Kempe, Julia and Vidick, Thomas (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-135518364">Parallel Repetition of Entangled Games</a>; ISBN 978-1-4503-0691-1; Proceedings of the 43rd annual ACM symposium on Theory of computing; 353-362; <a href="https://doi.org/10.1145/1993636.1993684">10.1145/1993636.1993684</a></li>
<li>De, Anindya and Vidick, Thomas (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-145258006">Near-Optimal Extractors Against Quantum Storage</a>; ISBN 978-1-4503-0050-6; Proceedings of the 42nd ACM symposium on Theory of computing; 161-170; <a href="https://doi.org/10.1145/1806689.1806713">10.1145/1806689.1806713</a></li>
<li>Kempe, J. and Vidick, T. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200804-153453452">Quantum Algorithms</a>; ISBN 978-3-642-11913-2; Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments; 309-342; <a href="https://doi.org/10.1007/978-3-642-11914-9_10">10.1007/978-3-642-11914-9_10</a></li>
<li>Brody, Joshua and Chakrabarti, Amit, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-105826650">Better Gap-Hamming Lower Bounds via Better Round Elimination</a>; ISBN 978-3-642-15368-6; Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; 476-489; <a href="https://doi.org/10.1007/978-3-642-15369-3_36">10.1007/978-3-642-15369-3_36</a></li>
<li>Kempe, Julia and Kobayashi, Hirotada, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-085511133">Entangled games are hard to approximate</a>; ISBN 978-0-7695-3436-7; 49th Annual Symposium on Foundations-of-Computer-Science (FOCS); 447-456; <a href="https://doi.org/10.1109/FOCS.2008.8">10.1109/FOCS.2008.8</a></li>
<li>Kempe, Julia and Kobayashi, Hirotada, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-083116800">Using Entanglement in Quantum Multi-Prover Interactive Proofs</a>; ISBN 978-0-7695-3169-4; 23rd Annual IEEE Conference on Computational Complexity; 211-222; <a href="https://doi.org/10.1109/CCC.2008.6">10.1109/CCC.2008.6</a></li>
</ul>