{"id":"https://openalex.org/W4308090279","doi":"https://doi.org/10.1109/hpec55821.2022.9926353","title":"Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation","display_name":"Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation","publication_year":2022,"publication_date":"2022-09-19","ids":{"openalex":"https://openalex.org/W4308090279","doi":"https://doi.org/10.1109/hpec55821.2022.9926353"},"language":"en","primary_location":{"id":"doi:10.1109/hpec55821.2022.9926353","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec55821.2022.9926353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE High Performance Extreme Computing Conference (HPEC)","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/A5039780422","display_name":"Cameron Ibrahim","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Cameron Ibrahim","raw_affiliation_strings":["University of Delaware,Department of Computer and Information Sciences,Newark,DE,USA","Department of Computer and Information Sciences, University of Delaware, Newark, DE, USA"],"affiliations":[{"raw_affiliation_string":"University of Delaware,Department of Computer and Information Sciences,Newark,DE,USA","institution_ids":["https://openalex.org/I86501945"]},{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001924527","display_name":"Danylo Lykov","orcid":"https://orcid.org/0000-0002-2979-2633"},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Danylo Lykov","raw_affiliation_strings":["Argonne National Laboratory,Computational Science Division,Argonne,IL,USA","Computational Science Division, Argonne National Laboratory, Argonne, IL, USA"],"affiliations":[{"raw_affiliation_string":"Argonne National Laboratory,Computational Science Division,Argonne,IL,USA","institution_ids":["https://openalex.org/I1282105669"]},{"raw_affiliation_string":"Computational Science Division, Argonne National Laboratory, Argonne, IL, USA","institution_ids":["https://openalex.org/I1282105669"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042541456","display_name":"Zichang He","orcid":"https://orcid.org/0000-0002-1723-6568"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zichang He","raw_affiliation_strings":["Univcrsity of California Santa Barbara,Santa Barbara,California,USA","Univcrsity of California Santa Barbara, Santa Barbara, California, USA"],"affiliations":[{"raw_affiliation_string":"Univcrsity of California Santa Barbara,Santa Barbara,California,USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Univcrsity of California Santa Barbara, Santa Barbara, California, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007973964","display_name":"Yuri Alexeev","orcid":"https://orcid.org/0000-0001-5066-2254"},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuri Alexeev","raw_affiliation_strings":["Argonne National Laboratory,Computational Science Division,Argonne,IL,USA","Computational Science Division, Argonne National Laboratory, Argonne, IL, USA"],"affiliations":[{"raw_affiliation_string":"Argonne National Laboratory,Computational Science Division,Argonne,IL,USA","institution_ids":["https://openalex.org/I1282105669"]},{"raw_affiliation_string":"Computational Science Division, Argonne National Laboratory, Argonne, IL, USA","institution_ids":["https://openalex.org/I1282105669"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057164472","display_name":"Ilya Safro","orcid":"https://orcid.org/0000-0001-6284-7408"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ilya Safro","raw_affiliation_strings":["University of Delaware,Department of Computer and Information Sciences,Newark,DE,USA","Department of Computer and Information Sciences, University of Delaware, Newark, DE, USA"],"affiliations":[{"raw_affiliation_string":"University of Delaware,Department of Computer and Information Sciences,Newark,DE,USA","institution_ids":["https://openalex.org/I86501945"]},{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5039780422"],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":2.2706,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.87902475,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9975000023841858,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9965000152587891,"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/T12303","display_name":"Tensor decomposition and applications","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7321923971176147},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6105010509490967},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.5743350982666016},{"id":"https://openalex.org/keywords/quantum-circuit","display_name":"Quantum circuit","score":0.5201426148414612},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.5102987289428711},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4813954830169678},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4584296941757202},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45391160249710083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4321417808532715},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4194965362548828},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40853574872016907},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.38158926367759705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2063584327697754},{"id":"https://openalex.org/keywords/quantum-network","display_name":"Quantum network","score":0.1638222336769104}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7321923971176147},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6105010509490967},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.5743350982666016},{"id":"https://openalex.org/C124148022","wikidata":"https://www.wikidata.org/wiki/Q2122210","display_name":"Quantum circuit","level":5,"score":0.5201426148414612},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.5102987289428711},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4813954830169678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4584296941757202},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45391160249710083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4321417808532715},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4194965362548828},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40853574872016907},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.38158926367759705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2063584327697754},{"id":"https://openalex.org/C186468114","wikidata":"https://www.wikidata.org/wiki/Q836478","display_name":"Quantum network","level":4,"score":0.1638222336769104},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec55821.2022.9926353","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec55821.2022.9926353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G5386731588","display_name":null,"funder_award_id":"2122793","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W678483","https://openalex.org/W1490949485","https://openalex.org/W1518639170","https://openalex.org/W1546413495","https://openalex.org/W1568345435","https://openalex.org/W1582752052","https://openalex.org/W1866618235","https://openalex.org/W1924728743","https://openalex.org/W1964212255","https://openalex.org/W1967320651","https://openalex.org/W2015925158","https://openalex.org/W2017553031","https://openalex.org/W2020378392","https://openalex.org/W2021547858","https://openalex.org/W2049820532","https://openalex.org/W2072969317","https://openalex.org/W2155463244","https://openalex.org/W2516041031","https://openalex.org/W2740579034","https://openalex.org/W2758747189","https://openalex.org/W2765457063","https://openalex.org/W2798663460","https://openalex.org/W2951542569","https://openalex.org/W2963352550","https://openalex.org/W2963741498","https://openalex.org/W2963809597","https://openalex.org/W2967195563","https://openalex.org/W2981590007","https://openalex.org/W2996023926","https://openalex.org/W3005044149","https://openalex.org/W3101642221","https://openalex.org/W3104844238","https://openalex.org/W3108106901","https://openalex.org/W3126986859","https://openalex.org/W3127043585","https://openalex.org/W3129777548","https://openalex.org/W3139424548","https://openalex.org/W3167683174","https://openalex.org/W3195667385","https://openalex.org/W4200337247","https://openalex.org/W4226435553","https://openalex.org/W4231846589","https://openalex.org/W4237881409","https://openalex.org/W4246219036","https://openalex.org/W4287557168","https://openalex.org/W4288345683","https://openalex.org/W6634007516","https://openalex.org/W6742048416","https://openalex.org/W6744606949","https://openalex.org/W6748317655","https://openalex.org/W6749359311","https://openalex.org/W6764213378","https://openalex.org/W6767103333","https://openalex.org/W6778973167","https://openalex.org/W6786652864","https://openalex.org/W6995630938"],"related_works":["https://openalex.org/W2783796426","https://openalex.org/W4200149527","https://openalex.org/W2991324428","https://openalex.org/W4379115997","https://openalex.org/W2792100442","https://openalex.org/W2997740458","https://openalex.org/W3092615945","https://openalex.org/W4284882292","https://openalex.org/W3133505863","https://openalex.org/W4318620911"],"abstract_inverted_index":{"One":[0],"of":[1,15,23,35,52,79,84,106,112,184,205],"the":[2,13,21,24,27,33,41,75,113,117],"key":[3],"problems":[4],"in":[5,32,49,61,93,177],"tensor":[6],"network":[7],"based":[8],"quantum":[9,178,207],"circuit":[10,179],"simulation":[11,42,180],"is":[12],"construction":[14],"a":[16,38,50,126,138,144,157,182,203],"contraction":[17,135,163,175],"tree":[18,136],"which":[19],"minimizes":[20],"cost":[22,28],"simulation,":[25],"where":[26],"can":[29,96],"be":[30,97],"expressed":[31],"number":[34],"operations":[36],"as":[37,56,156],"proxy":[39],"for":[40,116,131,159,162,173],"running":[43,119],"time.":[44,120],"This":[45],"same":[46,118],"problem":[47,81],"arises":[48],"variety":[51],"application":[53],"areas,":[54],"such":[55],"combinatorial":[57],"scientific":[58],"computing,":[59],"marginalization":[60],"probabilistic":[62],"graphical":[63],"models,":[64],"and":[65,88,146,152,194,213],"solving":[66],"constraint":[67],"satisfaction":[68],"problems.":[69],"In":[70],"this":[71,80,94],"paper,":[72],"we":[73,124,142,166],"reduce":[74],"computationally":[76],"hard":[77],"portion":[78],"to":[82,99,103],"one":[83],"graph":[85],"linear":[86,149],"ordering,":[87],"demonstrate":[89,153],"how":[90],"existing":[91,110],"approaches":[92],"area":[95],"utilized":[98],"achieve":[100],"results":[101,201],"up":[102],"several":[104],"orders":[105],"magnitude":[107],"better":[108],"than":[109],"state":[111],"art":[114],"methods":[115,172],"To":[121],"do":[122],"so,":[123],"introduce":[125,143],"novel":[127],"polynomial":[128],"time":[129],"algorithm":[130],"constructing":[132,174],"an":[133],"optimal":[134],"from":[137],"given":[139],"order.":[140],"Furthermore,":[141],"fast":[145],"high":[147],"quality":[148],"ordering":[150],"solver,":[151],"its":[154],"applicability":[155],"heuristic":[158],"providing":[160],"orderings":[161],"trees.":[164],"Finally,":[165],"compare":[167],"our":[168,197],"solver":[169],"with":[170],"competing":[171],"trees":[176],"on":[181,202],"collection":[183],"randomly":[185],"generated":[186],"Quantum":[187],"Approximate":[188],"Optimization":[189],"Algorithm":[190],"Max":[191],"Cut":[192],"circuits":[193],"show":[195],"that":[196],"method":[198],"achieves":[199],"superior":[200],"majority":[204],"tested":[206],"circuits.":[208],"Reproducibility:":[209],"Our":[210],"source":[211],"code":[212],"data":[214],"are":[215],"available":[216],"at":[217],"https://github.com/cameton/HPEC2022_ContractionTrees.":[218]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}