<h1>Vidick, Thomas</h1> <h2>Article 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 (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>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>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>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>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>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 (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>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>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>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>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>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>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>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 (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>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>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>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>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>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>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>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>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>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>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>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>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>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>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> </ul>