@inbook{https://authors.library.caltech.edu/records/4grjj-3yz53,
    authors = "Ji, Zhengfeng and Natarajan, Anand and Vidick, Thomas and Wright, John and Yuen, Henry",
    title = "2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "Quantum soundness of testing tensor codes",
    address = "Piscataway, NJ",
    publisher = "IEEE",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220202-191902193",
    id = "https://authors.library.caltech.edu/records/4grjj-3yz53",
    isbn = "978-1-6654-2056-3",
    doi = "10.1109/FOCS52979.2021.00064",
    pages = "586-597"
}


@inbook{https://authors.library.caltech.edu/records/f8mg6-thk70,
    authors = "Vidick, Thomas and Zhang, Tina",
    title = "Advances in Cryptology – EUROCRYPT 2021",
    chapter = "Classical Proofs of Quantum Knowledge",
    address = "Cham",
    publisher = "Springer",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20221011-458984000.5",
    id = "https://authors.library.caltech.edu/records/f8mg6-thk70",
    isbn = "9783030778859",
    doi = "10.1007/978-3-030-77886-6\_22",
    pages = "630-660"
}


@inbook{https://authors.library.caltech.edu/records/zp1qm-x7t84,
    authors = "Regev, Oded and Vidick, Thomas",
    title = "Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II",
    chapter = "Bounds on Dimension Reduction in the Nuclear Norm",
    address = "Cham",
    publisher = "Springer",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-095834301",
    id = "https://authors.library.caltech.edu/records/zp1qm-x7t84",
    isbn = "978-3-030-46761-6",
    doi = "10.1007/978-3-030-46762-3\_13",
    pages = "279-299"
}


@inbook{https://authors.library.caltech.edu/records/gc1g3-t8y68,
    authors = "Brakerski, Zvika and Koppula, Venkata and Vazirani, Umesh and Vidick, Thomas",
    chapter = "Simpler Proofs of Quantumness",
    publisher = "Schloss Dagstuhl – Leibniz-Zentrum für Informatik",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200728-144326318",
    id = "https://authors.library.caltech.edu/records/gc1g3-t8y68",
    doi = "10.4230/LIPIcs.TQC.2020.8"
}


@inbook{https://authors.library.caltech.edu/records/rfp2d-0gm62,
    authors = "Gheorghiu, Alexandru and Vidick, Thomas",
    title = "2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "Computationally-Secure and Composable Remote State Preparation",
    address = "Piscataway, NJ",
    publisher = "IEEE",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200109-143243905",
    id = "https://authors.library.caltech.edu/records/rfp2d-0gm62",
    isbn = "9781728149523",
    doi = "10.1109/focs.2019.00066",
    pages = "1024-1033"
}


@inbook{https://authors.library.caltech.edu/records/9dayn-4cc60,
    authors = "Fitzsimons, Joseph and Ji, Zhengfeng and Vidick, Thomas and Yuen, Henry",
    title = "Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC '19)",
    chapter = "Quantum proof systems for iterated exponential time, and beyond",
    address = "New York, NY",
    publisher = "Association for Computing Machinery",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190204-112657116",
    id = "https://authors.library.caltech.edu/records/9dayn-4cc60",
    isbn = "978-1-4503-6705-9",
    doi = "10.1145/3313276.3316343",
    pages = "473-480"
}


@inbook{https://authors.library.caltech.edu/records/r8mqr-wwp18,
    authors = "Aggarwal, Divesh and Chung, Kai-Min and Lin, Han-Hsuan and Vidick, Thomas",
    title = "Advances in Cryptology - EUROCRYPT 2019",
    chapter = "A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries",
    address = "Cham",
    publisher = "Springer",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-102401828",
    id = "https://authors.library.caltech.edu/records/r8mqr-wwp18",
    isbn = "978-3-030-17655-6",
    doi = "10.1007/978-3-030-17656-3\_16",
    pages = "442-469"
}


