@article{https://authors.library.caltech.edu/records/ywbmf-80155,
    title = "Experimental implementation of an efficient test of quantumness",
    journal = "Physical Review A",
    year = "2024",
    url = "https://authors.library.caltech.edu/records/ywbmf-80155",
    id = "record",
    issn = "2469-9926",
    doi = "10.1103/physreva.109.012610",
    volume = "109"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20221221-004754845,
    title = "Group coset monogamy games and an application to device-independent continuous-variable QKD",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20221221-004754845",
    id = "record",
    doi = "10.48550/arXiv.2212.03935"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20221221-004807787,
    title = "Experimental Implementation of an Efficient Test of Quantumness",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20221221-004807787",
    id = "record",
    doi = "10.48550/arXiv.2209.14316"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20230103-818063100.36,
    title = "A monogamy-of-entanglement game for subspace coset states",
    journal = "Quantum",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20230103-818063100.36",
    id = "record",
    issn = "2521-327X",
    doi = "10.22331/q-2022-09-01-791",
    volume = "6"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20221221-004803338,
    title = "Succinct Classical Verification of Quantum Computation",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20221221-004803338",
    id = "record",
    doi = "10.48550/arXiv.2206.14929"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20221221-004759070,
    title = "Good Quantum LDPC Codes with Linear Time Decoders",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20221221-004759070",
    id = "record",
    doi = "10.48550/arXiv.2206.07750"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20221220-222320267,
    title = "Efficient Certifiable Randomness from a Single Quantum Device",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20221220-222320267",
    id = "record",
    doi = "10.48550/arXiv.2204.11353"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20221011-459044000.22,
    title = "Anchored Parallel Repetition for Nonlocal Games",
    journal = "SIAM Journal on Computing",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20221011-459044000.22",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/21m1405927",
    volume = "51"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20211006-163212999,
    title = "Almost synchronous quantum correlations",
    journal = "Journal of Mathematical Physics",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20211006-163212999",
    id = "record",
    issn = "0022-2488",
    doi = "10.1063/5.0056512",
    volume = "63"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220202-191905591,
    title = "Interactive Protocols for Classically-Verifiable Quantum Advantage",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220202-191905591",
    id = "record",
    doi = "10.48550/arXiv.2112.05156"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200417-131646685,
    title = "MIP* = RE",
    journal = "Communications of the ACM",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200417-131646685",
    id = "record",
    issn = "0001-0782",
    doi = "10.1145/3485628",
    volume = "64"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200417-132557882,
    title = "Self-testing of a single quantum device under computational assumptions",
    journal = "Quantum",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200417-132557882",
    id = "record",
    issn = "2521-327X",
    doi = "10.22331/q-2021-09-16-544",
    volume = "5"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20210921-144712064,
    title = "A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device",
    journal = "Journal of the ACM",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210921-144712064",
    id = "record",
    issn = "0004-5411",
    doi = "10.1145/3441309",
    volume = "68"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20211006-152638528,
    title = "A monogamy-of-entanglement game for subspace coset states",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20211006-152638528",
    id = "record",
    doi = "10.48550/arXiv.2107.13324"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190320-100502117,
    title = "Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits",
    journal = "Communications in Mathematical Physics",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-100502117",
    id = "record",
    issn = "0010-3616",
    doi = "10.1007/s00220-021-03963-w",
    volume = "382"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190204-154622144,
    title = "A three-player coherent state embezzlement game",
    journal = "Quantum",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190204-154622144",
    id = "record",
    issn = "2521-327X",
    doi = "10.22331/q-2020-10-26-349",
    volume = "4"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20211004-222652076,
    title = "Quantum soundness of the classical low individual degree test",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20211004-222652076",
    id = "record",
    doi = "10.48550/arXiv.2009.12982"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190320-095213331,
    title = "Classical zero-knowledge arguments for quantum computations",
    journal = "Quantum",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-095213331",
    id = "record",
    issn = "2521-327X",
    doi = "10.22331/q-2020-05-14-266",
    volume = "4"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20200728-145122122,
    title = "Classical proofs of quantum knowledge",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200728-145122122",
    id = "record",
    doi = "10.48550/arXiv.2005.01691"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200316-150528835,
    title = "Verifying quantum computations at scale: A cryptographic leash on quantum devices",
    journal = "Bulletin of the American Mathematical Society",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200316-150528835",
    id = "record",
    issn = "0273-0979",
    doi = "10.1090/bull/1678",
    volume = "57"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20200110-140701565,
    title = "Non-interactive zero-knowledge arguments for QMA, with preprocessing",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200110-140701565",
    id = "record",
    doi = "10.48550/arXiv.1911.07546"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200728-152043230,
    title = "From Operator Algebras to Complexity Theory and Back",
    journal = "Notices of the American Mathematical Society",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200728-152043230",
    id = "record",
    issn = "0002-9920",
    doi = "10.1090/noti1980",
    volume = "66"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190321-152633091,
    title = "Fully device independent quantum key distribution",
    journal = "Communications of the ACM",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190321-152633091",
    id = "record",
    issn = "0001-0782",
    doi = "10.1145/3310974",
    volume = "62"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190206-150209557,
    title = "Simple and tight device-independent security proofs",
    journal = "SIAM Journal on Computing",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190206-150209557",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/18M1174726",
    volume = "48"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180926-132554192,
    title = "Entanglement in Non-local Games and the Hyperlinear Profile of Groups",
    journal = "Annales Henri Poincaré",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180926-132554192",
    id = "record",
    issn = "1424-0637",
    doi = "10.1007/s00023-018-0718-y",
    volume = "19"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20171108-142443122,
    title = "Test for a large amount of entanglement, using few measurements",
    journal = "Quantum",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20171108-142443122",
    id = "record",
    issn = "2521-327X",
    doi = "10.22331/q-2018-09-03-92",
    volume = "2"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180926-101512002,
    title = "Entanglement of approximate quantum strategies in XOR games",
    journal = "Quantum Information and Computation",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180926-101512002",
    id = "record",
    issn = "1533-7146",
    doi = "10.48550/arXiv.1609.01652",
    volume = "18"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180130-110708768,
    title = "Practical device-independent quantum cryptography via entropy accumulation",
    journal = "Nature Communications",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180130-110708768",
    id = "record",
    issn = "2041-1723",
    doi = "10.1038/s41467-017-02307-4",
    volume = "9",
    pmcid = "PMC5792631"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170627-090122309,
    title = "Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians",
    journal = "Physical Review B",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170627-090122309",
    id = "record",
    issn = "2469-9950",
    doi = "10.1103/PhysRevB.96.214203",
    volume = "96"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160321-072746620,
    title = "Rigorous RG algorithms and area laws for low energy eigenstates in 1D",
    journal = "Communications in Mathematical Physics",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160321-072746620",
    id = "record",
    issn = "0010-3616",
    doi = "10.1007/s00220-017-2973-z",
    volume = "356"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20171011-112512941,
    title = "QCMA hardness of ground space connectivity for commuting Hamiltonians",
    journal = "Quantum",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20171011-112512941",
    id = "record",
    issn = "2521-327X",
    doi = "10.22331/q-2017-07-14-16",
    volume = "1"
}


