{"id":"https://openalex.org/W2038709177","doi":"https://doi.org/10.1109/afrcon.2013.6757630","title":"A compact and efficient SAT encoding for quantum circuits","display_name":"A compact and efficient SAT encoding for quantum circuits","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2038709177","doi":"https://doi.org/10.1109/afrcon.2013.6757630","mag":"2038709177"},"language":"en","primary_location":{"id":"doi:10.1109/afrcon.2013.6757630","is_oa":false,"landing_page_url":"https://doi.org/10.1109/afrcon.2013.6757630","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Africon","raw_type":"proceedings-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/A5004214923","display_name":"Robert Wille","orcid":"https://orcid.org/0000-0002-4993-7860"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Robert Wille","raw_affiliation_strings":["Institute of Computer Science, University of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078994159","display_name":"Nils Przigoda","orcid":"https://orcid.org/0000-0001-8947-3282"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nils Przigoda","raw_affiliation_strings":["Institute of Computer Science, University of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071742136","display_name":"Rolf Drechsler","orcid":"https://orcid.org/0000-0002-9872-1740"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Drechsler","raw_affiliation_strings":["Institute of Computer Science, University of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004214923"],"corresponding_institution_ids":["https://openalex.org/I180437899"],"apc_list":null,"apc_paid":null,"fwci":0.9885,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.82444495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"1855","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9998999834060669,"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.9998999834060669,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"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/encoding","display_name":"Encoding (memory)","score":0.6662675738334656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.627585768699646},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5977961421012878},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5779944062232971},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.5497801303863525},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.5222154855728149},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5014023780822754},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4993264675140381},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46473953127861023},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.45433714985847473},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4233930706977844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3131920099258423},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.270242840051651},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.22924521565437317},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21746522188186646},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12099647521972656},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.10943511128425598}],"concepts":[{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6662675738334656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.627585768699646},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5977961421012878},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5779944062232971},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.5497801303863525},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.5222154855728149},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5014023780822754},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4993264675140381},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46473953127861023},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.45433714985847473},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4233930706977844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3131920099258423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.270242840051651},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.22924521565437317},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21746522188186646},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12099647521972656},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.10943511128425598},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/afrcon.2013.6757630","is_oa":false,"landing_page_url":"https://doi.org/10.1109/afrcon.2013.6757630","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Africon","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.398.9762","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.9762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-bremen.de/agra/doc/konf/13_africon_sat_encoding_quantum_circuits.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W113418608","https://openalex.org/W1552215881","https://openalex.org/W1579437898","https://openalex.org/W1814068099","https://openalex.org/W1868653600","https://openalex.org/W2024148935","https://openalex.org/W2036265926","https://openalex.org/W2040497903","https://openalex.org/W2084652510","https://openalex.org/W2092494161","https://openalex.org/W2101498028","https://openalex.org/W2106215532","https://openalex.org/W2109676928","https://openalex.org/W2110711640","https://openalex.org/W2114638353","https://openalex.org/W2121695129","https://openalex.org/W2130753923","https://openalex.org/W2132833274","https://openalex.org/W2133527541","https://openalex.org/W2137035823","https://openalex.org/W2159226773","https://openalex.org/W2160444875","https://openalex.org/W2168676717","https://openalex.org/W2169468177","https://openalex.org/W2764347725","https://openalex.org/W2949516668","https://openalex.org/W3144070277","https://openalex.org/W4241233758","https://openalex.org/W4243399171","https://openalex.org/W4245630182","https://openalex.org/W4251211631","https://openalex.org/W6604659970","https://openalex.org/W6634743126","https://openalex.org/W6639335807","https://openalex.org/W6656304258","https://openalex.org/W6675412767","https://openalex.org/W6677366832","https://openalex.org/W6679878532"],"related_works":["https://openalex.org/W2728195892","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W1597080238","https://openalex.org/W3151473321","https://openalex.org/W2060407451","https://openalex.org/W3204916073","https://openalex.org/W2516690985","https://openalex.org/W2078076811","https://openalex.org/W1998291836"],"abstract_inverted_index":{"Promising":[0],"applications":[1],"of":[2,8,34,89],"quantum":[3,26,64,85],"computation":[4],"motivated":[5],"the":[6,21,90],"consideration":[7],"corresponding":[9],"design":[10,39],"methods":[11],"for":[12,63],"this":[13,53,71],"emerging":[14],"technology.":[15],"Here,":[16],"researchers":[17],"are":[18],"faced":[19],"with":[20],"problem":[22],"that":[23,66],"signals":[24],"in":[25],"circuits":[27,65],"may":[28],"(theoretically)":[29],"assume":[30],"an":[31,80],"infinite":[32],"number":[33],"states.":[35,86],"As":[36],"a":[37,57,73,96],"consequence,":[38],"approaches":[40],"based":[41],"on":[42,83],"Boolean":[43],"satisfiability":[44],"(SAT)":[45],"were":[46],"subject":[47],"to":[48],"restrictions":[49],"so":[50],"far.":[51],"In":[52],"work,":[54],"we":[55],"propose":[56],"compact":[58],"and":[59],"efficient":[60],"SAT":[61],"encoding":[62,91],"loses":[67],"these":[68],"restrictions.":[69],"For":[70],"purpose,":[72],"structural":[74],"analysis":[75],"is":[76,92],"introduced":[77],"which":[78],"determines":[79],"upper":[81],"bound":[82],"possible":[84],"The":[87],"applicability":[88],"exemplarily":[93],"demonstrated":[94],"by":[95],"SAT-based":[97],"equivalence":[98],"checker.":[99]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}