@inbook{https://authors.library.caltech.edu/records/b281r-47v91,
    authors = "Coladangelo, Andrea and Grilo, Alex B. and Jeffery, Stacey and Vidick, Thomas",
    title = "Advances in Cryptology - EUROCRYPT 2019",
    chapter = "Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources",
    address = "Cham",
    publisher = "Springer",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-123759874",
    id = "https://authors.library.caltech.edu/records/b281r-47v91",
    isbn = "978-3-030-17658-7",
    doi = "10.1007/978-3-030-17659-4\_9",
    pages = "247-277"
}


@inbook{https://authors.library.caltech.edu/records/54rbf-hkb86,
    authors = "Brakerski, Zvika and Christiano, Paul and Mahadev, Urmila and Vazirani, Umesh and Vidick, Thomas",
    title = "2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device",
    address = "Piscataway, NJ",
    publisher = "IEEE",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229032",
    id = "https://authors.library.caltech.edu/records/54rbf-hkb86",
    isbn = "9781538642306",
    doi = "10.1109/focs.2018.00038",
    pages = "320-331"
}


@inbook{https://authors.library.caltech.edu/records/rqdhe-c7g66,
    authors = "Natarajan, Anand and Vidick, Thomas",
    title = "2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA",
    address = "Piscataway, NJ",
    publisher = "IEEE",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229217",
    id = "https://authors.library.caltech.edu/records/rqdhe-c7g66",
    isbn = "9781538642306",
    doi = "10.1109/focs.2018.00075",
    pages = "731-742"
}


@inbook{https://authors.library.caltech.edu/records/d1tqt-vk226,
    authors = "Natarajan, Anand and Vidick, Thomas",
    title = "33rd Computational Complexity Conference (CCC 2018)",
    chapter = "Two-Player Entangled Games are NP-Hard",
    address = "Wadern, Germany",
    publisher = "Schloss Dagstuhl – Leibniz-Zentrum für Informatik",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180822-141142977",
    id = "https://authors.library.caltech.edu/records/d1tqt-vk226",
    isbn = "978-3-95977-069-9",
    doi = "10.4230/LIPIcs.CCC.2018.20",
    pages = "Art. No. 20"
}


@inbook{https://authors.library.caltech.edu/records/axpv4-mez17,
    authors = "Bavarian, Mohammad and Vidick, Thomas and Yuen, Henry",
    title = "8th Innovations in Theoretical Computer Science Conference",
    chapter = "Parallel repetition via fortification: analytic view and
 the quantum case",
    publisher = "Dagstuhl Publishing",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160321-071142064",
    id = "https://authors.library.caltech.edu/records/axpv4-mez17",
    isbn = "9783959770293",
    doi = "10.4230/LIPIcs.ITCS.2017.22",
    pages = "Art. No. 22"
}


@inbook{https://authors.library.caltech.edu/records/ym1b0-t6q73,
    authors = "Arad, Itai and Landau, Zeph and Vazirani, Umesh V. and Vidick, Thomas",
    chapter = "Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D",
    publisher = "Schloss Dagstuhl – Leibniz-Zentrum für Informatik",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200804-100730896",
    id = "https://authors.library.caltech.edu/records/ym1b0-t6q73",
    doi = "10.4230/LIPIcs.ITCS.2017.46"
}


@inbook{https://authors.library.caltech.edu/records/4q8m3-dcq05,
    authors = "Natarajan, Anand and Vidick, Thomas",
    title = "Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017",
    chapter = "A quantum linearity test for robustly verifying entanglement",
    address = "New York, NY",
    publisher = "ACM",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170710-154654821",
    id = "https://authors.library.caltech.edu/records/4q8m3-dcq05",
    isbn = "978-1-4503-4528-6",
    doi = "10.1145/3055399.3055468",
    pages = "1003-1015"
}


@inbook{https://authors.library.caltech.edu/records/t46e5-gad30,
    authors = "Bavarian, Mohammad and Vidick, Thomas and Yuen, Henry",
    title = "Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017",
    chapter = "Hardness amplification for entangled games via anchoring",
    address = "New York, NY",
    publisher = "ACM",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170710-152910604",
    id = "https://authors.library.caltech.edu/records/t46e5-gad30",
    isbn = "978-1-4503-4528-6",
    doi = "10.1145/3055399.3055433",
    pages = "303-316"
}


