<h1>Vidick, Thomas</h1>
<h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Lewis, Laura and Zhu, Daiwei, el al. (2024) <a href="https://authors.library.caltech.edu/records/ywbmf-80155">Experimental implementation of an efficient test of quantumness</a>; Physical Review A; Vol. 109; No. 1; 012610; <a href="https://doi.org/10.1103/physreva.109.012610">10.1103/physreva.109.012610</a></li>
<li>Culf, Eric and Vidick, Thomas, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221221-004754845">Group coset monogamy games and an application to device-independent continuous-variable QKD</a>; <a href="https://doi.org/10.48550/arXiv.2212.03935">10.48550/arXiv.2212.03935</a></li>
<li>Lewis, Laura and Zhu, Daiwei, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221221-004807787">Experimental Implementation of an Efficient Test of Quantumness</a>; <a href="https://doi.org/10.48550/arXiv.2209.14316">10.48550/arXiv.2209.14316</a></li>
<li>Culf, Eric and Vidick, Thomas (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230103-818063100.36">A monogamy-of-entanglement game for subspace coset states</a>; Quantum; Vol. 6; Art. No. 791; <a href="https://doi.org/10.22331/q-2022-09-01-791">10.22331/q-2022-09-01-791</a></li>
<li>Bartusek, James and Kalai, Yael Tauman, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221221-004803338">Succinct Classical Verification of Quantum Computation</a>; <a href="https://doi.org/10.48550/arXiv.2206.14929">10.48550/arXiv.2206.14929</a></li>
<li>Dinur, Irit and Hsieh, Min-Hsiu, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221221-004759070">Good Quantum LDPC Codes with Linear Time Decoders</a>; <a href="https://doi.org/10.48550/arXiv.2206.07750">10.48550/arXiv.2206.07750</a></li>
<li>Mahadev, Urmila and Vazirani, Umesh, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221220-222320267">Efficient Certifiable Randomness from a Single Quantum Device</a>; <a href="https://doi.org/10.48550/arXiv.2204.11353">10.48550/arXiv.2204.11353</a></li>
<li>Bavarian, Mohammad and Vidick, Thomas, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221011-459044000.22">Anchored Parallel Repetition for Nonlocal Games</a>; SIAM Journal on Computing; Vol. 51; No. 2; 214-253; <a href="https://doi.org/10.1137/21m1405927">10.1137/21m1405927</a></li>
<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 (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211006-163212999">Almost synchronous quantum correlations</a>; Journal of Mathematical Physics; Vol. 63; No. 2; Art. No. 022201; <a href="https://doi.org/10.1063/5.0056512">10.1063/5.0056512</a></li>
<li>Zhu, Daiwei and Kahanamoku-Meyer, Gregory D., el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220202-191905591">Interactive Protocols for Classically-Verifiable Quantum Advantage</a>; <a href="https://doi.org/10.48550/arXiv.2112.05156">10.48550/arXiv.2112.05156</a></li>
<li>Ji, Zhengfeng and Natarajan, Anand, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200417-131646685">MIP* = RE</a>; Communications of the ACM; Vol. 64; No. 11; 131-138; <a href="https://doi.org/10.1145/3485628">10.1145/3485628</a></li>
<li>Metger, Tony and Vidick, Thomas (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200417-132557882">Self-testing of a single quantum device under computational assumptions</a>; Quantum; Vol. 5; Art. No. 544; <a href="https://doi.org/10.22331/q-2021-09-16-544">10.22331/q-2021-09-16-544</a></li>
<li>Brakerski, Zvika and Christiano, Paul, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210921-144712064">A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device</a>; Journal of the ACM; Vol. 68; No. 5; Art. No. 31; <a href="https://doi.org/10.1145/3441309">10.1145/3441309</a></li>
<li>Culf, Eric and Vidick, Thomas (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211006-152638528">A monogamy-of-entanglement game for subspace coset states</a>; <a href="https://doi.org/10.48550/arXiv.2107.13324">10.48550/arXiv.2107.13324</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>Coudron, Matthew and Stark, Jalex, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-100502117">Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits</a>; Communications in Mathematical Physics; Vol. 382; No. 1; 49-86; <a href="https://doi.org/10.1007/s00220-021-03963-w">10.1007/s00220-021-03963-w</a></li>
<li>Ji, Zhengfeng and Leung, Debbie, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190204-154622144">A three-player coherent state embezzlement game</a>; Quantum; Vol. 4; Art. No. 349; <a href="https://doi.org/10.22331/q-2020-10-26-349">10.22331/q-2020-10-26-349</a></li>
<li>Ji, Zhengfeng and Natarajan, Anand, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211004-222652076">Quantum soundness of the classical low individual degree test</a>; <a href="https://doi.org/10.48550/arXiv.2009.12982">10.48550/arXiv.2009.12982</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>Vidick, Thomas and Zhang, Tina (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-095213331">Classical zero-knowledge arguments for quantum computations</a>; Quantum; Vol. 4; Art. No. 266; <a href="https://doi.org/10.22331/q-2020-05-14-266">10.22331/q-2020-05-14-266</a></li>
<li>Vidick, Thomas and Zhang, Tina (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200728-145122122">Classical proofs of quantum knowledge</a>; <a href="https://doi.org/10.48550/arXiv.2005.01691">10.48550/arXiv.2005.01691</a></li>
<li>Vidick, Thomas (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200316-150528835">Verifying quantum computations at scale: A cryptographic leash on quantum devices</a>; Bulletin of the American Mathematical Society; Vol. 57; No. 1; 39-76; <a href="https://doi.org/10.1090/bull/1678">10.1090/bull/1678</a></li>
<li>Coladangelo, Andrea and Vidick, Thomas, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200110-140701565">Non-interactive zero-knowledge arguments for QMA, with preprocessing</a>; <a href="https://doi.org/10.48550/arXiv.1911.07546">10.48550/arXiv.1911.07546</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>Vidick, Thomas (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200728-152043230">From Operator Algebras to Complexity Theory and Back</a>; Notices of the American Mathematical Society; Vol. 66; No. 10; 1618-1627; <a href="https://doi.org/10.1090/noti1980">10.1090/noti1980</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>Vazirani, Umesh and Vidick, Thomas (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190321-152633091">Fully device independent quantum key distribution</a>; Communications of the ACM; Vol. 62; No. 4; 133-133; <a href="https://doi.org/10.1145/3310974">10.1145/3310974</a></li>
<li>Arnon-Friedman, Rotem and Renner, Renato, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190206-150209557">Simple and tight device-independent security proofs</a>; SIAM Journal on Computing; Vol. 48; No. 1; 181-225; <a href="https://doi.org/10.1137/18M1174726">10.1137/18M1174726</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>Slofstra, William and Vidick, Thomas (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180926-132554192">Entanglement in Non-local Games and the Hyperlinear Profile of Groups</a>; Annales Henri Poincaré; Vol. 19; No. 10; 2979-3005; <a href="https://doi.org/10.1007/s00023-018-0718-y">10.1007/s00023-018-0718-y</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>Chao, Rui and Reichardt, Ben W., el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20171108-142443122">Test for a large amount of entanglement, using few measurements</a>; Quantum; Vol. 2; Art. No. 92; <a href="https://doi.org/10.22331/q-2018-09-03-92">10.22331/q-2018-09-03-92</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>Ostrev, Dimiter and Vidick, Thomas (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180926-101512002">Entanglement of approximate quantum strategies in XOR games</a>; Quantum Information and Computation; Vol. 18; No. 7-8; 617-631; <a href="https://doi.org/10.48550/arXiv.1609.01652">10.48550/arXiv.1609.01652</a></li>
<li>Arnon-Friedman, Rotem and Dupuis, Frédéric, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180130-110708768">Practical device-independent quantum cryptography via entropy accumulation</a>; Nature Communications; Vol. 9; Art. No. 459; PMCID PMC5792631; <a href="https://doi.org/10.1038/s41467-017-02307-4">10.1038/s41467-017-02307-4</a></li>
<li>Roberts, Brenden and Vidick, Thomas, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170627-090122309">Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians</a>; Physical Review B; Vol. 96; No. 21; Art. No. 214203; <a href="https://doi.org/10.1103/PhysRevB.96.214203">10.1103/PhysRevB.96.214203</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>Arad, Itai and Landau, Zeph, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160321-072746620">Rigorous RG algorithms and area laws for low energy eigenstates in 1D</a>; Communications in Mathematical Physics; Vol. 356; No. 1; 65-105; <a href="https://doi.org/10.1007/s00220-017-2973-z">10.1007/s00220-017-2973-z</a></li>
<li>Gosset, David and Mehta, Jenish C., el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20171011-112512941">QCMA hardness of ground space connectivity for commuting Hamiltonians</a>; Quantum; Vol. 1; 16; <a href="https://doi.org/10.22331/q-2017-07-14-16">10.22331/q-2017-07-14-16</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>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>Vidick, Thomas (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-102806367">Parallel DIQKD from parallel repetition</a>; <a href="https://doi.org/10.48550/arXiv.1703.08508">10.48550/arXiv.1703.08508</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>Pironio, S. and Scarani, V., el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161205-151744898">Focus on device independent quantum information</a>; New Journal of Physics; Vol. 18; No. 10; Art. No. 100202; <a href="https://doi.org/10.1088/1367-2630/18/10/100202">10.1088/1367-2630/18/10/100202</a></li>
<li>Vidick, Thomas and Yuen, Henry (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-103022957">A simple proof of Renner's exponential de Finetti theorem</a>; <a href="https://doi.org/10.48550/arXiv.1608.04814">10.48550/arXiv.1608.04814</a></li>
<li>Vidick, Thomas (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161103-145636436">Three-Player Entangled XOR Games are NP-Hard to Approximate</a>; SIAM Journal on Computing; Vol. 45; No. 3; 1007-1063; <a href="https://doi.org/10.1137/140956622">10.1137/140956622</a></li>
<li>Anshu, Anurag and Arad, Itai, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-153303794">A simple proof of the detectability lemma and spectral gap amplification</a>; Physical Review B; Vol. 93; No. 20; Art. No. 205142; <a href="https://doi.org/10.1103/PhysRevB.93.205142">10.1103/PhysRevB.93.205142</a></li>
<li>Chung, Kai-Min and Cohen, Gil, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160517-182619760">Quantum-Proof Extractors: Optimal up to Constant Factors</a>; <a href="https://doi.org/10.48550/arXiv.1605.04194">10.48550/arXiv.1605.04194</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>Heilman, Steven and Vidick, Thomas (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-103637958">A Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem</a>; <a href="https://doi.org/10.48550/arXiv.1603.05620">10.48550/arXiv.1603.05620</a></li>
<li>Arnon-Friedman, Rotem and Renner, Renato, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-101440389">Non-Signaling Parallel Repetition Using de Finetti Reductions</a>; IEEE Transactions on Information Theory; Vol. 62; No. 3; 1440-1457; <a href="https://doi.org/10.1109/TIT.2016.2516022">10.1109/TIT.2016.2516022</a></li>
<li>Palazuelos, Carlos and Vidick, Thomas (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160225-142342994">Survey on nonlocal games and operator space theory</a>; Journal of Mathematical Physics; Vol. 57; No. 1; Art. No. 015220; <a href="https://doi.org/10.1063/1.4938052">10.1063/1.4938052</a></li>
<li>Natarajan, Anand and Vidick, Thomas (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-160143988">Constant-Soundness Interactive Proofs for Local Hamiltonians</a>; <a href="https://doi.org/10.48550/arXiv.1512.02090">10.48550/arXiv.1512.02090</a></li>
<li>Mančinska, Laura and Vidick, Thomas (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160818-080941623">Unbounded entanglement in nonlocal games</a>; Quantum Information and Computation; Vol. 15; No. 15-16; 1317-1332; <a href="https://doi.org/10.48550/arXiv.1402.4145">10.48550/arXiv.1402.4145</a></li>
<li>Bavarian, Mohammad and Vidick, Thomas, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-152740730">Anchoring games for parallel repetition</a>; <a href="https://doi.org/10.48550/arXiv.1509.07466">10.48550/arXiv.1509.07466</a></li>
<li>Regev, Oded and Vidick, Thomas (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160321-083901879">Quantum XOR Games</a>; ACM Transactions on Computation Theory; Vol. 7; No. 4; Art. No. 15; <a href="https://doi.org/10.1145/2799560">10.1145/2799560</a></li>
<li>Landau, Zeph and Vazirani, Umesh, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150422-093309397">A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians</a>; Nature Physics; Vol. 11; No. 7; 566-569; <a href="https://doi.org/10.1038/nphys3345">10.1038/nphys3345</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>Dinur, Irit and Steurer, David, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150615-140934465">A parallel repetition theorem for entangled projection games</a>; Computational Complexity; Vol. 24; No. 2; 201-254; <a href="https://doi.org/10.1007/s00037-015-0098-3">10.1007/s00037-015-0098-3</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>Vazirani, Umesh and Vidick, Thomas (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150108-142044094">Fully Device-Independent Quantum Key Distribution</a>; Physical Review Letters; Vol. 113; No. 14; Art. No. 140501; <a href="https://doi.org/10.1103/PhysRevLett.113.140501">10.1103/PhysRevLett.113.140501</a></li>
<li>Naor, Assaf and Regev, Oded, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200731-152129927">Efficient Rounding for the Noncommutative Grothendieck Inequality</a>; Theory of Computing; Vol. 10; No. 1; 257-295; <a href="https://doi.org/10.4086/toc.2014.v010a011">10.4086/toc.2014.v010a011</a></li>
<li>Regev, Oded and Vidick, Thomas (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-152323237">Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms</a>; Journal of Operator Theory; Vol. 71; No. 2; 491-506; <a href="https://doi.org/10.7900/jot.2012jul02.1947">10.7900/jot.2012jul02.1947</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>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>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>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>Briët, Jop and Vidick, Thomas (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-154623344">Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games</a>; Communications in Mathematical Physics; Vol. 321; No. 1; 181-207; <a href="https://doi.org/10.1007/s00220-012-1642-5">10.1007/s00220-012-1642-5</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>Aharonov, Dorit and Arad, Itai, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-135821275">Guest Column: The Quantum PCP Conjecture</a>; ACM SIGACT News; Vol. 44; No. 2; 47-79; <a href="https://doi.org/10.1145/2491533.2491549">10.1145/2491533.2491549</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>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>Briët, Jop and Buhrman, Harry, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140909-144447941">Multipartite entanglement in XOR games</a>; Quantum Information and Computation; Vol. 13; No. 3-4; 334-360; <a href="https://doi.org/10.48550/arXiv.0911.4007">10.48550/arXiv.0911.4007</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>De, Anindya and Portmann, Christopher, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160322-084353163">Trevisan's Extractor in the Presence of Quantum Side Information</a>; SIAM Journal on Computing; Vol. 41; No. 4; 915-940; <a href="https://doi.org/10.1137/100813683">10.1137/100813683</a></li>
<li>Vazirani, Umesh and Vidick, Thomas (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200804-084834826">Certifiable quantum dice</a>; Philosophical Transactions A: Mathematical, Physical and Engineering Sciences; Vol. 370; No. 1971; 3432-3448; <a href="https://doi.org/10.1098/rsta.2011.0336">10.1098/rsta.2011.0336</a></li>
<li>Vidick, Thomas (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200804-133447851">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</a>; Chicago Journal of Theoretical Computer Science; Vol. 18; No. 1; 1-12; <a href="https://doi.org/10.4086/cjtcs.2012.001">10.4086/cjtcs.2012.001</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>Molina, Abel and Vidick, Thomas, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-104220786">Optimal counterfeiting attacks and generalizations for Wiesner's quantum money</a>; <a href="https://doi.org/10.48550/arXiv.1202.4010">10.48550/arXiv.1202.4010</a></li>
<li>Briët, Jop and Buhrman, Harry, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200728-153958382">All Schatten spaces endowed with the Schur product are Q-algebras</a>; Journal of Functional Analysis; Vol. 262; No. 1; 1-9; <a href="https://doi.org/10.1016/j.jfa.2011.09.001">10.1016/j.jfa.2011.09.001</a></li>
<li>Vazirani, Umesh and Vidick, Thomas (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-104707093">Certifiable Quantum Dice - Or, testable exponential randomness expansion</a>; <a href="https://doi.org/10.48550/arXiv.1111.6054">10.48550/arXiv.1111.6054</a></li>
<li>Vidick, Thomas and Wehner, Stephanie (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-151328788">Does Ignorance of the Whole Imply Ignorance of the Parts? Large Violations of Noncontextuality in Quantum Theory</a>; Physical Review Letters; Vol. 107; No. 3; Art. No. 030402; <a href="https://doi.org/10.1103/PhysRevLett.107.030402">10.1103/PhysRevLett.107.030402</a></li>
<li>Kempe, Julia and Kobayashi, Hirotada, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110713-155400829">Entangled Games Are Hard to Approximate</a>; SIAM Journal on Computing; Vol. 40; No. 3; 848-877; <a href="https://doi.org/10.1137/090751293">10.1137/090751293</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>Vidick, Thomas and Wehner, Stephanie (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160318-115742532">More nonlocality with less entanglement</a>; Physical Review A; Vol. 83; No. 5; Art. No. 052310; <a href="https://doi.org/10.1103/PhysRevA.83.052310">10.1103/PhysRevA.83.052310</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>Briët, Jop and Buhrman, Harry, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-111726313">Multiplayer XOR games and quantum communication complexity with clique-wise entanglement</a>; <a href="https://doi.org/10.48550/arXiv.0911.4007v1">10.48550/arXiv.0911.4007v1</a></li>
<li>Kempe, Julia and Kobayashi, Hirotada, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200805-150138118">Using Entanglement in Quantum Multi-Prover Interactive Proofs</a>; Computational Complexity; Vol. 18; No. 2; 273-307; <a href="https://doi.org/10.1007/s00037-009-0275-3">10.1007/s00037-009-0275-3</a></li>
<li>Ricotta, Guillaume and Vidick, Thomas (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190320-142201374">Hauteur asymptotique des points de Heegner</a>; Canadian Journal of Mathematics; Vol. 60; No. 6; 1406-1436; <a href="https://doi.org/10.4153/CJM-2008-059-4">10.4153/CJM-2008-059-4</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>Nguyen, Phong Q. and Vidick, Thomas (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200804-103250325">Sieve algorithms for the shortest vector problem are practical</a>; Journal of Mathematical Cryptology; Vol. 2; No. 2; 181-207; <a href="https://doi.org/10.1515/jmc.2008.009">10.1515/jmc.2008.009</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>
<li>Kempe, Julia and Vidick, Thomas (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160322-085312434">On the Power of Entangled Quantum Provers</a>; <a href="https://doi.org/10.48550/arXiv.0612063">10.48550/arXiv.0612063</a></li>
</ul>