(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 (2022) Almost synchronous quantum correlations Journal of Mathematical Physics; Vol. 63; No. 2; https://doi.org/10.1063/5.0056512
Zhu, Daiwei; Kahanamoku-Meyer, Gregory D. et al. (2021) Interactive Protocols for Classically-Verifiable Quantum Advantage arXiv; https://resolver.caltech.edu/CaltechAUTHORS:20220202-191905591
Ji, Zhengfeng; Natarajan, Anand et al. (2021) MIP* = RE Communications of the ACM; Vol. 64; No. 11; https://doi.org/10.1145/3485628
Metger, Tony; Vidick, Thomas (2021) Self-testing of a single quantum device under computational assumptions Quantum; Vol. 5; https://doi.org/10.22331/q-2021-09-16-544
Brakerski, Zvika; Christiano, Paul et al. (2021) A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device Journal of the ACM; Vol. 68; No. 5; https://doi.org/10.1145/3441309
Culf, Eric; Vidick, Thomas (2021) A monogamy-of-entanglement game for subspace coset states arXiv; https://resolver.caltech.edu/CaltechAUTHORS:20211006-152638528
Coudron, Matthew; Stark, Jalex et al. (2021) Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits Communications in Mathematical Physics; Vol. 382; No. 1; https://doi.org/10.1007/s00220-021-03963-w
Ji, Zhengfeng; Leung, Debbie et al. (2020) A three-player coherent state embezzlement game Quantum; Vol. 4; https://doi.org/10.22331/q-2020-10-26-349
Ji, Zhengfeng; Natarajan, Anand et al. (2020) Quantum soundness of the classical low individual degree test arXiv; https://resolver.caltech.edu/CaltechAUTHORS:20211004-222652076
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
Vidick, Thomas; Zhang, Tina (2020) Classical zero-knowledge arguments for quantum computations Quantum; Vol. 4; https://doi.org/10.22331/q-2020-05-14-266
Vidick, Thomas; Zhang, Tina (2020) Classical proofs of quantum knowledge arXiv; https://resolver.caltech.edu/CaltechAUTHORS:20200728-145122122
Vidick, Thomas (2020) Verifying quantum computations at scale: A cryptographic leash on quantum devices Bulletin of the American Mathematical Society; Vol. 57; No. 1; https://doi.org/10.1090/bull/1678
Coladangelo, Andrea; Vidick, Thomas et al. (2019) Non-interactive zero-knowledge arguments for QMA, with preprocessing arXiv; https://resolver.caltech.edu/CaltechAUTHORS:20200110-140701565
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
Vidick, Thomas (2019) From Operator Algebras to Complexity Theory and Back Notices of the American Mathematical Society; Vol. 66; No. 10; https://doi.org/10.1090/noti1980
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
Vazirani, Umesh; Vidick, Thomas (2019) Fully device independent quantum key distribution Communications of the ACM; Vol. 62; No. 4; https://doi.org/10.1145/3310974
Arnon-Friedman, Rotem; Renner, Renato et al. (2019) Simple and tight device-independent security proofs SIAM Journal on Computing; Vol. 48; No. 1; https://doi.org/10.1137/18M1174726
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
Slofstra, William; Vidick, Thomas (2018) Entanglement in Non-local Games and the Hyperlinear Profile of Groups Annales Henri Poincaré; Vol. 19; No. 10; https://doi.org/10.1007/s00023-018-0718-y
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
Chao, Rui; Reichardt, Ben W. et al. (2018) Test for a large amount of entanglement, using few measurements Quantum; Vol. 2; https://doi.org/10.22331/q-2018-09-03-92
Ostrev, Dimiter; Vidick, Thomas (2018) Entanglement of approximate quantum strategies in XOR games Quantum Information and Computation; Vol. 18; No. 7-8; https://resolver.caltech.edu/CaltechAUTHORS:20180926-101512002
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
Arnon-Friedman, Rotem; Dupuis, Frédéric et al. (2018) Practical device-independent quantum cryptography via entropy accumulation Nature Communications; Vol. 9; https://doi.org/10.1038/s41467-017-02307-4
Roberts, Brenden; Vidick, Thomas et al. (2017) Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians Physical Review B; Vol. 96; No. 21; https://doi.org/10.1103/PhysRevB.96.214203
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
Arad, Itai; Landau, Zeph et al. (2017) Rigorous RG algorithms and area laws for low energy eigenstates in 1D Communications in Mathematical Physics; Vol. 356; No. 1; https://doi.org/10.1007/s00220-017-2973-z
Gosset, David; Mehta, Jenish C. et al. (2017) QCMA hardness of ground space connectivity for commuting Hamiltonians Quantum; Vol. 1; https://doi.org/10.22331/q-2017-07-14-16
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
Vidick, Thomas (2017) Parallel DIQKD from parallel repetition https://resolver.caltech.edu/CaltechAUTHORS:20190320-102806367
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
Pironio, S.; Scarani, V. et al. (2016) Focus on device independent quantum information New Journal of Physics; Vol. 18; No. 10; https://doi.org/10.1088/1367-2630/18/10/100202
Vidick, Thomas; Yuen, Henry (2016) A simple proof of Renner's exponential de Finetti theorem https://resolver.caltech.edu/CaltechAUTHORS:20190320-103022957
Vidick, Thomas (2016) Three-Player Entangled XOR Games are NP-Hard to Approximate SIAM Journal on Computing; Vol. 45; No. 3; https://resolver.caltech.edu/CaltechAUTHORS:20161103-145636436
Anshu, Anurag; Arad, Itai et al. (2016) A simple proof of the detectability lemma and spectral gap amplification Physical Review B; Vol. 93; No. 20; https://doi.org/10.1103/PhysRevB.93.205142
Chung, Kai-Min; Cohen, Gil et al. (2016) Quantum-Proof Extractors: Optimal up to Constant Factors arXiv; https://resolver.caltech.edu/CaltechAUTHORS:20160517-182619760 (Submitted)
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
Heilman, Steven; Vidick, Thomas (2016) A Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem https://resolver.caltech.edu/CaltechAUTHORS:20190320-103637958
Arnon-Friedman, Rotem; Renner, Renato et al. (2016) Non-Signaling Parallel Repetition Using de Finetti Reductions IEEE Transactions on Information Theory; Vol. 62; No. 3; https://doi.org/10.1109/TIT.2016.2516022
Palazuelos, Carlos; Vidick, Thomas (2016) Survey on nonlocal games and operator space theory Journal of Mathematical Physics; Vol. 57; No. 1; https://doi.org/10.1063/1.4938052
Natarajan, Anand; Vidick, Thomas (2015) Constant-Soundness Interactive Proofs for Local Hamiltonians https://resolver.caltech.edu/CaltechAUTHORS:20160318-160143988 (Submitted)
Mančinska, Laura; Vidick, Thomas (2015) Unbounded entanglement in nonlocal games Quantum Information and Computation; Vol. 15; No. 15-16; https://resolver.caltech.edu/CaltechAUTHORS:20160818-080941623
Bavarian, Mohammad; Vidick, Thomas et al. (2015) Anchoring games for parallel repetition https://resolver.caltech.edu/CaltechAUTHORS:20160318-152740730 (Submitted)
Regev, Oded; Vidick, Thomas (2015) Quantum XOR Games ACM Transactions on Computation Theory; Vol. 7; No. 4; https://doi.org/10.1145/2799560
Landau, Zeph; Vazirani, Umesh et al. (2015) A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians Nature Physics; Vol. 11; No. 7; https://doi.org/10.1038/nphys3345
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
Dinur, Irit; Steurer, David et al. (2015) A parallel repetition theorem for entangled projection games Computational Complexity; Vol. 24; No. 2; https://doi.org/10.1007/s00037-015-0098-3
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
Vazirani, Umesh; Vidick, Thomas (2014) Fully Device-Independent Quantum Key Distribution Physical Review Letters; Vol. 113; No. 14; https://doi.org/10.1103/PhysRevLett.113.140501
Naor, Assaf; Regev, Oded et al. (2014) Efficient Rounding for the Noncommutative Grothendieck Inequality Theory of Computing; Vol. 10; No. 1; https://doi.org/10.4086/toc.2014.v010a011
Regev, Oded; Vidick, Thomas (2014) Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms Journal of Operator Theory; Vol. 71; No. 2; https://doi.org/10.7900/jot.2012jul02.1947
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
Briët, Jop; Vidick, Thomas (2013) Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games Communications in Mathematical Physics; Vol. 321; No. 1; https://doi.org/10.1007/s00220-012-1642-5
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
Aharonov, Dorit; Arad, Itai et al. (2013) Guest Column: The Quantum PCP Conjecture ACM SIGACT News; Vol. 44; No. 2; https://doi.org/10.1145/2491533.2491549
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
Briët, Jop; Buhrman, Harry et al. (2013) Multipartite entanglement in XOR games Quantum Information and Computation; Vol. 13; No. 3-4; https://resolver.caltech.edu/CaltechAUTHORS:20140909-144447941
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
De, Anindya; Portmann, Christopher et al. (2012) Trevisan's Extractor in the Presence of Quantum Side Information SIAM Journal on Computing; Vol. 41; No. 4; https://doi.org/10.1137/100813683
Vazirani, Umesh; Vidick, Thomas (2012) Certifiable quantum dice Philosophical Transactions A: Mathematical, Physical and Engineering Sciences; Vol. 370; No. 1971; https://doi.org/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; https://doi.org/10.4086/cjtcs.2012.001
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
Molina, Abel; Vidick, Thomas et al. (2012) Optimal counterfeiting attacks and generalizations for Wiesner's quantum money https://resolver.caltech.edu/CaltechAUTHORS:20190320-104220786
Briët, Jop; Buhrman, Harry et al. (2012) All Schatten spaces endowed with the Schur product are Q-algebras Journal of Functional Analysis; Vol. 262; No. 1; https://doi.org/10.1016/j.jfa.2011.09.001
Vazirani, Umesh; Vidick, Thomas (2011) Certifiable Quantum Dice - Or, testable exponential randomness expansion https://resolver.caltech.edu/CaltechAUTHORS:20190320-104707093
Vidick, Thomas; 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; https://doi.org/10.1103/PhysRevLett.107.030402
Kempe, Julia; Kobayashi, Hirotada et al. (2011) Entangled Games Are Hard to Approximate SIAM Journal on Computing; Vol. 40; No. 3; https://doi.org/10.1137/090751293
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
Vidick, Thomas; Wehner, Stephanie (2011) More nonlocality with less entanglement Physical Review A; Vol. 83; No. 5; https://doi.org/10.1103/PhysRevA.83.052310
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
Briët, Jop; Buhrman, Harry et al. (2009) Multiplayer XOR games and quantum communication complexity with clique-wise entanglement arXiv; https://resolver.caltech.edu/CaltechAUTHORS:20190320-111726313
Kempe, Julia; Kobayashi, Hirotada et al. (2009) Using Entanglement in Quantum Multi-Prover Interactive Proofs Computational Complexity; Vol. 18; No. 2; https://doi.org/10.1007/s00037-009-0275-3
Ricotta, Guillaume; Vidick, Thomas (2008) Hauteur asymptotique des points de Heegner Canadian Journal of Mathematics; Vol. 60; No. 6; https://doi.org/10.4153/CJM-2008-059-4
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
Nguyen, Phong Q.; Vidick, Thomas (2008) Sieve algorithms for the shortest vector problem are practical Journal of Mathematical Cryptology; Vol. 2; No. 2; https://doi.org/10.1515/jmc.2008.009
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
Kempe, Julia; Vidick, Thomas (2006) On the Power of Entangled Quantum Provers https://resolver.caltech.edu/CaltechAUTHORS:20160322-085312434 (Submitted)