{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:08:50Z","timestamp":1773277730797,"version":"3.50.1"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2122793"],"award-info":[{"award-number":["2122793"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,19]]},"DOI":"10.1109\/hpec55821.2022.9926353","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T01:40:48Z","timestamp":1667526048000},"page":"1-8","source":"Crossref","is-referenced-by-count":9,"title":["Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation"],"prefix":"10.1109","author":[{"given":"Cameron","family":"Ibrahim","sequence":"first","affiliation":[{"name":"University of Delaware,Department of Computer and Information Sciences,Newark,DE,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danylo","family":"Lykov","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory,Computational Science Division,Argonne,IL,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zichang","family":"He","sequence":"additional","affiliation":[{"name":"Univcrsity of California Santa Barbara,Santa Barbara,California,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Alexeev","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory,Computational Science Division,Argonne,IL,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya","family":"Safro","sequence":"additional","affiliation":[{"name":"University of Delaware,Department of Computer and Information Sciences,Newark,DE,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639360"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.2.017001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34166-3_20"},{"key":"ref5","article-title":"Tensor networks in a nutshell","author":"Biamonte","year":"2017","journal-title":"arXiv preprint"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3748-6_1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11169-3_14"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/2200000059"},{"key":"ref9","volume-title":"Introduction To Algorithms","author":"Cormen","year":"2009"},{"key":"ref10","first-page":"30:1","article-title":"The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration","volume-title":"12th International Symposium on Parameter-ized and Exact Computation (IPEC 2017)","volume":"89","author":"Dell","year":"2018"},{"key":"ref11","article-title":"Efficient contraction of large tensor networks for weighted model counting through graph decompositions","author":"Dudek","year":"2019","journal-title":"arXiv preprint"},{"key":"ref12","article-title":"Tensornetwork for machine learning","author":"Efthymiou","year":"2019","journal-title":"arXiv preprint"},{"key":"ref13","article-title":"A quantum approximate optimization algorithm","author":"Farhi","year":"2014","journal-title":"arXiv preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(02)01336-5"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-03-15-410"},{"key":"ref16","author":"Gray","year":"2020","journal-title":"Cotengra"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3173045"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71351-7_21"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827500377733"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.01.059"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.21468\/SciPostPhys.7.5.060"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1195411"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3140190"},{"key":"ref24","volume-title":"QTensor","author":"Lykov","year":"2021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI51109.2021.00088"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/QCS54837.2021.00007"},{"key":"ref27","article-title":"Tensor network quantum simulator with step-dependent parallelization","author":"Lykov","year":"2020","journal-title":"arXiv preprint"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/050644756"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01409-4"},{"key":"ref30","article-title":"Parameterization of tensor network contraction","author":"O\u2019Gorman","year":"2019","journal-title":"arXiv preprint"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay009"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/100791142"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.10.004"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412232"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2670338"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2010.09.007"},{"key":"ref37","article-title":"High-quality hypergraph partitioning","author":"Schlag","year":"2021","journal-title":"arXiv preprint"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/17M1152735"},{"key":"ref39","first-page":"2:1","article-title":"Aggregative Coarsening for Multilevel Hypergraph Partitioning","volume-title":"17th Inter-national Symposium on Experimental Algorithms (SEA 2018)","volume":"103","author":"Shaydulin"},{"key":"ref40","article-title":"Computing tree decompositions with flowcutter: Pace 2017 submission","author":"Strasser","year":"2017","journal-title":"arXiv preprint"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0353-z"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3425607"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039525.80601.15"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1998037.1998053"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0080-2_10"}],"event":{"name":"2022 IEEE High Performance Extreme Computing Conference (HPEC)","location":"Waltham, MA, USA","start":{"date-parts":[[2022,9,19]]},"end":{"date-parts":[[2022,9,23]]}},"container-title":["2022 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9926284\/9926287\/09926353.pdf?arnumber=9926353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T05:32:48Z","timestamp":1706074368000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9926353\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/hpec55821.2022.9926353","relation":{},"subject":[],"published":{"date-parts":[[2022,9,19]]}}}