{"id":"https://openalex.org/W7164153920","doi":"https://doi.org/10.48550/arxiv.2606.10408","title":"A Modular Approach to Succinct Arguments for QMA","display_name":"A Modular Approach to Succinct Arguments for QMA","publication_year":2026,"publication_date":"2026-06-03","ids":{"openalex":"https://openalex.org/W7164153920","doi":"https://doi.org/10.48550/arxiv.2606.10408"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.10408","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.10408","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.10408","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008375381","display_name":"James Bartusek","orcid":"https://orcid.org/0009-0000-9020-3589"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bartusek, James","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138363741","display_name":"Jiahui Liu (724342)","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Jiahui","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007500399","display_name":"Giulio Malavolta","orcid":"https://orcid.org/0009-0009-9737-0094"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Malavolta, Giulio","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9521999955177307,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9521999955177307,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.011900000274181366,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.008700000122189522,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.560699999332428},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.5220000147819519},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4555000066757202},{"id":"https://openalex.org/keywords/learning-with-errors","display_name":"Learning with errors","score":0.43309998512268066},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.42329999804496765},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4214000105857849},{"id":"https://openalex.org/keywords/cryptographic-primitive","display_name":"Cryptographic primitive","score":0.41769999265670776},{"id":"https://openalex.org/keywords/zero-knowledge-proof","display_name":"Zero-knowledge proof","score":0.4011000096797943}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6014999747276306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.569599986076355},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.560699999332428},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.5220000147819519},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4555000066757202},{"id":"https://openalex.org/C2779014939","wikidata":"https://www.wikidata.org/wiki/Q6510239","display_name":"Learning with errors","level":3,"score":0.43309998512268066},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.42329999804496765},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4214000105857849},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.41769999265670776},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.4011000096797943},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.38960000872612},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.33970001339912415},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3382999897003174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32690000534057617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32269999384880066},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3125},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.3066999912261963},{"id":"https://openalex.org/C94966114","wikidata":"https://www.wikidata.org/wiki/Q29256","display_name":"Black box","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C91399829","wikidata":"https://www.wikidata.org/wiki/Q1115684","display_name":"Commitment scheme","level":3,"score":0.29420000314712524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2915000021457672},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.28949999809265137},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.10408","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.10408","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.10408","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.10408","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4062253534793854}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Succinct":[0],"argument":[1,38,156,181],"systems":[2],"are":[3],"of":[4,14,57,79,110,119,146,167,190,228,232,244,251],"central":[5],"importance":[6],"to":[7],"modern":[8],"crytpography,":[9],"enabling":[10],"the":[11,18,48,55,75,90,107,117,143,152,165,188,214,229],"efficient":[12],"verification":[13],"computational":[15],"claims.":[16],"In":[17,47,97,148],"classical":[19],"setting,":[20,50],"Kilian":[21],"(STOC":[22],"92)":[23],"established":[24,54],"that":[25,65,93,105],"any":[26,206],"probabilistically":[27],"checkable":[28],"proof":[29],"for":[30,40,61,95,113,158,183,223],"NP":[31,41],"can":[32,130],"be":[33,131,250],"transformed":[34],"into":[35,210],"a":[36,102,178,195,238],"succinct":[37,59,111],"system":[39,157,182],"using":[42],"only":[43,186],"collision-resistant":[44],"hash":[45,141,203],"functions.":[46],"quantum":[49,144,239],"recent":[51],"works":[52],"have":[53],"feasibility":[56],"(classically-verifiable)":[58],"arguments":[60,112],"QMA,":[62],"capturing":[63],"statements":[64],"require":[66],"*quantum*":[67],"proofs.":[68],"However,":[69],"known":[70],"constructions":[71],"all":[72],"rely":[73,163],"on":[74,164,187],"highly":[76],"structured":[77],"assumption":[78,189],"learning":[80],"with":[81,89],"errors":[82],"(LWE),":[83],"which":[84,127,160,213],"stands":[85],"in":[86,128,172,212],"stark":[87],"contrast":[88],"unstructured":[91],"assumptions":[92],"suffice":[94],"NP.":[96],"this":[98],"work,":[99],"we":[100,150,176,193],"develop":[101],"new":[103],"framework":[104],"broadens":[106],"cryptographic":[108],"foundations":[109],"QMA.":[114],"We":[115],"assume":[116],"existence":[118],"(i)":[120],"an":[121],"oblivious":[122],"state":[123],"preparation":[124],"(OSP)":[125],"protocol,":[126],"turn":[129],"constructed":[132],"from":[133],"*plain*":[134],"trapdoor":[135],"claw-free":[136],"functions,":[137,142,204],"and":[138,248],"(ii)":[139],"collapsing":[140,202],"analogue":[145],"collision-resistance.":[147],"particular,":[149],"obtain":[151],"first":[153],"succinct,":[154],"classically-verifiable":[155,180],"QMA":[159,184],"does":[161],"not":[162],"hardness":[166],"LWE.":[168],"Our":[169,235],"construction":[170],"proceeds":[171],"two":[173],"steps.":[174],"First,":[175],"design":[177],"*round-efficient*":[179],"based":[185],"OSP.":[191],"Second,":[192],"introduce":[194],"*generalized":[196],"communication":[197,215,241],"compression":[198,242],"compiler*,":[199],"which,":[200],"assuming":[201],"transforms":[205],"$T$-round":[207],"interactive":[208],"protocol":[209],"one":[211],"size":[216,231],"is":[217],"bounded":[218],"by":[219],"$T":[220],"\\cdot":[221],"\\poly(\\secp)$":[222],"some":[224],"fixed":[225],"$\\poly$":[226],"independent":[227,252],"original":[230],"each":[233],"message.":[234],"compiler":[236],"extends":[237],"rigidity-based":[240],"technique":[243],"Zhang":[245],"(QCrypt":[246],"25),":[247],"may":[249],"interest.":[253]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-11T00:00:00"}