@inbook{https://authors.library.caltech.edu/records/6b704-1bc54,
    authors = "Chao, Rui and Reichardt, Ben W. and Sutherland, Chris and Vidick, Thomas",
    title = "8th Innovations in Theoretical Computer Science Conference (ITCS 2017)",
    chapter = "Overlapping Qubits",
    address = "Wadern, Germany",
    publisher = "Dagstuhl Publishing",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20171011-113818136",
    id = "https://authors.library.caltech.edu/records/6b704-1bc54",
    isbn = "9783959770293",
    doi = "10.4230/LIPIcs.ITCS.2017.48",
    pages = "Art. No. 48"
}


@inbook{https://authors.library.caltech.edu/records/r6rqf-ksn48,
    authors = "Vidick, Thomas and Watrous, John",
    title = "Foundations and Trends in Theoretical Computer Science",
    chapter = "Quantum Proofs",
    address = "Boston, MA",
    publisher = "Now Publishers",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160622-144016671",
    id = "https://authors.library.caltech.edu/records/r6rqf-ksn48",
    isbn = "978-1-68083-126-9",
    doi = "10.1561/0400000068",
    pages = "1-215"
}


@inbook{https://authors.library.caltech.edu/records/wxq98-nsx42,
    authors = "Coudron, Matthew and Vidick, Thomas",
    title = "Automata, Languages, and Programming",
    chapter = "Interactive Proofs with Approximately Commuting Provers",
    address = "Heidelberg",
    publisher = "Springer",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20151207-141218015",
    id = "https://authors.library.caltech.edu/records/wxq98-nsx42",
    isbn = "978-3-662-47671-0",
    doi = "10.1007/978-3-662-47672-7\_29",
    pages = "355-366"
}


@inbook{https://authors.library.caltech.edu/records/7kp5f-jkg41,
    authors = "Fitzsimons, Joseph and Vidick, Thomas",
    title = "ITCS'15 Innovations in Theoretical Computer Science",
    chapter = "A Multiprover Interactive Proof System for the Local Hamiltonian Problem",
    address = "New York, NY",
    publisher = "Association for Computing Machinery",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150218-115725417",
    id = "https://authors.library.caltech.edu/records/7kp5f-jkg41",
    isbn = "978-1-4503-3333-7",
    doi = "10.1145/2688073.2688094",
    pages = "103-112"
}


@inbook{https://authors.library.caltech.edu/records/2ss3q-1fd05,
    authors = "Dinur, Irit and Steurer, David and Vidick, Thomas",
    title = "Proceedings of the Annual IEEE Conference on Computational Complexity",
    chapter = "A parallel repetition theorem for entangled projection games",
    address = "Piscataway, NJ",
    publisher = "IEEE",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-132001940",
    id = "https://authors.library.caltech.edu/records/2ss3q-1fd05",
    isbn = "978-1-4799-3626-7",
    doi = "10.1109/CCC.2014.28",
    pages = "197-208"
}


@inbook{https://authors.library.caltech.edu/records/824jy-gh073,
    authors = "Landau, Zeph and Vazirani, Umesh and Vidick, Thomas",
    title = "Proceedings of the 5th conference on Innovations in theoretical computer science",
    chapter = "An efficient algorithm for finding the ground state of 1D gapped local hamiltonians",
    address = "New York",
    publisher = "Association for Computing Machinery",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-142344205",
    id = "https://authors.library.caltech.edu/records/824jy-gh073",
    isbn = "978-1-4503-2698-8",
    doi = "10.1145/2554797.2554825",
    pages = "301"
}


@inbook{https://authors.library.caltech.edu/records/9dbkj-rmb74,
    authors = "Vazirani, Umesh and Vidick, Thomas",
    title = "Proceedings of the 5th conference on Innovations in theoretical computer science",
    chapter = "Robust device independent quantum key distribution",
    address = "New York",
    publisher = "Association for Computing Machinery",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-145320191",
    id = "https://authors.library.caltech.edu/records/9dbkj-rmb74",
    isbn = "978-1-4503-2698-8",
    doi = "10.1145/2554797.2554802",
    pages = "35-36"
}


