{"id":"https://openalex.org/W4414210459","doi":"https://doi.org/10.1145/3731545.3744151","title":"Quantum-Based SMT Solving for String Theory","display_name":"Quantum-Based SMT Solving for String Theory","publication_year":2025,"publication_date":"2025-07-20","ids":{"openalex":"https://openalex.org/W4414210459","doi":"https://doi.org/10.1145/3731545.3744151"},"language":"en","primary_location":{"id":"doi:10.1145/3731545.3744151","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3731545.3744151","pdf_url":null,"source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3731545.3744151","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003772299","display_name":"Beatrice Casey","orcid":"https://orcid.org/0009-0001-0097-2120"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Beatrice Casey","raw_affiliation_strings":["University of Notre Dame, South Bend, Indiana, USA"],"affiliations":[{"raw_affiliation_string":"University of Notre Dame, South Bend, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043541139","display_name":"Joanna C. S. Santos","orcid":"https://orcid.org/0000-0001-8743-2516"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joanna C. S. Santos","raw_affiliation_strings":["University of Notre Dame, South Bend, Indiana, USA"],"affiliations":[{"raw_affiliation_string":"University of Notre Dame, South Bend, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5093240754","display_name":"Andrew Hennessee","orcid":"https://orcid.org/0009-0002-2189-7497"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Hennessee","raw_affiliation_strings":["University of Notre Dame, South Bend, Indiana, USA"],"affiliations":[{"raw_affiliation_string":"University of Notre Dame, South Bend, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003772299"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13501789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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.9975000023841858,"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.9975000023841858,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9495000243186951,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9086999893188477,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7265999913215637},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5116000175476074},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.47940000891685486},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.44589999318122864},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.42489999532699585},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.40450000762939453},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.39320001006126404},{"id":"https://openalex.org/keywords/quantum-annealing","display_name":"Quantum annealing","score":0.32409998774528503}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7265999913215637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5314000248908997},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5242999792098999},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5116000175476074},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.47940000891685486},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.44589999318122864},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.42489999532699585},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.39320001006126404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37540000677108765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3564999997615814},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.32409998774528503},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.32280001044273376},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3181000053882599},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C49987212","wikidata":"https://www.wikidata.org/wiki/Q33198","display_name":"String theory","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C137002209","wikidata":"https://www.wikidata.org/wiki/Q898521","display_name":"Hidden variable theory","level":3,"score":0.26910001039505005},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.2667999863624573},{"id":"https://openalex.org/C22820288","wikidata":"https://www.wikidata.org/wiki/Q9050568","display_name":"String metric","level":4,"score":0.26170000433921814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2599000036716461},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3731545.3744151","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3731545.3744151","pdf_url":null,"source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3731545.3744151","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3731545.3744151","pdf_url":null,"source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W100961009","https://openalex.org/W1484620082","https://openalex.org/W1593793497","https://openalex.org/W1639713563","https://openalex.org/W2055381325","https://openalex.org/W2128543030","https://openalex.org/W2330747214","https://openalex.org/W2619162220","https://openalex.org/W2782836179","https://openalex.org/W2803691889","https://openalex.org/W2912640545","https://openalex.org/W3036296765","https://openalex.org/W3049414011","https://openalex.org/W3108273660","https://openalex.org/W4238262801","https://openalex.org/W4242746603","https://openalex.org/W4254561751","https://openalex.org/W4300336259","https://openalex.org/W4301488821","https://openalex.org/W4308683072","https://openalex.org/W4320582989","https://openalex.org/W4322628972","https://openalex.org/W4327810950","https://openalex.org/W4360106633","https://openalex.org/W4382766256","https://openalex.org/W4383879098","https://openalex.org/W4392148005","https://openalex.org/W4392877631","https://openalex.org/W4399109442","https://openalex.org/W4406262305","https://openalex.org/W4406698716"],"related_works":[],"abstract_inverted_index":{"Satisfiability":[0],"Modulo":[1],"Theory":[2],"(SMT)":[3],"solvers":[4,38,52],"are":[5,33],"a":[6,14,58,84,88,101],"useful":[7],"tool":[8],"that":[9,122],"can":[10],"be":[11],"applied":[12],"to":[13,39,55,68,86,126,131],"variety":[15],"of":[16,77],"problems,":[17],"such":[18],"as":[19,41],"configuring":[20],"relationships":[21],"in":[22],"distributed":[23],"systems,":[24],"detecting":[25],"race":[26],"conditions,":[27],"and":[28,112,133],"program":[29],"analysis.":[30],"String":[31],"constraints":[32,62,130],"particularly":[34],"difficult":[35],"for":[36,60,105,136],"SMT":[37,51,103],"navigate,":[40],"the":[42,70,75],"search":[43,90],"space":[44,91],"is":[45,124],"generally":[46],"large.":[47],"Often":[48],"times,":[49],"classical":[50],"will":[53],"have":[54],"quit":[56],"generating":[57],"solution":[59],"string":[61,106,129],"because":[63],"it":[64,123],"takes":[65],"too":[66],"long":[67],"find":[69],"solution.":[71],"Quantum":[72],"computing":[73],"offers":[74],"advantages":[76],"quantum":[78,110],"mechanics":[79],"(e.g.,":[80],"superposition),":[81],"which":[82],"allows":[83],"system":[85],"explore":[87,99],"large":[89],"much":[92],"more":[93],"efficiently.":[94],"In":[95],"this":[96],"work,":[97],"we":[98],"creating":[100],"quantum-enabled":[102],"solver":[104],"theory":[107],"by":[108],"using":[109],"annealing":[111],"Quadratic":[113],"Unconstrained":[114],"Binary":[115],"Optimization":[116],"(QUBO).":[117],"Our":[118],"preliminary":[119],"results":[120],"demonstrate":[121],"feasible":[125],"transform":[127],"these":[128],"QUBO,":[132],"generate":[134],"solutions":[135],"given":[137],"constraints.":[138]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}