{"id":"https://openalex.org/W3001128677","doi":"https://doi.org/10.1088/2632-2153/ab94c5","title":"Algorithms for tensor network contraction ordering","display_name":"Algorithms for tensor network contraction ordering","publication_year":2020,"publication_date":"2020-05-20","ids":{"openalex":"https://openalex.org/W3001128677","doi":"https://doi.org/10.1088/2632-2153/ab94c5","mag":"3001128677"},"language":"en","primary_location":{"id":"doi:10.1088/2632-2153/ab94c5","is_oa":true,"landing_page_url":"https://doi.org/10.1088/2632-2153/ab94c5","pdf_url":"https://iopscience.iop.org/article/10.1088/2632-2153/ab94c5/pdf","source":{"id":"https://openalex.org/S4210200687","display_name":"Machine Learning Science and Technology","issn_l":"2632-2153","issn":["2632-2153"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320083","host_organization_name":"IOP Publishing","host_organization_lineage":["https://openalex.org/P4310320083","https://openalex.org/P4310311669"],"host_organization_lineage_names":["IOP Publishing","Institute of Physics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning: Science and Technology","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://iopscience.iop.org/article/10.1088/2632-2153/ab94c5/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Frank Schindler","orcid":"https://orcid.org/0000-0001-8113-0998"},"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"]},{"id":"https://openalex.org/I202697423","display_name":"University of Zurich","ror":"https://ror.org/02crff812","country_code":"CH","type":"education","lineage":["https://openalex.org/I202697423"]}],"countries":["CH","US"],"is_corresponding":true,"raw_author_name":"Frank Schindler","raw_affiliation_strings":["Department of Physics, University of Zurich, Winterthurerstrasse 190, 8057 Zurich, Switzerland","Kavli Institute for Theoretical Physics, University of California, Santa Barbara, CA 93106, United States of America"],"raw_orcid":"https://orcid.org/0000-0001-8113-0998","affiliations":[{"raw_affiliation_string":"Department of Physics, University of Zurich, Winterthurerstrasse 190, 8057 Zurich, Switzerland","institution_ids":["https://openalex.org/I202697423"]},{"raw_affiliation_string":"Kavli Institute for Theoretical Physics, University of California, Santa Barbara, CA 93106, United States of America","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":null,"display_name":"Adam S Jermyn","orcid":null},"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"]},{"id":"https://openalex.org/I4210153546","display_name":"Flatiron Health (United States)","ror":"https://ror.org/0508h6p74","country_code":"US","type":"company","lineage":["https://openalex.org/I4210153546"]},{"id":"https://openalex.org/I4387153999","display_name":"Flatiron Institute","ror":"https://ror.org/00sekdz59","country_code":null,"type":"nonprofit","lineage":["https://openalex.org/I4210107338","https://openalex.org/I4387153999"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Adam S Jermyn","raw_affiliation_strings":["Center for Computational Astrophysics, Flatiron Institute, New York, NY 10010, United States of America","Kavli Institute for Theoretical Physics, University of California, Santa Barbara, CA 93106, United States of America"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Computational Astrophysics, Flatiron Institute, New York, NY 10010, United States of America","institution_ids":["https://openalex.org/I4210153546","https://openalex.org/I4387153999"]},{"raw_affiliation_string":"Kavli Institute for Theoretical Physics, University of California, Santa Barbara, CA 93106, United States of America","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154570441","https://openalex.org/I202697423","https://openalex.org/I4210153546","https://openalex.org/I4387153999"],"apc_list":{"value":1600,"currency":"GBP","value_usd":1962},"apc_paid":{"value":1600,"currency":"GBP","value_usd":1962},"fwci":0.544,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7241052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"1","issue":"3","first_page":"035001","last_page":"035001"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.5296000242233276,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.5296000242233276,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.08869999647140503,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.042899999767541885,"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/contraction","display_name":"Contraction (grammar)","score":0.6208000183105469},{"id":"https://openalex.org/keywords/tensor-decomposition","display_name":"Tensor decomposition","score":0.5034999847412109},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.4672999978065491},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4277999997138977},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.4196999967098236},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37959998846054077},{"id":"https://openalex.org/keywords/edge-contraction","display_name":"Edge contraction","score":0.36899998784065247},{"id":"https://openalex.org/keywords/structure-tensor","display_name":"Structure tensor","score":0.36239999532699585}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6449000239372253},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.6208000183105469},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5260999798774719},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.5034999847412109},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.4672999978065491},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4277999997138977},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.4196999967098236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4178999960422516},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37959998846054077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36910000443458557},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.36899998784065247},{"id":"https://openalex.org/C113315163","wikidata":"https://www.wikidata.org/wiki/Q7625159","display_name":"Structure tensor","level":3,"score":0.36239999532699585},{"id":"https://openalex.org/C124007464","wikidata":"https://www.wikidata.org/wiki/Q428091","display_name":"Tensor contraction","level":3,"score":0.3596000075340271},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3327000141143799},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2736000120639801},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25429999828338623}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1088/2632-2153/ab94c5","is_oa":true,"landing_page_url":"https://doi.org/10.1088/2632-2153/ab94c5","pdf_url":"https://iopscience.iop.org/article/10.1088/2632-2153/ab94c5/pdf","source":{"id":"https://openalex.org/S4210200687","display_name":"Machine Learning Science and Technology","issn_l":"2632-2153","issn":["2632-2153"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320083","host_organization_name":"IOP Publishing","host_organization_lineage":["https://openalex.org/P4310320083","https://openalex.org/P4310311669"],"host_organization_lineage_names":["IOP Publishing","Institute of Physics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning: Science and Technology","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2001.08063","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.08063","pdf_url":"https://arxiv.org/pdf/2001.08063","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:spiral.imperial.ac.uk:10044/1/105854","is_oa":true,"landing_page_url":"http://hdl.handle.net/10044/1/105854","pdf_url":null,"source":{"id":"https://openalex.org/S4306401396","display_name":"Spiral (Imperial College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I47508984","host_organization_name":"Imperial College London","host_organization_lineage":["https://openalex.org/I47508984"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"13","raw_type":"Journal Article"}],"best_oa_location":{"id":"doi:10.1088/2632-2153/ab94c5","is_oa":true,"landing_page_url":"https://doi.org/10.1088/2632-2153/ab94c5","pdf_url":"https://iopscience.iop.org/article/10.1088/2632-2153/ab94c5/pdf","source":{"id":"https://openalex.org/S4210200687","display_name":"Machine Learning Science and Technology","issn_l":"2632-2153","issn":["2632-2153"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320083","host_organization_name":"IOP Publishing","host_organization_lineage":["https://openalex.org/P4310320083","https://openalex.org/P4310311669"],"host_organization_lineage_names":["IOP Publishing","Institute of Physics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning: Science and Technology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2500807902","display_name":null,"funder_award_id":"PHY-1748958","funder_id":"https://openalex.org/F4320306202","funder_display_name":"Gordon and Betty Moore Foundation"},{"id":"https://openalex.org/G30288699","display_name":null,"funder_award_id":"PHY-1748958","funder_id":"https://openalex.org/F4320306164","funder_display_name":"Simons Foundation"},{"id":"https://openalex.org/G421350782","display_name":null,"funder_award_id":"200021_169061","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G6829851928","display_name":null,"funder_award_id":"GBMF7392","funder_id":"https://openalex.org/F4320306202","funder_display_name":"Gordon and Betty Moore Foundation"},{"id":"https://openalex.org/G8497063558","display_name":null,"funder_award_id":"1748958","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"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320306202","display_name":"Gordon and Betty Moore Foundation","ror":"https://ror.org/006wxqw41"},{"id":"https://openalex.org/F4320314817","display_name":"Heising-Simons Foundation","ror":"https://ror.org/01mp52y34"},{"id":"https://openalex.org/F4320319356","display_name":"Flatiron Health","ror":"https://ror.org/0508h6p74"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3001128677.pdf","grobid_xml":"https://content.openalex.org/works/W3001128677.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1930886120","https://openalex.org/W1975277392","https://openalex.org/W2010492822","https://openalex.org/W2017393964","https://openalex.org/W2033368244","https://openalex.org/W2037465995","https://openalex.org/W2037768897","https://openalex.org/W2047995930","https://openalex.org/W2048364886","https://openalex.org/W2093135480","https://openalex.org/W2109626307","https://openalex.org/W2128319993","https://openalex.org/W2141096552","https://openalex.org/W2224517465","https://openalex.org/W2326740504","https://openalex.org/W2754727929","https://openalex.org/W2755790032","https://openalex.org/W2759786117","https://openalex.org/W2772568612","https://openalex.org/W2810421208","https://openalex.org/W2826166138","https://openalex.org/W2922105745","https://openalex.org/W2988096545","https://openalex.org/W4245236715"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Contracting":[1],"tensor":[2,52,92,116],"networks":[3],"is":[4],"often":[5],"computationally":[6,55],"demanding.":[7],"Well-designed":[8],"contraction":[9,15,64,123,142],"sequences":[10,124],"can":[11],"dramatically":[12],"reduce":[13],"the":[14,19,45,62,86,97,121,133,141],"cost.":[16],"We":[17,36,94,119],"explore":[18],"performance":[20,39],"of":[21,44,88,128],"simulated":[22],"annealing":[23],"and":[24,81,125],"genetic":[25],"algorithms,":[26],"two":[27],"common":[28],"discrete":[29],"optimization":[30],"techniques,":[31],"to":[32],"this":[33],"ordering":[34],"problem.":[35],"benchmark":[37],"their":[38],"as":[40,42],"well":[41],"that":[43,96,113],"commonly-used":[46],"greedy":[47,104],"search":[48,105],"on":[49],"physically":[50],"relevant":[51],"networks.":[53,93],"Where":[54],"feasible,":[56],"we":[57,72,99],"also":[58],"compare":[59,120],"them":[60],"with":[61,77,110,115,132],"optimal":[63],"sequence":[65],"obtained":[66,122],"by":[67],"an":[68,111],"exhaustive":[69],"search.":[70],"Furthermore,":[71],"present":[73],"a":[74,103],"systematic":[75],"comparison":[76],"state-of-the-art":[78],"tree":[79],"decomposition":[80],"graph":[82,91],"partitioning":[83],"algorithms":[84,98,136],"in":[85,140],"context":[87],"random":[89],"regular":[90],"find":[95],"consider":[100],"consistently":[101],"outperform":[102],"given":[106],"equal":[107],"computational":[108],"resources,":[109],"advantage":[112],"scales":[114],"network":[117],"size.":[118],"identify":[126],"signs":[127],"highly":[129],"non-local":[130],"optimization,":[131],"more":[134],"sophisticated":[135],"sacrificing":[137],"run-time":[138],"early":[139],"for":[143],"better":[144],"overall":[145],"performance.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2020-01-30T00:00:00"}