@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"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190320-102806367,
    title = "Parallel DIQKD from parallel repetition",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-102806367",
    id = "record",
    doi = "10.48550/arXiv.1703.08508"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20161205-151744898,
    title = "Focus on device independent quantum information",
    journal = "New Journal of Physics",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161205-151744898",
    id = "record",
    issn = "1367-2630",
    doi = "10.1088/1367-2630/18/10/100202",
    volume = "18"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190320-103022957,
    title = "A simple proof of Renner's exponential de Finetti theorem",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-103022957",
    id = "record",
    doi = "10.48550/arXiv.1608.04814"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20161103-145636436,
    title = "Three-Player Entangled XOR Games are NP-Hard to Approximate",
    journal = "SIAM Journal on Computing",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161103-145636436",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/140956622",
    volume = "45"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160318-153303794,
    title = "A simple proof of the detectability lemma and spectral gap amplification",
    journal = "Physical Review B",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-153303794",
    id = "record",
    issn = "1098-0121",
    doi = "10.1103/PhysRevB.93.205142",
    volume = "93"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160517-182619760,
    title = "Quantum-Proof Extractors: Optimal up to Constant Factors",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160517-182619760",
    id = "record",
    doi = "10.48550/arXiv.1605.04194"
}


@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"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190320-103637958,
    title = "A Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-103637958",
    id = "record",
    doi = "10.48550/arXiv.1603.05620"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160318-101440389,
    title = "Non-Signaling Parallel Repetition Using de Finetti Reductions",
    journal = "IEEE Transactions on Information Theory",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-101440389",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2016.2516022",
    volume = "62"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160225-142342994,
    title = "Survey on nonlocal games and operator space theory",
    journal = "Journal of Mathematical Physics",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160225-142342994",
    id = "record",
    issn = "0022-2488",
    doi = "10.1063/1.4938052",
    volume = "57"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160318-160143988,
    title = "Constant-Soundness Interactive Proofs for Local Hamiltonians",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-160143988",
    id = "record",
    doi = "10.48550/arXiv.1512.02090"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160818-080941623,
    title = "Unbounded entanglement in nonlocal games",
    journal = "Quantum Information and Computation",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160818-080941623",
    id = "record",
    issn = "1533-7146",
    doi = "10.48550/arXiv.1402.4145",
    volume = "15"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160318-152740730,
    title = "Anchoring games for parallel repetition",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-152740730",
    id = "record",
    doi = "10.48550/arXiv.1509.07466"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160321-083901879,
    title = "Quantum XOR Games",
    journal = "ACM Transactions on Computation Theory",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160321-083901879",
    id = "record",
    issn = "1942-3454",
    doi = "10.1145/2799560",
    volume = "7"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150422-093309397,
    title = "A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians",
    journal = "Nature Physics",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150422-093309397",
    id = "record",
    issn = "1745-2473",
    doi = "10.1038/nphys3345",
    volume = "11"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150615-140934465,
    title = "A parallel repetition theorem for entangled projection games",
    journal = "Computational Complexity",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150615-140934465",
    id = "record",
    issn = "1016-3328",
    doi = "10.1007/s00037-015-0098-3",
    volume = "24"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150108-142044094,
    title = "Fully Device-Independent Quantum Key Distribution",
    journal = "Physical Review Letters",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150108-142044094",
    id = "record",
    issn = "0031-9007",
    doi = "10.1103/PhysRevLett.113.140501",
    volume = "113"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200731-152129927,
    title = "Efficient Rounding for the Noncommutative Grothendieck Inequality",
    journal = "Theory of Computing",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200731-152129927",
    id = "record",
    issn = "1557-2862",
    doi = "10.4086/toc.2014.v010a011",
    volume = "10"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160318-152323237,
    title = "Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms",
    journal = "Journal of Operator Theory",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-152323237",
    id = "record",
    issn = "1841-7744",
    doi = "10.7900/jot.2012jul02.1947",
    volume = "71"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160318-154623344,
    title = "Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games",
    journal = "Communications in Mathematical Physics",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-154623344",
    id = "record",
    issn = "0010-3616",
    doi = "10.1007/s00220-012-1642-5",
    volume = "321"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140910-135821275,
    title = "Guest Column: The Quantum PCP Conjecture",
    journal = "ACM SIGACT News",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-135821275",
    id = "record",
    issn = "0163-5700",
    doi = "10.1145/2491533.2491549",
    volume = "44"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140909-144447941,
    title = "Multipartite entanglement in XOR games",
    journal = "Quantum Information and Computation",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-144447941",
    id = "record",
    issn = "1533-7146",
    doi = "10.48550/arXiv.0911.4007",
    volume = "13"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160322-084353163,
    title = "Trevisan's Extractor in the Presence of Quantum Side Information",
    journal = "SIAM Journal on Computing",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160322-084353163",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/100813683",
    volume = "41"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200804-084834826,
    title = "Certifiable quantum dice",
    journal = "Philosophical Transactions A: Mathematical, Physical and Engineering Sciences",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200804-084834826",
    id = "record",
    issn = "1364-503X",
    doi = "10.1098/rsta.2011.0336",
    volume = "370"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200804-133447851,
    title = "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",
    journal = "Chicago Journal of Theoretical Computer Science",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200804-133447851",
    id = "record",
    issn = "1073-0486",
    doi = "10.4086/cjtcs.2012.001",
    volume = "18"
}


