{"id":"https://openalex.org/W7213222986","doi":"https://doi.org/10.48550/arxiv.2609.14110","title":"Torsion detection in clique complexes is conditionally $QMA_1$-hard","display_name":"Torsion detection in clique complexes is conditionally $QMA_1$-hard","publication_year":2026,"publication_date":"2026-09-12","ids":{"openalex":"https://openalex.org/W7213222986","doi":"https://doi.org/10.48550/arxiv.2609.14110"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.14110","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.14110","pdf_url":"https://arxiv.org/pdf/2609.14110","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.14110","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5116129232","display_name":"Adam Weso\u0142owski","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Weso\u0142owski, Adam","raw_affiliation_strings":["Department of Computer Science , University of Oxford , Parks Rd , Oxford OX1 3QG , United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Oxford , Parks Rd , Oxford OX1 3QG , United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5116129232"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.6128000020980835,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.6128000020980835,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.2712000012397766,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.02969999983906746,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/clique-complexes","display_name":"clique complexes","score":0.996999979019165},{"id":"https://openalex.org/keywords/quantum-computational-complexity","display_name":"quantum computational complexity","score":0.5320000052452087},{"id":"https://openalex.org/keywords/betti-numbers","display_name":"Betti numbers","score":0.6899999976158142},{"id":"https://openalex.org/keywords/integral-homology","display_name":"integral homology","score":0.7910000085830688},{"id":"https://openalex.org/keywords/combinatorial-laplacian","display_name":"combinatorial Laplacian","score":0.871999979019165},{"id":"https://openalex.org/keywords/spectral-gap","display_name":"spectral gap","score":0.7770000100135803},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.824999988079071},{"id":"https://openalex.org/keywords/topological-data-analysis","display_name":"topological data analysis","score":0.8450000286102295},{"id":"https://openalex.org/keywords/quantum-algorithms","display_name":"quantum algorithms","score":0.4230000078678131}],"concepts":[{"id":"https://openalex.org/C129621563","wikidata":"https://www.wikidata.org/wiki/Q429593","display_name":"Betti number","level":2,"score":0.8413000106811523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8051000237464905},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5656999945640564},{"id":"https://openalex.org/C165525559","wikidata":"https://www.wikidata.org/wiki/Q224180","display_name":"Homology (biology)","level":3,"score":0.5354999899864197},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C77461463","wikidata":"https://www.wikidata.org/wiki/Q7827201","display_name":"Torsion (gastropod)","level":2,"score":0.4309999942779541},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.4278999865055084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4104999899864197},{"id":"https://openalex.org/C2874115","wikidata":"https://www.wikidata.org/wiki/Q17099562","display_name":"Persistent homology","level":2,"score":0.39719998836517334},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C2776477805","wikidata":"https://www.wikidata.org/wiki/Q4460773","display_name":"Topological data analysis","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.27219998836517334},{"id":"https://openalex.org/C118539577","wikidata":"https://www.wikidata.org/wiki/Q3402784","display_name":"Combinatorial proof","level":2,"score":0.2621000111103058}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.14110","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.14110","pdf_url":"https://arxiv.org/pdf/2609.14110","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.14110","doi":"https://doi.org/10.48550/arxiv.2609.14110","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.14110","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,"listed_in":[],"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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.14110","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.14110","pdf_url":"https://arxiv.org/pdf/2609.14110","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213222986.pdf","grobid_xml":"https://content.openalex.org/works/W7213222986.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1529512952","https://openalex.org/W2951324796","https://openalex.org/W2962381467","https://openalex.org/W3173190396","https://openalex.org/W3189824049","https://openalex.org/W4297411649","https://openalex.org/W4384613953","https://openalex.org/W4404312875","https://openalex.org/W4404321698","https://openalex.org/W7118000755","https://openalex.org/W7167579568"],"related_works":["https://openalex.org/W7214165147","https://openalex.org/W4389217288","https://openalex.org/W4404848713","https://openalex.org/W7215124689","https://openalex.org/W7220475945","https://openalex.org/W7213174689","https://openalex.org/W7172542560","https://openalex.org/W7118000755","https://openalex.org/W4404312875","https://openalex.org/W4320477825"],"abstract_inverted_index":{"Quantum":[0],"algorithms":[1],"for":[2,108],"topological":[3],"data":[4],"analysis":[5],"compute":[6],"Betti":[7,34,132],"numbers,":[8],"the":[9,12,25,62,104,109,126,135],"ranks":[10],"of":[11,15,27,36,111,125,134,166],"homology":[13,72,147,185],"groups":[14],"a":[16,28,33,37,48,87,91,96,121,154,173],"simplicial":[17],"complex,":[18],"which":[19],"can":[20],"be":[21],"read":[22],"off":[23],"from":[24],"kernel":[26],"combinatorial":[29,151],"Laplacian.":[30],"Deciding":[31],"whether":[32],"number":[35,133],"clique":[38,119,164,184],"complex":[39,120],"is":[40,42,73,169,180],"nonzero":[41],"$QMA_1$-hard,":[43],"and":[44,149,177],"remains":[45],"so":[46],"under":[47,172],"spectral":[49,156],"gap":[50,175],"promise":[51],"on":[52],"vertex-weighted":[53],"graphs.":[54],"Integral":[55],"homology,":[56],"however,":[57],"contains":[58],"information":[59],"inaccessible":[60],"to":[61,102,116],"Laplacian":[63,152],"spectrum.":[64],"A":[65],"new":[66],"part":[67],"that":[68,76,99,160,178],"appears":[69],"in":[70,86,163],"integral":[71],"\\emph{torsion}:":[74],"cycles":[75],"become":[77],"boundaries":[78],"only":[79],"after":[80],"being":[81],"traversed":[82],"several":[83],"times,":[84],"as":[85,139],"projective":[88,127],"plane":[89],"or":[90],"Klein":[92],"bottle.":[93],"We":[94,114,158],"provide":[95],"simple":[97],"reduction":[98],"allows":[100],"us":[101],"establish":[103],"first":[105],"hardness":[106],"results":[107],"problem":[110],"detecting":[112,161],"torsion.":[113],"attach":[115],"an":[117],"arbitrary":[118],"fixed":[122],"$31$-vertex":[123],"triangulation":[124],"plane.":[128],"The":[129],"$k$th":[130],"mod-$2$":[131,183],"input":[136],"then":[137],"reappears":[138],"$2$-torsion":[140],"two":[141],"degrees":[142],"up,":[143],"while":[144],"all":[145],"rational":[146],"disappears":[148],"every":[150],"acquires":[153],"constant":[155,174],"gap.":[157],"conclude":[159],"torsion":[162],"complexes":[165],"\\emph{unweighted}":[167],"graphs":[168],"$NP$-hard,":[170],"even":[171],"promise,":[176],"it":[179],"$QMA_1$-hard":[181],"if":[182],"is.":[186]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-16T00:00:00"}