{"id":"https://openalex.org/W4283368085","doi":"https://doi.org/10.1109/ismvl52857.2022.00012","title":"Quantum Algorithm for Maximum Satisfiability","display_name":"Quantum Algorithm for Maximum Satisfiability","alternate_titles":[],"publication_year":2022,"publication_date":"2022-05-01","ids":{"openalex":"https://openalex.org/W4283368085","doi":"https://doi.org/10.1109/ismvl52857.2022.00012"},"language":"en","primary_location":{"id":"doi:10.1109/ismvl52857.2022.00012","doi":"https://doi.org/10.1109/ismvl52857.2022.00012","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl52857.2022.00012","pdf_url":null,"source":{"id":"https://openalex.org/S4210220027","display_name":"IEEE International Symposium on Multiple-Valued Logic (ISMVL)","issn_l":"0195-623X","issn":["0195-623X","2378-2226"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W4283368085"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5006648488","display_name":"Abdirahman Alasow","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I126345244","display_name":"Portland State University","ror":"https://ror.org/00yn2fy02","country_code":"US","type":"education","lineage":["https://openalex.org/I126345244"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Abdirahman Alasow","raw_affiliation_strings":["Portland State University,Department of Electrical & Computer Engineering,Portland,OR,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Portland State University,Department of Electrical & Computer Engineering,Portland,OR,USA","institution_ids":["https://openalex.org/I126345244"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048693034","display_name":"Marek A. Perkowski","orcid":"https://orcid.org/0000-0002-0358-1176","observed_orcids":["https://orcid.org/0000-0002-0358-1176"]},"institutions":[{"id":"https://openalex.org/I126345244","display_name":"Portland State University","ror":"https://ror.org/00yn2fy02","country_code":"US","type":"education","lineage":["https://openalex.org/I126345244"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Marek Perkowski","raw_affiliation_strings":["Portland State University,Department of Electrical & Computer Engineering,Portland,OR,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Portland State University,Department of Electrical & Computer Engineering,Portland,OR,USA","institution_ids":["https://openalex.org/I126345244"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126345244"],"apc_list":null,"apc_paid":null,"fwci":0.7464,"has_fulltext":false,"cited_by_count":13,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.74865091,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"27","last_page":"34"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9994999766349792,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9994999766349792,"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":9.999999747378752e-05,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.0,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maxsat","display_name":"MaxSAT","score":0.972000002861023},{"id":"https://openalex.org/keywords/satisfiability","display_name":"satisfiability","score":0.8339999914169312},{"id":"https://openalex.org/keywords/boolean-functions","display_name":"Boolean functions","score":0.7770000100135803},{"id":"https://openalex.org/keywords/grover-s-algorithm","display_name":"Grover's algorithm","score":0.8629999756813049},{"id":"https://openalex.org/keywords/quantum-counter","display_name":"quantum counter","score":0.7210000157356262},{"id":"https://openalex.org/keywords/quantum-algorithms","display_name":"quantum algorithms","score":0.578000009059906},{"id":"https://openalex.org/keywords/unsatisfiable-formulas","display_name":"unsatisfiable formulas","score":0.6309999823570251}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6638498306274414},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6581529974937439},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6533042788505554},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6458655595779419},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6018236875534058},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5531983971595764},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.546195924282074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48417431116104126},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42997249960899353},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4226498603820801},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39864465594291687},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32259291410446167},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3204110562801361},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ismvl52857.2022.00012","doi":"https://doi.org/10.1109/ismvl52857.2022.00012","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl52857.2022.00012","pdf_url":null,"source":{"id":"https://openalex.org/S4210220027","display_name":"IEEE International Symposium on Multiple-Valued Logic (ISMVL)","issn_l":"0195-623X","issn":["0195-623X","2378-2226"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1531103278","https://openalex.org/W1545659679","https://openalex.org/W1793843726","https://openalex.org/W1833106254","https://openalex.org/W1985153141","https://openalex.org/W1994758055","https://openalex.org/W2003989103","https://openalex.org/W2024148935","https://openalex.org/W2025399946","https://openalex.org/W2036265926","https://openalex.org/W2036285035","https://openalex.org/W2057361103","https://openalex.org/W2060265333","https://openalex.org/W2068803869","https://openalex.org/W2090447085","https://openalex.org/W2102008187","https://openalex.org/W2149968564","https://openalex.org/W2158185647","https://openalex.org/W2158302200","https://openalex.org/W2170795408","https://openalex.org/W2253182477","https://openalex.org/W2415170901","https://openalex.org/W2434254232","https://openalex.org/W2747088929","https://openalex.org/W2764347725","https://openalex.org/W2945570796","https://openalex.org/W3038094279","https://openalex.org/W3041669599","https://openalex.org/W3209581202","https://openalex.org/W4206807714","https://openalex.org/W6912284476"],"related_works":["https://openalex.org/W4308517020","https://openalex.org/W6892918550","https://openalex.org/W6884931625","https://openalex.org/W4400513527","https://openalex.org/W2124209567","https://openalex.org/W2974006197","https://openalex.org/W4239758794","https://openalex.org/W1481200150","https://openalex.org/W3112462397","https://openalex.org/W6922344867"],"abstract_inverted_index":{"Satisfiability":[0],"(SAT)":[1],"problem":[2],"in":[3,96],"engineering":[4],"and":[5],"computer":[6],"science":[7],"is":[8,80],"to":[9,28],"find":[10],"the":[11,20,50,56,66,72,76,82,97],"set":[12],"of":[13,16,59],"assignment":[14],"values":[15,35],"input":[17],"variables":[18],"for":[19,49,65],"given":[21,77],"Boolean":[22,78],"function":[23,27,79],"that":[24,32,62],"evaluate":[25],"this":[26],"TRUE":[29],"or":[30],"prove":[31],"such":[33],"satisfying":[34],"do":[36],"not":[37],"exist.":[38],"For":[39],"POS":[40],"SAT":[41,83],"Problem,":[42],"we":[43],"propose":[44],"a":[45,90],"novel":[46],"quantum":[47,94],"algorithm":[48,88],"maximum":[51,57],"satisfiability":[52],"(MAX-SAT)":[53],"which":[54],"returns":[55],"number":[58],"OR":[60],"terms":[61],"are":[63],"satisfied":[64],"SAT-unsatisfiable":[67],"function,":[68],"providing":[69],"us":[70],"with":[71,89],"information":[73],"how":[74],"far":[75],"from":[81],"satisfaction.":[84],"We":[85],"use":[86],"Grover's":[87],"new":[91],"block":[92],"called":[93],"counter":[95],"oracle":[98],"circuit.":[99]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4283368085","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2022-06-25T00:00:00"}