@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"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190320-104220786,
    title = "Optimal counterfeiting attacks and generalizations for Wiesner's quantum money",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-104220786",
    id = "record",
    doi = "10.48550/arXiv.1202.4010"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200728-153958382,
    title = "All Schatten spaces endowed with the Schur product are Q-algebras",
    journal = "Journal of Functional Analysis",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200728-153958382",
    id = "record",
    issn = "0022-1236",
    doi = "10.1016/j.jfa.2011.09.001",
    volume = "262"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190320-104707093,
    title = "Certifiable Quantum Dice - Or, testable exponential randomness expansion",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-104707093",
    id = "record",
    doi = "10.48550/arXiv.1111.6054"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160318-151328788,
    title = "Does Ignorance of the Whole Imply Ignorance of the Parts? Large Violations of Noncontextuality in Quantum Theory",
    journal = "Physical Review Letters",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-151328788",
    id = "record",
    issn = "0031-9007",
    doi = "10.1103/PhysRevLett.107.030402",
    volume = "107"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110713-155400829,
    title = "Entangled Games Are Hard to Approximate",
    journal = "SIAM Journal on Computing",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110713-155400829",
    id = "record",
    issn = "0097-5397",
    doi = "10.1137/090751293",
    volume = "40"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160318-115742532,
    title = "More nonlocality with less entanglement",
    journal = "Physical Review A",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160318-115742532",
    id = "record",
    issn = "1050-2947",
    doi = "10.1103/PhysRevA.83.052310",
    volume = "83"
}


@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"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190320-111726313,
    title = "Multiplayer XOR games and quantum communication complexity with clique-wise entanglement",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-111726313",
    id = "record",
    doi = "10.48550/arXiv.0911.4007v1"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200805-150138118,
    title = "Using Entanglement in Quantum Multi-Prover Interactive Proofs",
    journal = "Computational Complexity",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200805-150138118",
    id = "record",
    issn = "1016-3328",
    doi = "10.1007/s00037-009-0275-3",
    volume = "18"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190320-142201374,
    title = "Hauteur asymptotique des points de Heegner",
    journal = "Canadian Journal of Mathematics",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190320-142201374",
    id = "record",
    issn = "0008-414X",
    doi = "10.4153/CJM-2008-059-4",
    volume = "60"
}


@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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200804-103250325,
    title = "Sieve algorithms for the shortest vector problem are practical",
    journal = "Journal of Mathematical Cryptology",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200804-103250325",
    id = "record",
    issn = "1862-2976",
    doi = "10.1515/jmc.2008.009",
    volume = "2"
}


@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"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160322-085312434,
    title = "On the Power of Entangled Quantum Provers",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160322-085312434",
    id = "record",
    doi = "10.48550/arXiv.0612063"
}