{"id":"https://openalex.org/W2346855750","doi":"https://doi.org/10.1145/2869073","title":"Computational Complexity of Quantum Satisfiability","display_name":"Computational Complexity of Quantum Satisfiability","publication_year":2016,"publication_date":"2016-05-04","ids":{"openalex":"https://openalex.org/W2346855750","doi":"https://doi.org/10.1145/2869073","mag":"2346855750"},"language":"en","primary_location":{"id":"doi:10.1145/2869073","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2869073","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073850637","display_name":"Christian Herrmann","orcid":"https://orcid.org/0000-0003-4190-2361"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christian Herrmann","raw_affiliation_strings":["TU Darmstadt and KAIST, Darmstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Darmstadt and KAIST, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101546631","display_name":"Martin Ziegler","orcid":"https://orcid.org/0000-0001-6734-7875"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Martin Ziegler","raw_affiliation_strings":["TU Darmstadt and KAIST, Daejeon, Rep. of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Darmstadt and KAIST, Daejeon, Rep. of Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073850637"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":2.5232,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.90026146,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"63","issue":"2","first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9991999864578247,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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/mathematics","display_name":"Mathematics","score":0.6239986419677734},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.578995943069458},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5752413272857666},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5572818517684937},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5259699821472168},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5174015760421753},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4307734966278076},{"id":"https://openalex.org/keywords/noncommutative-geometry","display_name":"Noncommutative geometry","score":0.42032191157341003},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.38995981216430664},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32419925928115845},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1755644679069519},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12466707825660706}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6239986419677734},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.578995943069458},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5752413272857666},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5572818517684937},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5259699821472168},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5174015760421753},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4307734966278076},{"id":"https://openalex.org/C68797384","wikidata":"https://www.wikidata.org/wiki/Q2746792","display_name":"Noncommutative geometry","level":2,"score":0.42032191157341003},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38995981216430664},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32419925928115845},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1755644679069519},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12466707825660706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2869073","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2869073","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6800000071525574,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":106,"referenced_works":["https://openalex.org/W64656188","https://openalex.org/W74084275","https://openalex.org/W122853693","https://openalex.org/W136633354","https://openalex.org/W585473508","https://openalex.org/W615160778","https://openalex.org/W631485345","https://openalex.org/W1483607134","https://openalex.org/W1485087398","https://openalex.org/W1497846389","https://openalex.org/W1504635498","https://openalex.org/W1512472103","https://openalex.org/W1516641390","https://openalex.org/W1520357716","https://openalex.org/W1524878283","https://openalex.org/W1532974880","https://openalex.org/W1549008998","https://openalex.org/W1550331971","https://openalex.org/W1553142094","https://openalex.org/W1573997330","https://openalex.org/W1574151794","https://openalex.org/W1576854535","https://openalex.org/W1734944212","https://openalex.org/W1855403548","https://openalex.org/W1951559054","https://openalex.org/W1966302993","https://openalex.org/W1967479370","https://openalex.org/W1968204692","https://openalex.org/W1968206655","https://openalex.org/W1968542832","https://openalex.org/W1969758885","https://openalex.org/W1979304146","https://openalex.org/W1985108987","https://openalex.org/W1991813962","https://openalex.org/W1992189249","https://openalex.org/W2005115893","https://openalex.org/W2006066414","https://openalex.org/W2006912660","https://openalex.org/W2011039300","https://openalex.org/W2013504313","https://openalex.org/W2015479921","https://openalex.org/W2023648368","https://openalex.org/W2031859062","https://openalex.org/W2034310947","https://openalex.org/W2036265926","https://openalex.org/W2040721698","https://openalex.org/W2044413922","https://openalex.org/W2045027298","https://openalex.org/W2048353152","https://openalex.org/W2050813033","https://openalex.org/W2053273487","https://openalex.org/W2054144396","https://openalex.org/W2055415340","https://openalex.org/W2056774713","https://openalex.org/W2059913973","https://openalex.org/W2062251184","https://openalex.org/W2063191044","https://openalex.org/W2064463780","https://openalex.org/W2067754486","https://openalex.org/W2071846104","https://openalex.org/W2076493281","https://openalex.org/W2082774629","https://openalex.org/W2086901897","https://openalex.org/W2087392392","https://openalex.org/W2087997688","https://openalex.org/W2088141885","https://openalex.org/W2096478770","https://openalex.org/W2101230787","https://openalex.org/W2102074804","https://openalex.org/W2102688174","https://openalex.org/W2103843044","https://openalex.org/W2111235650","https://openalex.org/W2120852349","https://openalex.org/W2125463200","https://openalex.org/W2130164058","https://openalex.org/W2131283815","https://openalex.org/W2131662609","https://openalex.org/W2134709850","https://openalex.org/W2136302685","https://openalex.org/W2137852732","https://openalex.org/W2139230981","https://openalex.org/W2146421423","https://openalex.org/W2149906774","https://openalex.org/W2160987528","https://openalex.org/W2166566648","https://openalex.org/W2176308528","https://openalex.org/W2298896018","https://openalex.org/W2308254067","https://openalex.org/W2319466955","https://openalex.org/W2326943468","https://openalex.org/W2327946179","https://openalex.org/W2330548796","https://openalex.org/W2499594374","https://openalex.org/W2742693919","https://openalex.org/W2799061192","https://openalex.org/W2971330320","https://openalex.org/W3040499212","https://openalex.org/W3103102948","https://openalex.org/W3126996113","https://openalex.org/W3149604617","https://openalex.org/W3152126650","https://openalex.org/W4205147424","https://openalex.org/W4231681807","https://openalex.org/W4233283946","https://openalex.org/W4241108585","https://openalex.org/W6967339396"],"related_works":["https://openalex.org/W2150583165","https://openalex.org/W2618109676","https://openalex.org/W2034701711","https://openalex.org/W2963458865","https://openalex.org/W1880816751","https://openalex.org/W4234189135","https://openalex.org/W2024994589","https://openalex.org/W2125536734","https://openalex.org/W70814323","https://openalex.org/W1629505938"],"abstract_inverted_index":{"We":[0,60],"connect":[1],"both":[2,80,104,124],"discrete":[3],"and":[4,26,64,90,126,131,214],"algebraic":[5],"complexity":[6,129],"theory":[7],"with":[8,47,53,93,144],"the":[9,35,42,57,62,99,110,133,151,190,200,220,230],"satisfiability":[10,66,158,208,216],"problem":[11,67],"in":[12,21,41,77,148,173,179,182,222],"certain":[13],"non-Boolean":[14],"lattices.":[15],"Specifically,":[16],"quantum":[17,39,69],"logic":[18,50,70],"was":[19],"introduced":[20],"1936":[22],"by":[23],"Garrett":[24],"Birkhoff":[25],"John":[27],"von":[28],"Neumann":[29],"as":[30,226],"a":[31,120],"framework":[32],"for":[33,68,109],"capturing":[34],"logical":[36],"peculiarities":[37],"of":[38,115,138,159,168,189,202,232],"observables:":[40],"1D":[43],"case":[44,192,201],"it":[45],"coincides":[46],"Boolean":[48],"propositional":[49,71],"but,":[51],"starting":[52],"dimension":[54,78],"two,":[55,79],"violates":[56],"distributive":[58],"law.":[59],"introduce":[61],"weak":[63,207],"strong":[65,157,215],"formulae.":[72],"It":[73],"turns":[74,224],"out":[75,225],"that":[76,167],"are":[81],"also":[82],"NP":[83,141,212],"--complete.":[84],"For":[85],"higher-dimensional":[86],"spaces":[87],"\u211d":[88,142],"d":[89,92,94,184],"\u2102":[91],"\u2265":[95,185],"3":[96],"fixed,":[97],"on":[98,123],"other":[100],"hand,":[101],"we":[102,196],"show":[103],"problems":[105,139],"to":[106,150,198,211,229],"be":[107,177],"complete":[108],"nondeterministic":[111],"Blum-Shub-Smale":[112],"(BSS)":[113],"model":[114],"real":[116,127],"computation.":[117],"This":[118],"provides":[119],"unified":[121],"view":[122],"Turing":[125],"BSS":[128],"theory,":[130],"extends":[132],"(still":[134],"relatively":[135],"scarce)":[136],"list":[137],"established":[140],"--complete":[143],"one,":[145],"perhaps,":[146],"closest":[147],"spirit":[149],"classical":[152],"Cook-Levin":[153],"Theorem.":[154],"More":[155],"precisely,":[156],"\u2227":[160,162,169],"\u2228":[161],"--terms":[163],"is":[164,217],"complete,":[165],"while":[166],"\u2228--terms":[170],"(i.e.,":[171],"those":[172],"conjunctive":[174],"form)":[175],"can":[176],"decided":[178],"polynomial":[180,235],"time":[181],"dimensions":[183],"2.":[186],"The":[187],"decidability":[188],"infinite-dimensional":[191],"being":[193],"still":[194,209,218],"open,":[195],"proceed":[197],"investigate":[199],"indefinite":[203],"finite":[204],"dimensions.":[205],"Here,":[206],"belongs":[210],"R":[213],"hard;":[219],"latter,":[221],"fact,":[223],"polynomial-time":[227],"equivalent":[228],"feasibility":[231],"noncommutative":[233],"integer":[234],"equations":[236],"over":[237],"matrix":[238],"rings.":[239]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-11T08:15:01.531666","created_date":"2025-10-10T00:00:00"}