[
    {
        "id": "authors:r0cch-tzd63",
        "collection": "authors",
        "collection_id": "r0cch-tzd63",
        "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210921-144712064",
        "type": "article",
        "title": "A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device",
        "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 consider a new model for the testing of untrusted quantum devices, consisting of a single polynomial time bounded quantum device interacting with a classical polynomial time verifier. In this model, we propose solutions to two tasks\u2014a protocol for efficient classical verification that the untrusted device is \"truly quantum\" and a protocol for producing certifiable randomness from a single untrusted quantum device. Our solution relies on the existence of a new cryptographic primitive for constraining the power of an untrusted quantum device: post-quantum secure trapdoor claw-free functions that must satisfy an adaptive hardcore bit property. We show how to construct this primitive based on the hardness of the learning with errors (LWE) problem.",
        "doi": "10.1145/3441309",
        "issn": "0004-5411",
        "publisher": "Association for Computing Machinery",
        "publication": "Journal of the ACM",
        "publication_date": "2021-08",
        "series_number": "5",
        "volume": "68",
        "issue": "5",
        "pages": "Art. No. 31"
    },
    {
        "id": "authors:5xmdk-jwa42",
        "collection": "authors",
        "collection_id": "5xmdk-jwa42",
        "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200805-142950586",
        "type": "article",
        "title": "Rational approximations and quantum algorithms with postselection",
        "author": [
            {
                "family_name": "Mahadev",
                "given_name": "Urmila",
                "clpid": "Mahadev-Urmila"
            },
            {
                "family_name": "de Wolf",
                "given_name": "Ronald",
                "clpid": "de-Wolf-R"
            }
        ],
        "abstract": "We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using post-selection. We show that the minimal degree of the former equals (up to a factor of 2) the minimal query complexity of the latter. We give optimal (up to constant factors)\nquantum algorithms with postselection for the Majority function, slightly improving upon an earlier algorithm of Aaronson. Finally we show how Newman's classic theorem about low-degree rational approximation of the absolute-value function follows from these algorithms.",
        "doi": "10.48550/arXiv.1401.0912",
        "issn": "1533-7146",
        "publisher": "Rinton Press",
        "publication": "Quantum Information and Computation",
        "publication_date": "2015-03",
        "series_number": "3-4",
        "volume": "15",
        "issue": "3-4",
        "pages": "295-307"
    }
]