@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220202-191902193,
    title = "2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "Quantum soundness of testing tensor codes",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220202-191902193",
    id = "record",
    isbn = "978-1-6654-2056-3",
    doi = "10.1109/FOCS52979.2021.00064"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20221011-458984000.5,
    title = "Advances in Cryptology – EUROCRYPT 2021",
    chapter = "Classical Proofs of Quantum Knowledge",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20221011-458984000.5",
    id = "record",
    isbn = "9783030778859",
    doi = "10.1007/978-3-030-77886-6\_22"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190320-095834301,
    title = "Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II",
    chapter = "Bounds on Dimension Reduction in the Nuclear Norm",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-095834301",
    id = "record",
    isbn = "978-3-030-46761-6",
    doi = "10.1007/978-3-030-46762-3\_13"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200728-144326318,
    chapter = "Simpler Proofs of Quantumness",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200728-144326318",
    id = "record",
    doi = "10.4230/LIPIcs.TQC.2020.8"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200109-143243905,
    title = "2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "Computationally-Secure and Composable Remote State Preparation",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200109-143243905",
    id = "record",
    isbn = "9781728149523",
    doi = "10.1109/focs.2019.00066"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190204-112657116,
    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",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190204-112657116",
    id = "record",
    isbn = "978-1-4503-6705-9",
    doi = "10.1145/3313276.3316343"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190320-123759874,
    title = "Advances in Cryptology - EUROCRYPT 2019",
    chapter = "Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-123759874",
    id = "record",
    isbn = "978-3-030-17658-7",
    doi = "10.1007/978-3-030-17659-4\_9"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190320-102401828,
    title = "Advances in Cryptology - EUROCRYPT 2019",
    chapter = "A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-102401828",
    id = "record",
    isbn = "978-3-030-17655-6",
    doi = "10.1007/978-3-030-17656-3\_16"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229217,
    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",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229217",
    id = "record",
    isbn = "9781538642306",
    doi = "10.1109/focs.2018.00075"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229032,
    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",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229032",
    id = "record",
    isbn = "9781538642306",
    doi = "10.1109/focs.2018.00038"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180822-141142977,
    title = "33rd Computational Complexity Conference (CCC 2018)",
    chapter = "Two-Player Entangled Games are NP-Hard",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180822-141142977",
    id = "record",
    isbn = "978-3-95977-069-9",
    doi = "10.4230/LIPIcs.CCC.2018.20"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160321-071142064,
    title = "8th Innovations in Theoretical Computer Science Conference",
    chapter = "Parallel repetition via fortification: analytic view and
 the quantum case",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160321-071142064",
    id = "record",
    isbn = "9783959770293",
    doi = "10.4230/LIPIcs.ITCS.2017.22"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200804-100730896,
    chapter = "Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200804-100730896",
    id = "record",
    doi = "10.4230/LIPIcs.ITCS.2017.46"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170710-152910604,
    title = "Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017",
    chapter = "Hardness amplification for entangled games via anchoring",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170710-152910604",
    id = "record",
    isbn = "978-1-4503-4528-6",
    doi = "10.1145/3055399.3055433"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170710-154654821,
    title = "Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017",
    chapter = "A quantum linearity test for robustly verifying entanglement",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170710-154654821",
    id = "record",
    isbn = "978-1-4503-4528-6",
    doi = "10.1145/3055399.3055468"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20171011-113818136,
    title = "8th Innovations in Theoretical Computer Science Conference (ITCS 2017)",
    chapter = "Overlapping Qubits",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20171011-113818136",
    id = "record",
    isbn = "9783959770293",
    doi = "10.4230/LIPIcs.ITCS.2017.48"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160622-144016671,
    title = "Foundations and Trends in Theoretical Computer Science",
    chapter = "Quantum Proofs",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160622-144016671",
    id = "record",
    isbn = "978-1-68083-126-9",
    doi = "10.1561/0400000068"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20151207-141218015,
    title = "Automata, Languages, and Programming",
    chapter = "Interactive Proofs with Approximately Commuting Provers",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20151207-141218015",
    id = "record",
    isbn = "978-3-662-47671-0",
    doi = "10.1007/978-3-662-47672-7\_29"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150218-115725417,
    title = "ITCS'15 Innovations in Theoretical Computer Science",
    chapter = "A Multiprover Interactive Proof System for the Local Hamiltonian Problem",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150218-115725417",
    id = "record",
    isbn = "978-1-4503-3333-7",
    doi = "10.1145/2688073.2688094"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-132001940,
    title = "Proceedings of the Annual IEEE Conference on Computational Complexity",
    chapter = "A parallel repetition theorem for entangled projection games",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-132001940",
    id = "record",
    isbn = "978-1-4799-3626-7",
    doi = "10.1109/CCC.2014.28"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140909-145320191,
    title = "Proceedings of the 5th conference on Innovations in theoretical computer science",
    chapter = "Robust device independent quantum key distribution",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-145320191",
    id = "record",
    isbn = "978-1-4503-2698-8",
    doi = "10.1145/2554797.2554802"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140909-142344205,
    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",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-142344205",
    id = "record",
    isbn = "978-1-4503-2698-8",
    doi = "10.1145/2554797.2554825"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200805-153500961,
    title = "Automata, Languages, and Programming",
    chapter = "Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200805-153500961",
    id = "record",
    isbn = "978-3-662-43947-0",
    doi = "10.1007/978-3-662-43948-7\_69"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-100149541,
    title = "IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "Three-player entangled XOR games are NP-hard to approximate",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-100149541",
    id = "record",
    isbn = "978-0-7695-5135-7",
    doi = "10.1109/FOCS.2013.87"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-115031387,
    title = "Proceedings of the forty-fifth annual ACM symposium on Theory of computing",
    chapter = "Efficient Rounding for the Noncommutative Grothendieck Inequality",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-115031387",
    id = "record",
    isbn = "978-1-4503-2029-0",
    doi = "10.1145/2488608.2488618"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160329-155246836,
    title = "28th Annual IEEE Conference on Computational Complexity (CCC)",
    chapter = "Quantum XOR Games",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160329-155246836",
    id = "record",
    isbn = "978-0-7695-4997-2",
    doi = "10.1109/CCC.2013.23"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160318-153752227,
    title = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques",
    chapter = "Robust Randomness Amplifiers: Upper and Lower Bounds",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-153752227",
    id = "record",
    isbn = "978-3-642-40327-9",
    doi = "10.1007/978-3-642-40328-6\_33"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160318-155200133,
    title = "Theory of Quantum Computation, Communication, and Cryptography",
    chapter = "Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-155200133",
    id = "record",
    isbn = "978-3-642-35655-1",
    doi = "10.1007/978-3-642-35656-8\_4"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-100733064,
    title = "IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS)",
    chapter = "A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-100733064",
    id = "record",
    isbn = "978-1-4673-4383-1",
    doi = "10.1109/FOCS.2012.11"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-141425231,
    title = "STOC'12 Symposium on Theory of Computing Conference",
    chapter = "Certifiable Quantum Dice Or, True Random Number Generation Secure Against Quantum Adversaries",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-141425231",
    id = "record",
    isbn = "978-1-4503-1245-5",
    doi = "10.1145/2213977.2213984"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-135518364,
    title = "Proceedings of the 43rd annual ACM symposium on Theory of computing",
    chapter = "Parallel Repetition of Entangled Games",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-135518364",
    id = "record",
    isbn = "978-1-4503-0691-1",
    doi = "10.1145/1993636.1993684"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-145258006,
    title = "Proceedings of the 42nd ACM symposium on Theory of computing",
    chapter = "Near-Optimal Extractors Against Quantum Storage",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-145258006",
    id = "record",
    isbn = "978-1-4503-0050-6",
    doi = "10.1145/1806689.1806713"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200804-153453452,
    title = "Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments",
    chapter = "Quantum Algorithms",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200804-153453452",
    id = "record",
    isbn = "978-3-642-11913-2",
    doi = "10.1007/978-3-642-11914-9\_10"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190320-105826650,
    title = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques",
    chapter = "Better Gap-Hamming Lower Bounds via Better Round Elimination",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-105826650",
    id = "record",
    isbn = "978-3-642-15368-6",
    doi = "10.1007/978-3-642-15369-3\_36"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-085511133,
    title = "49th Annual Symposium on Foundations-of-Computer-Science (FOCS)",
    chapter = "Entangled games are hard to approximate",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-085511133",
    id = "record",
    isbn = "978-0-7695-3436-7",
    doi = "10.1109/FOCS.2008.8"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-083116800,
    title = "23rd Annual IEEE Conference on Computational Complexity",
    chapter = "Using Entanglement in Quantum Multi-Prover Interactive Proofs",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-083116800",
    id = "record",
    isbn = "978-0-7695-3169-4",
    doi = "10.1109/CCC.2008.6"
}