[
    {
        "id": "authors:4d0yn-88k35",
        "collection": "authors",
        "collection_id": "4d0yn-88k35",
        "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20221220-222320267",
        "type": "monograph",
        "title": "Efficient Certifiable Randomness from a Single Quantum Device",
        "author": [
            {
                "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": "Brakerski et. al [BCM+18] introduced the model of cryptographic testing of a single untrusted quantum device and gave a protocol for certifiable randomness generation. We use the leakage resilience properties of the Learning With Errors problem to address a key issue left open in previous work - the rate of generation of randomness. Our new protocol can certify \u03a9(n) fresh bits of randomness in constant rounds, where n is a parameter of the protocol and the total communication is O(n), thus achieving a nearly optimal rate. The proof that the output is statistically random is conceptually simple and technically elementary.",
        "doi": "10.48550/arXiv.2204.11353",
        "publisher": "arXiv",
        "publication_date": "2022-04-24"
    },
    {
        "id": "authors:bd8f9-z9x61",
        "collection": "authors",
        "collection_id": "bd8f9-z9x61",
        "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200805-141909801",
        "type": "monograph",
        "title": "Interactive Proofs for Quantum Computations",
        "author": [
            {
                "family_name": "Aharonov",
                "given_name": "Dorit",
                "clpid": "Aharonov-D"
            },
            {
                "family_name": "Ben-Or",
                "given_name": "Michael",
                "clpid": "Ben-Or-M"
            },
            {
                "family_name": "Eban",
                "given_name": "Elad",
                "clpid": "Eban-E"
            },
            {
                "family_name": "Mahadev",
                "given_name": "Urmila",
                "clpid": "Mahadev-Urmila"
            }
        ],
        "abstract": "The widely held belief that BQP strictly contains BPP raises fundamental questions: if we cannot efficiently compute predictions for the behavior of quantum systems, how can we test their behavior? In other words, is quantum mechanics falsifiable? In cryptographic settings, how can a customer of a future untrusted quantum computing company be convinced of the correctness of its quantum computations? To provide answers to these questions, we define Quantum Prover Interactive Proofs (QPIP). Whereas in standard interactive proofs the prover is computationally unbounded, here our prover is in BQP, representing a quantum computer. The verifier models our current computational capabilities: it is a BPP machine, with access to only a few qubits. Our main theorem states, roughly: 'Any language in BQP has a QPIP, which also hides the computation from the prover'. We provide two proofs, one based on a quantum authentication scheme (QAS) relying on random Clifford rotations and the other based on a QAS which uses polynomial codes (BOCG+ 06), combined with secure multiparty computation methods.\nThis is the journal version of work reported in 2008 (ABOE08) and presented in ICS 2010; here we have completed the details and made the proofs rigorous. Some of the proofs required major modifications and corrections. Notably, the claim that the polynomial QPIP is fault tolerant was removed. Similar results (with different protocols) were reported independently around the same time of the original version in BFK08. The initial independent works (ABOE08, BFK08) ignited a long line of research of blind verifiable quantum computation, which we survey here, along with connections to various cryptographic problems. Importantly, the problems of making the results fault tolerant as well as removing the need for quantum communication altogether remain open.",
        "doi": "10.48550/arXiv.1704.04487",
        "publisher": "arXiv",
        "publication_date": "2017-04-14"
    }
]