@inbook{https://authors.library.caltech.edu/records/gk7xg-mwf43,
    authors = "Mančinska, Laura and Vidick, Thomas",
    title = "Automata, Languages, and Programming",
    chapter = "Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability",
    address = "Berlin",
    publisher = "Springer",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200805-153500961",
    id = "https://authors.library.caltech.edu/records/gk7xg-mwf43",
    isbn = "978-3-662-43947-0",
    doi = "10.1007/978-3-662-43948-7\_69",
    pages = "835-846"
}


@inbook{https://authors.library.caltech.edu/records/7jtft-xq303,
    authors = "Vidick, Thomas",
    title = "IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "Three-player entangled XOR games are NP-hard to approximate",
    address = "Piscataway, NJ",
    publisher = "IEEE",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-100149541",
    id = "https://authors.library.caltech.edu/records/7jtft-xq303",
    isbn = "978-0-7695-5135-7",
    doi = "10.1109/FOCS.2013.87",
    pages = "766-775"
}


@inbook{https://authors.library.caltech.edu/records/pw2by-vdd33,
    authors = "Naor, Assaf and Regev, Oded and Vidick, Thomas",
    title = "Proceedings of the forty-fifth annual ACM symposium on Theory of computing",
    chapter = "Efficient Rounding for the Noncommutative Grothendieck Inequality",
    address = "New York, NY",
    publisher = "ACM",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-115031387",
    id = "https://authors.library.caltech.edu/records/pw2by-vdd33",
    isbn = "978-1-4503-2029-0",
    doi = "10.1145/2488608.2488618",
    pages = "71-80"
}


@inbook{https://authors.library.caltech.edu/records/trqk6-6wf39,
    authors = "Regev, Oded and Vidick, Thomas",
    title = "28th Annual IEEE Conference on Computational Complexity (CCC)",
    chapter = "Quantum XOR Games",
    address = "Piscataway, NJ",
    publisher = "IEEE",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160329-155246836",
    id = "https://authors.library.caltech.edu/records/trqk6-6wf39",
    isbn = "978-0-7695-4997-2",
    doi = "10.1109/CCC.2013.23",
    pages = "144-155"
}


@inbook{https://authors.library.caltech.edu/records/qj85s-2vs11,
    authors = "Molina, Abel and Vidick, Thomas and Watrous, John",
    title = "Theory of Quantum Computation, Communication, and Cryptography",
    chapter = "Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money",
    address = "Berlin",
    publisher = "Springer",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-155200133",
    id = "https://authors.library.caltech.edu/records/qj85s-2vs11",
    isbn = "978-3-642-35655-1",
    doi = "10.1007/978-3-642-35656-8\_4",
    pages = "45-64"
}


@inbook{https://authors.library.caltech.edu/records/rv1vm-pez24,
    authors = "Coudron, Matthew and Vidick, Thomas and Yuen, Henry",
    title = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques",
    chapter = "Robust Randomness Amplifiers: Upper and Lower Bounds",
    address = "Berlin",
    publisher = "Springer",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-153752227",
    id = "https://authors.library.caltech.edu/records/rv1vm-pez24",
    isbn = "978-3-642-40327-9",
    doi = "10.1007/978-3-642-40328-6\_33",
    pages = "468-483"
}


@inbook{https://authors.library.caltech.edu/records/3e7jf-4ry80,
    authors = "Ito, Tsuyoshi and Vidick, Thomas",
    title = "IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers",
    address = "Piscataway, NJ",
    publisher = "IEEE",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-100733064",
    id = "https://authors.library.caltech.edu/records/3e7jf-4ry80",
    isbn = "978-1-4673-4383-1",
    doi = "10.1109/FOCS.2012.11",
    pages = "243-252"
}


