[
    {
        "id": "thesis:18792",
        "collection": "thesis",
        "collection_id": "18792",
        "cite_using_url": "https://resolver.caltech.edu/CaltechTHESIS:06042026-205016029",
        "primary_object_url": {
            "basename": "mints_mikhail_2026.pdf",
            "content": "final",
            "filesize": 535176,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/18792/1/mints_mikhail_2026.pdf",
            "version": "v2.0.0"
        },
        "type": "thesis",
        "title": "The Quantum Overlap Gap Property and Algorithmic Hardness for the Quantum Hypergraph Max-Cut Problem",
        "author": [
            {
                "family_name": "Mints",
                "given_name": "Mikhail",
                "orcid": "0009-0004-4508-353X",
                "clpid": "Mints-Mikhail"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Preskill",
                "given_name": "John P.",
                "orcid": "0000-0002-2421-4762",
                "clpid": "Preskill-J"
            },
            {
                "family_name": "Anschuetz",
                "given_name": "Eric R.",
                "orcid": "0000-0002-9825-3692",
                "clpid": "Anschuetz-Eric-R"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "None",
                "given_name": "None"
            }
        ],
        "local_group": [
            {
                "literal": "Institute for Quantum Information and Matter"
            },
            {
                "literal": "div_eng"
            },
            {
                "literal": "div_pma"
            }
        ],
        "abstract": "In this work, we analyze the average-case hardness of the Quantum Hypergraph Max-Cut problem using the theoretical framework of the Quantum Overlap Gap Property (QOGP). We establish two main results: a weak hardness result for a wide class of stable quantum algorithms, and a strong hardness result for a much more restricted class of local quantum algorithms. We apply these results to establish concrete conditions under which known quantum algorithms fail to produce near-optimal solutions for this problem.",
        "doi": "10.7907/tgg7-nh54",
        "publication_date": "2026",
        "thesis_type": "senior_major",
        "thesis_year": "2026"
    }
]