Vidick, Thomas

Article from CaltechAUTHORS

• Lewis, Laura and Zhu, Daiwei, et el. (2024) Experimental implementation of an efficient test of quantumness; Physical Review A; Vol. 109; No. 1; 012610; 10.1103/physreva.109.012610
• Culf, Eric and Vidick, Thomas (2022) A monogamy-of-entanglement game for subspace coset states; Quantum; Vol. 6; Art. No. 791; 10.22331/q-2022-09-01-791
• Bavarian, Mohammad and Vidick, Thomas, et el. (2022) Anchored Parallel Repetition for Nonlocal Games; SIAM Journal on Computing; Vol. 51; No. 2; 214-253; 10.1137/21m1405927
• Vidick, Thomas (2022) Almost synchronous quantum correlations; Journal of Mathematical Physics; Vol. 63; No. 2; Art. No. 022201; 10.1063/5.0056512
• Ji, Zhengfeng and Natarajan, Anand, et el. (2021) MIP* = RE; Communications of the ACM; Vol. 64; No. 11; 131-138; 10.1145/3485628
• Metger, Tony and Vidick, Thomas (2021) Self-testing of a single quantum device under computational assumptions; Quantum; Vol. 5; Art. No. 544; 10.22331/q-2021-09-16-544
• Brakerski, Zvika and Christiano, Paul, et el. (2021) A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device; Journal of the ACM; Vol. 68; No. 5; Art. No. 31; 10.1145/3441309
• Coudron, Matthew and Stark, Jalex, et el. (2021) Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits; Communications in Mathematical Physics; Vol. 382; No. 1; 49-86; 10.1007/s00220-021-03963-w
• Ji, Zhengfeng and Leung, Debbie, et el. (2020) A three-player coherent state embezzlement game; Quantum; Vol. 4; Art. No. 349; 10.22331/q-2020-10-26-349
• Vidick, Thomas and Zhang, Tina (2020) Classical zero-knowledge arguments for quantum computations; Quantum; Vol. 4; Art. No. 266; 10.22331/q-2020-05-14-266
• Vidick, Thomas (2020) Verifying quantum computations at scale: A cryptographic leash on quantum devices; Bulletin of the American Mathematical Society; Vol. 57; No. 1; 39-76; 10.1090/bull/1678
• Vidick, Thomas (2019) From Operator Algebras to Complexity Theory and Back; Notices of the American Mathematical Society; Vol. 66; No. 10; 1618-1627; 10.1090/noti1980
• Vazirani, Umesh and Vidick, Thomas (2019) Fully device independent quantum key distribution; Communications of the ACM; Vol. 62; No. 4; 133-133; 10.1145/3310974
• Arnon-Friedman, Rotem and Renner, Renato, et el. (2019) Simple and tight device-independent security proofs; SIAM Journal on Computing; Vol. 48; No. 1; 181-225; 10.1137/18M1174726
• Slofstra, William and Vidick, Thomas (2018) Entanglement in Non-local Games and the Hyperlinear Profile of Groups; Annales Henri Poincaré; Vol. 19; No. 10; 2979-3005; 10.1007/s00023-018-0718-y
• Chao, Rui and Reichardt, Ben W., et el. (2018) Test for a large amount of entanglement, using few measurements; Quantum; Vol. 2; Art. No. 92; 10.22331/q-2018-09-03-92
• Ostrev, Dimiter and Vidick, Thomas (2018) Entanglement of approximate quantum strategies in XOR games; Quantum Information and Computation; Vol. 18; No. 7-8; 617-631; 10.48550/arXiv.1609.01652
• Arnon-Friedman, Rotem and Dupuis, Frédéric, et el. (2018) Practical device-independent quantum cryptography via entropy accumulation; Nature Communications; Vol. 9; Art. No. 459; PMCID PMC5792631; 10.1038/s41467-017-02307-4
• Roberts, Brenden and Vidick, Thomas, et el. (2017) Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians; Physical Review B; Vol. 96; No. 21; Art. No. 214203; 10.1103/PhysRevB.96.214203
• Arad, Itai and Landau, Zeph, et el. (2017) Rigorous RG algorithms and area laws for low energy eigenstates in 1D; Communications in Mathematical Physics; Vol. 356; No. 1; 65-105; 10.1007/s00220-017-2973-z
• Gosset, David and Mehta, Jenish C., et el. (2017) QCMA hardness of ground space connectivity for commuting Hamiltonians; Quantum; Vol. 1; 16; 10.22331/q-2017-07-14-16
• Pironio, S. and Scarani, V., et el. (2016) Focus on device independent quantum information; New Journal of Physics; Vol. 18; No. 10; Art. No. 100202; 10.1088/1367-2630/18/10/100202
• Vidick, Thomas (2016) Three-Player Entangled XOR Games are NP-Hard to Approximate; SIAM Journal on Computing; Vol. 45; No. 3; 1007-1063; 10.1137/140956622
• Anshu, Anurag and Arad, Itai, et el. (2016) A simple proof of the detectability lemma and spectral gap amplification; Physical Review B; Vol. 93; No. 20; Art. No. 205142; 10.1103/PhysRevB.93.205142
• Arnon-Friedman, Rotem and Renner, Renato, et el. (2016) Non-Signaling Parallel Repetition Using de Finetti Reductions; IEEE Transactions on Information Theory; Vol. 62; No. 3; 1440-1457; 10.1109/TIT.2016.2516022
• Palazuelos, Carlos and Vidick, Thomas (2016) Survey on nonlocal games and operator space theory; Journal of Mathematical Physics; Vol. 57; No. 1; Art. No. 015220; 10.1063/1.4938052
• Mančinska, Laura and Vidick, Thomas (2015) Unbounded entanglement in nonlocal games; Quantum Information and Computation; Vol. 15; No. 15-16; 1317-1332; 10.48550/arXiv.1402.4145
• Regev, Oded and Vidick, Thomas (2015) Quantum XOR Games; ACM Transactions on Computation Theory; Vol. 7; No. 4; Art. No. 15; 10.1145/2799560
• Landau, Zeph and Vazirani, Umesh, et el. (2015) A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians; Nature Physics; Vol. 11; No. 7; 566-569; 10.1038/nphys3345
• Dinur, Irit and Steurer, David, et el. (2015) A parallel repetition theorem for entangled projection games; Computational Complexity; Vol. 24; No. 2; 201-254; 10.1007/s00037-015-0098-3
• Vazirani, Umesh and Vidick, Thomas (2014) Fully Device-Independent Quantum Key Distribution; Physical Review Letters; Vol. 113; No. 14; Art. No. 140501; 10.1103/PhysRevLett.113.140501
• Naor, Assaf and Regev, Oded, et el. (2014) Efficient Rounding for the Noncommutative Grothendieck Inequality; Theory of Computing; Vol. 10; No. 1; 257-295; 10.4086/toc.2014.v010a011
• Regev, Oded and Vidick, Thomas (2014) Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms; Journal of Operator Theory; Vol. 71; No. 2; 491-506; 10.7900/jot.2012jul02.1947
• Briët, Jop and Vidick, Thomas (2013) Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games; Communications in Mathematical Physics; Vol. 321; No. 1; 181-207; 10.1007/s00220-012-1642-5
• Aharonov, Dorit and Arad, Itai, et el. (2013) Guest Column: The Quantum PCP Conjecture; ACM SIGACT News; Vol. 44; No. 2; 47-79; 10.1145/2491533.2491549
• Briët, Jop and Buhrman, Harry, et el. (2013) Multipartite entanglement in XOR games; Quantum Information and Computation; Vol. 13; No. 3-4; 334-360; 10.48550/arXiv.0911.4007
• De, Anindya and Portmann, Christopher, et el. (2012) Trevisan's Extractor in the Presence of Quantum Side Information; SIAM Journal on Computing; Vol. 41; No. 4; 915-940; 10.1137/100813683
• Vazirani, Umesh and Vidick, Thomas (2012) Certifiable quantum dice; Philosophical Transactions A: Mathematical, Physical and Engineering Sciences; Vol. 370; No. 1971; 3432-3448; 10.1098/rsta.2011.0336
• 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; 1-12; 10.4086/cjtcs.2012.001
• Briët, Jop and Buhrman, Harry, et el. (2012) All Schatten spaces endowed with the Schur product are Q-algebras; Journal of Functional Analysis; Vol. 262; No. 1; 1-9; 10.1016/j.jfa.2011.09.001
• Vidick, Thomas and 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; Art. No. 030402; 10.1103/PhysRevLett.107.030402
• Kempe, Julia and Kobayashi, Hirotada, et el. (2011) Entangled Games Are Hard to Approximate; SIAM Journal on Computing; Vol. 40; No. 3; 848-877; 10.1137/090751293
• Vidick, Thomas and Wehner, Stephanie (2011) More nonlocality with less entanglement; Physical Review A; Vol. 83; No. 5; Art. No. 052310; 10.1103/PhysRevA.83.052310
• Kempe, Julia and Kobayashi, Hirotada, et el. (2009) Using Entanglement in Quantum Multi-Prover Interactive Proofs; Computational Complexity; Vol. 18; No. 2; 273-307; 10.1007/s00037-009-0275-3
• Ricotta, Guillaume and Vidick, Thomas (2008) Hauteur asymptotique des points de Heegner; Canadian Journal of Mathematics; Vol. 60; No. 6; 1406-1436; 10.4153/CJM-2008-059-4
• Nguyen, Phong Q. and Vidick, Thomas (2008) Sieve algorithms for the shortest vector problem are practical; Journal of Mathematical Cryptology; Vol. 2; No. 2; 181-207; 10.1515/jmc.2008.009