@inbook{https://authors.library.caltech.edu/records/cbfce-7ky91,
    authors = "Vazirani, Umesh and Vidick, Thomas",
    title = "STOC'12 Symposium on Theory of Computing Conference",
    chapter = "Certifiable Quantum Dice Or, True Random Number Generation Secure Against Quantum Adversaries",
    address = "New York, NY",
    publisher = "ACM",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-141425231",
    id = "https://authors.library.caltech.edu/records/cbfce-7ky91",
    isbn = "978-1-4503-1245-5",
    doi = "10.1145/2213977.2213984",
    pages = "61-76"
}


@inbook{https://authors.library.caltech.edu/records/20p0z-9eg90,
    authors = "Kempe, Julia and Vidick, Thomas",
    title = "Proceedings of the 43rd annual ACM symposium on Theory of computing",
    chapter = "Parallel Repetition of Entangled Games",
    address = "New York, NY",
    publisher = "ACM",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-135518364",
    id = "https://authors.library.caltech.edu/records/20p0z-9eg90",
    isbn = "978-1-4503-0691-1",
    doi = "10.1145/1993636.1993684",
    pages = "353-362"
}


@inbook{https://authors.library.caltech.edu/records/244tt-nr454,
    authors = "De, Anindya and Vidick, Thomas",
    title = "Proceedings of the 42nd ACM symposium on Theory of computing",
    chapter = "Near-Optimal Extractors Against Quantum Storage",
    address = "New York, NY",
    publisher = "ACM",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-145258006",
    id = "https://authors.library.caltech.edu/records/244tt-nr454",
    isbn = "978-1-4503-0050-6",
    doi = "10.1145/1806689.1806713",
    pages = "161-170"
}


@inbook{https://authors.library.caltech.edu/records/jpmw6-10232,
    authors = "Kempe, J. and Vidick, T.",
    title = "Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments",
    chapter = "Quantum Algorithms",
    address = "Berlin",
    publisher = "Springer",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200804-153453452",
    id = "https://authors.library.caltech.edu/records/jpmw6-10232",
    isbn = "978-3-642-11913-2",
    doi = "10.1007/978-3-642-11914-9\_10",
    pages = "309-342"
}


@inbook{https://authors.library.caltech.edu/records/kc0bc-rvz10,
    authors = "Brody, Joshua and Chakrabarti, Amit and Regev, Oded and Vidick, Thomas and de Wolf, Ronald",
    title = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques",
    chapter = "Better Gap-Hamming Lower Bounds via Better Round Elimination",
    address = "Berlin",
    publisher = "Springer",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-105826650",
    id = "https://authors.library.caltech.edu/records/kc0bc-rvz10",
    isbn = "978-3-642-15368-6",
    doi = "10.1007/978-3-642-15369-3\_36",
    pages = "476-489"
}


@inbook{https://authors.library.caltech.edu/records/z5j61-32k42,
    authors = "Kempe, Julia and Kobayashi, Hirotada and Matsumoto, Keiji and Toner, Ben and Vidick, Thomas",
    title = "49th Annual Symposium on Foundations-of-Computer-Science (FOCS)",
    chapter = "Entangled games are hard to approximate",
    address = "Los Alamitos, CA",
    publisher = "IEEE Computer Society",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-085511133",
    id = "https://authors.library.caltech.edu/records/z5j61-32k42",
    isbn = "978-0-7695-3436-7",
    doi = "10.1109/FOCS.2008.8",
    pages = "447-456"
}


@inbook{https://authors.library.caltech.edu/records/0n7b5-89q75,
    authors = "Kempe, Julia and Kobayashi, Hirotada and Matsumoto, Keiji and Vidick, Thomas",
    title = "23rd Annual IEEE Conference on Computational Complexity",
    chapter = "Using Entanglement in Quantum Multi-Prover Interactive Proofs",
    address = "Piscataway, NJ",
    publisher = "IEEE",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-083116800",
    id = "https://authors.library.caltech.edu/records/0n7b5-89q75",
    isbn = "978-0-7695-3169-4",
    doi = "10.1109/CCC.2008.6",
    pages = "211-222"
}