[
    {
        "id": "authors:53pwq-zng55",
        "collection": "authors",
        "collection_id": "53pwq-zng55",
        "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200805-133628530",
        "type": "book_section",
        "title": "Classical Homomorphic Encryption for Quantum Circuits",
        "book_title": "2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)",
        "author": [
            {
                "family_name": "Mahadev",
                "given_name": "Urmila",
                "clpid": "Mahadev-Urmila"
            }
        ],
        "abstract": "We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys. The scheme allows a classical client to blindly delegate a quantum computation to a quantum server: an honest server is able to run the computation while a malicious server is unable to learn any information about the computation. We show that it is possible to construct such a scheme directly from a quantum secure classical homomorphic encryption scheme with certain properties. Finally, we show that a classical homomorphic encryption scheme with the required properties can be constructed from the learning with errors problem.",
        "doi": "10.1109/focs.2018.00039",
        "isbn": "9781538642306",
        "publisher": "IEEE",
        "place_of_publication": "Piscataway, NJ",
        "publication_date": "2018-10",
        "pages": "332-338"
    },
    {
        "id": "authors:54rbf-hkb86",
        "collection": "authors",
        "collection_id": "54rbf-hkb86",
        "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229032",
        "type": "book_section",
        "title": "A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device",
        "book_title": "2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)",
        "author": [
            {
                "family_name": "Brakerski",
                "given_name": "Zvika",
                "clpid": "Brakerski-Zvika"
            },
            {
                "family_name": "Christiano",
                "given_name": "Paul",
                "clpid": "Christiano-Paul"
            },
            {
                "family_name": "Mahadev",
                "given_name": "Urmila",
                "clpid": "Mahadev-Urmila"
            },
            {
                "family_name": "Vazirani",
                "given_name": "Umesh",
                "clpid": "Vazirani-Umesh-V"
            },
            {
                "family_name": "Vidick",
                "given_name": "Thomas",
                "orcid": "0000-0002-6405-365X",
                "clpid": "Vidick-T"
            }
        ],
        "abstract": "We give a protocol for producing certifiable randomness from a single untrusted quantum device that is polynomial-time bounded. The randomness is certified to be statistically close to uniform from the point of view of any computationally unbounded quantum adversary, that may share entanglement with the quantum device. The protocol relies on the existence of post-quantum secure trapdoor claw-free functions, and introduces a new primitive for constraining the power of an untrusted quantum device. We then show how to construct this primitive based on the hardness of the learning with errors (LWE) problem. The randomness protocol can also be used as the basis for an efficiently verifiable \"quantum supremacy\" proposal, thus answering an outstanding challenge in the field.",
        "doi": "10.1109/focs.2018.00038",
        "isbn": "9781538642306",
        "publisher": "IEEE",
        "place_of_publication": "Piscataway, NJ",
        "publication_date": "2018-10",
        "pages": "320-331"
    },
    {
        "id": "authors:bcz19-xa962",
        "collection": "authors",
        "collection_id": "bcz19-xa962",
        "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200805-144416533",
        "type": "book_section",
        "title": "Classical Verification of Quantum Computations",
        "book_title": "2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)",
        "author": [
            {
                "family_name": "Mahadev",
                "given_name": "Urmila",
                "clpid": "Mahadev-Urmila"
            }
        ],
        "abstract": "We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum prover as a trusted measurement device. The protocol forces the prover to behave as follows: the prover must construct an n qubit state of his choice, measure each qubit in the Hadamard or standard basis as directed by the verifier, and report the measurement results to the verifier. The soundness of this protocol is enforced based on the assumption that the learning with errors problem is computationally intractable for efficient quantum machines.",
        "doi": "10.1109/focs.2018.00033",
        "isbn": "9781538642306",
        "publisher": "IEEE",
        "place_of_publication": "Piscataway, NJ",
        "publication_date": "2018-10",
        "pages": "259-267"
    }
]