{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T12:05:37Z","timestamp":1774958737301,"version":"3.50.1"},"reference-count":28,"publisher":"The Open Journal","issue":"119","license":[{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JOSS"],"published-print":{"date-parts":[[2026,3,31]]},"DOI":"10.21105\/joss.09886","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:25:25Z","timestamp":1774956325000},"page":"9886","source":"Crossref","is-referenced-by-count":0,"title":["OMEinsumContractionOrders: A Julia package for tensor network contraction order optimization"],"prefix":"10.21105","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1635-2679","authenticated-orcid":false,"given":"Jin-Guo","family":"Liu","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology (Guangzhou), China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuanzhao","family":"Gao","sequence":"additional","affiliation":[{"name":"Center of Computational Mathematics, Flatiron Institute, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Samuelson","sequence":"additional","affiliation":[{"name":"University of Florida, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"8722","reference":[{"key":"bezanson2012julia","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1209.5145","article-title":"Julia: A fast dynamic language for technical computing","author":"Bezanson","year":"2012","unstructured":"Bezanson, J., Karpinski, S., Shah, V. B., & Edelman, A. (2012). Julia: A fast dynamic language for technical computing. arXiv Preprint arXiv:1209.5145. https:\/\/doi.org\/10.48550\/arXiv.1209.5145","journal-title":"arXiv preprint arXiv:1209.5145"},{"issue":"3","key":"Pan2021","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.128.030501","article-title":"Simulating the Sycamore quantum supremacy circuits","volume":"128","author":"Pan","year":"2022","unstructured":"Pan, F., & Zhang, P. (2022). Simulating the Sycamore quantum supremacy circuits. Physical Review Letters, 128(3), 030501. https:\/\/doi.org\/10.1103\/PhysRevLett.128.030501","journal-title":"Physical Review Letters"},{"key":"Gray2021","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-03-15-410","article-title":"Hyper-optimized tensor network contraction","volume":"5","author":"Gray","year":"2021","unstructured":"Gray, J., & Kourtis, S. (2021). Hyper-optimized tensor network contraction. Quantum, 5, 410. https:\/\/doi.org\/10.22331\/q-2021-03-15-410","journal-title":"Quantum","ISSN":"https:\/\/id.crossref.org\/issn\/2521-327X","issn-type":"print"},{"key":"Kalachev2021","article-title":"Recursive multi-tensor contraction for XEB verification of quantum circuits","author":"Kalachev","year":"2021","unstructured":"Kalachev, G., Panteleev, P., & Yung, M.-H. (2021). Recursive multi-tensor contraction for XEB verification of quantum circuits. arXiv Preprint arXiv:2108.05665. https:\/\/arxiv.org\/abs\/2108.05665","journal-title":"arXiv preprint arXiv:2108.05665"},{"key":"Bishop2006","volume-title":"Pattern recognition and machine learning","author":"Bishop","year":"2006","unstructured":"Bishop, C. M. (2006). Pattern recognition and machine learning. Springer."},{"issue":"3","key":"Markov2008","doi-asserted-by":"publisher","DOI":"10.1137\/050644756","article-title":"Simulating quantum computation by contracting tensor networks","volume":"38","author":"Markov","year":"2008","unstructured":"Markov, I. L., & Shi, Y. (2008). Simulating quantum computation by contracting tensor networks. SIAM Journal on Computing, 38(3), 963\u2013981. https:\/\/doi.org\/10.1137\/050644756","journal-title":"SIAM Journal on Computing","ISSN":"https:\/\/id.crossref.org\/issn\/0097-5397","issn-type":"print"},{"key":"Qing2024","doi-asserted-by":"publisher","DOI":"10.34133\/icomputing.0123","article-title":"Compressing neural networks using tensor networks with exponentially fewer variational parameters","volume":"4","author":"Qing","year":"2025","unstructured":"Qing, Y., Li, K., Zhou, P.-F., & Ran, S.-J. (2025). Compressing neural networks using tensor networks with exponentially fewer variational parameters. Intelligent Computing, 4, 0123. https:\/\/doi.org\/10.34133\/icomputing.0123","journal-title":"Intelligent Computing"},{"key":"Haegeman2016","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.94.165116","article-title":"Unifying time evolution and optimization with matrix product states","author":"Haegeman","year":"2016","unstructured":"Haegeman, J., Lubich, C., Oseledets, I., Vandereycken, B., & Verstraete, F. (2016). Unifying time evolution and optimization with matrix product states. Physical Review B. https:\/\/doi.org\/10.1103\/PhysRevB.94.165116","journal-title":"Physical Review B"},{"issue":"7825","key":"Harris2020","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-2649-2","article-title":"Array programming with NumPy","volume":"585","author":"Harris","year":"2020","unstructured":"Harris, C. R., Millman, K. J., van der Walt, S. J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N. J., Kern, R., Picus, M., Hoyer, S., van Kerkwijk, M. H., Brett, M., Haldane, A., del R\u00edo, J. F., Wiebe, M., Peterson, P., \u2026 Oliphant, T. E. (2020). Array programming with NumPy. Nature, 585(7825), 357\u2013362. https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nature","ISSN":"https:\/\/id.crossref.org\/issn\/1476-4687","issn-type":"print"},{"key":"Villescas2023","doi-asserted-by":"publisher","DOI":"10.1109\/CSCE60160.2023.00025","article-title":"Scaling probabilistic inference through message contraction optimization","author":"Villescas","year":"2023","unstructured":"Villescas, M. R., Liu, J.-G., Wijnings, P. W. A., Stuijk, S., & Corporaal, H. (2023). Scaling probabilistic inference through message contraction optimization. 2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE), 123\u2013130. https:\/\/doi.org\/10.1109\/CSCE60160.2023.00025","journal-title":"2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE)"},{"issue":"3","key":"Roa2024","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.6.033261","article-title":"Probabilistic inference in the era of tensor networks and differential programming","volume":"6","author":"Roa-Villescas","year":"2024","unstructured":"Roa-Villescas, M., Gao, X., Stuijk, S., Corporaal, H., & Liu, J.-G. (2024). Probabilistic inference in the era of tensor networks and differential programming. Physical Review Research, 6(3), 033261. https:\/\/doi.org\/10.1103\/PhysRevResearch.6.033261","journal-title":"Physical Review Research","ISSN":"https:\/\/id.crossref.org\/issn\/2643-1564","issn-type":"print"},{"issue":"4","key":"Piveteau2024","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.5.040303","article-title":"Tensor-network decoding beyond 2D","volume":"5","author":"Piveteau","year":"2024","unstructured":"Piveteau, C., Chubb, C. T., & Renes, J. M. (2024). Tensor-network decoding beyond 2D. PRX Quantum, 5(4), 040303. https:\/\/doi.org\/10.1103\/PRXQuantum.5.040303","journal-title":"PRX Quantum"},{"issue":"3","key":"Liu2023","doi-asserted-by":"publisher","DOI":"10.1137\/22m1501787","article-title":"Computing solution space properties of combinatorial optimization problems via generic tensor networks","volume":"45","author":"Liu","year":"2023","unstructured":"Liu, J.-G., Gao, X., Cain, M., Lukin, M. D., & Wang, S.-T. (2023). Computing solution space properties of combinatorial optimization problems via generic tensor networks. SIAM Journal on Scientific Computing, 45(3), A1239\u2013A1270. https:\/\/doi.org\/10.1137\/22m1501787","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"1","key":"Bouchitte2001","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539799359683","article-title":"Treewidth and minimum fill-in: Grouping the minimal separators","volume":"31","author":"Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9, V., & Todinca, I. (2001). Treewidth and minimum fill-in: Grouping the minimal separators. SIAM Journal on Computing, 31(1), 212\u2013232. https:\/\/doi.org\/10.1137\/s0097539799359683","journal-title":"SIAM Journal on Computing"},{"key":"Luo2020","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-10-11-341","article-title":"Yao.jl: Extensible, efficient framework for quantum algorithm design","volume":"4","author":"Luo","year":"2020","unstructured":"Luo, X.-Z., Liu, J.-G., Zhang, P., & Wang, L. (2020). Yao.jl: Extensible, efficient framework for quantum algorithm design. Quantum, 4, 341. https:\/\/doi.org\/10.22331\/q-2020-10-11-341","journal-title":"Quantum"},{"issue":"90","key":"Roa2023","doi-asserted-by":"publisher","DOI":"10.21105\/joss.05700","article-title":"TensorInference: A Julia package for tensor-based probabilistic inference","volume":"8","author":"Roa-Villescas","year":"2023","unstructured":"Roa-Villescas, M., & Liu, J.-G. (2023). TensorInference: A Julia package for tensor-based probabilistic inference. Journal of Open Source Software, 8(90), 5700. https:\/\/doi.org\/10.21105\/joss.05700","journal-title":"Journal of Open Source Software"},{"issue":"4","key":"Magron2021","doi-asserted-by":"publisher","DOI":"10.1145\/3618299","article-title":"TSSOS: A Julia library to exploit sparsity for large-scale polynomial optimization","volume":"49","author":"Magron","year":"2023","unstructured":"Magron, V., & Wang, J. (2023). TSSOS: A Julia library to exploit sparsity for large-scale polynomial optimization. ACM Transactions on Mathematical Software, 49(4), 1\u201331. https:\/\/doi.org\/10.1145\/3618299","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CliqueTrees2025","article-title":"CliqueTrees.jl: A Julia library for computing tree decompositions and chordal completions of graphs","author":"Samuelson","year":"2025","unstructured":"Samuelson, R., & Fairbanks, J. (2025). CliqueTrees.jl: A Julia library for computing tree decompositions and chordal completions of graphs. https:\/\/github.com\/AlgebraicJulia\/CliqueTrees.jl"},{"key":"Ng2014","article-title":"Fast implementation of the minimum local fill ordering heuristic","author":"Ng","year":"2014","unstructured":"Ng, E. G., & Peyton, B. W. (2014). Fast implementation of the minimum local fill ordering heuristic. CSC14: The Sixth SIAM Workshop on Combinatorial Scientific Computing, 4. https:\/\/doi.org\/10.1137\/070680680","journal-title":"CSC14: The sixth SIAM workshop on combinatorial scientific computing"},{"issue":"2","key":"Liu1985","doi-asserted-by":"publisher","DOI":"10.1145\/214392.214398","article-title":"Modification of the minimum-degree algorithm by multiple elimination","volume":"11","author":"Liu","year":"1985","unstructured":"Liu, J. W. (1985). Modification of the minimum-degree algorithm by multiple elimination. ACM Transactions on Mathematical Software (TOMS), 11(2), 141\u2013153. https:\/\/doi.org\/10.1145\/214392.214398","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"issue":"3","key":"Rothberg1998","doi-asserted-by":"publisher","DOI":"10.1137\/s0895479896302692","article-title":"Node selection strategies for bottom-up sparse matrix ordering","volume":"19","author":"Rothberg","year":"1998","unstructured":"Rothberg, E., & Eisenstat, S. C. (1998). Node selection strategies for bottom-up sparse matrix ordering. SIAM Journal on Matrix Analysis and Applications, 19(3), 682\u2013695. https:\/\/doi.org\/10.1137\/s0895479896302692","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"7779","key":"Arute2019","doi-asserted-by":"crossref","DOI":"10.1038\/s41586-019-1666-5","article-title":"Quantum supremacy using a programmable superconducting processor","volume":"574","author":"Arute","year":"2019","unstructured":"Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G., Buell, D. A., & others. (2019). Quantum supremacy using a programmable superconducting processor. Nature, 574(7779), 505\u2013510. https:\/\/www.nature.com\/articles\/s41586-019-1666-5","journal-title":"Nature"},{"issue":"1","key":"Gao2024crossentropy","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.5.010334","article-title":"Limitations of linear cross-entropy as a measure for quantum advantage","volume":"5","author":"Gao","year":"2024","unstructured":"Gao, X., Kalinowski, M., Chou, C.-N., Lukin, M. D., Barak, B., & Choi, S. (2024). Limitations of linear cross-entropy as a measure for quantum advantage. PRX Quantum, 5(1), 010334. https:\/\/doi.org\/10.1103\/PRXQuantum.5.010334","journal-title":"PRX Quantum"},{"issue":"6598","key":"Ebadi2022","doi-asserted-by":"publisher","DOI":"10.1126\/science.abo6587","article-title":"Quantum optimization of maximum independent set using Rydberg atom arrays","volume":"376","author":"Ebadi","year":"2022","unstructured":"Ebadi, S., Keesling, A., Cain, M., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., & others. (2022). Quantum optimization of maximum independent set using Rydberg atom arrays. Science, 376(6598), 1209\u20131215. https:\/\/doi.org\/10.1126\/science.abo6587","journal-title":"Science"},{"key":"ITensor","doi-asserted-by":"publisher","DOI":"10.21468\/SciPostPhysCodeb.4","article-title":"The ITensor software library for tensor network calculations","author":"Fishman","year":"2022","unstructured":"Fishman, M., White, S. R., & Stoudenmire, E. M. (2022). The ITensor software library for tensor network calculations. SciPost Phys. Codebases, 4. https:\/\/doi.org\/10.21468\/SciPostPhysCodeb.4","journal-title":"SciPost Phys. Codebases"},{"issue":"26","key":"Smith2018","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00753","article-title":"opt_einsum - a Python package for optimizing contraction order for einsum-like expressions","volume":"3","author":"Smith","year":"2018","unstructured":"Smith, D. G. A., & Gray, J. (2018). opt_einsum - a Python package for optimizing contraction order for einsum-like expressions. Journal of Open Source Software, 3(26), 753. https:\/\/doi.org\/10.21105\/joss.00753","journal-title":"Journal of Open Source Software"},{"issue":"29","key":"Gray2018","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00819","article-title":"quimb: A Python package for quantum information and many-body calculations","volume":"3","author":"Gray","year":"2018","unstructured":"Gray, J. (2018). quimb: A Python package for quantum information and many-body calculations. Journal of Open Source Software, 3(29), 819. https:\/\/doi.org\/10.21105\/joss.00819","journal-title":"Journal of Open Source Software"},{"key":"TensorOperations","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.3245496","article-title":"TensorOperations.jl","author":"Devos","year":"2023","unstructured":"Devos, L., Damme, M. V., Haegeman, J., & contributors. (2023). TensorOperations.jl (Version v4.0.7). https:\/\/doi.org\/10.5281\/zenodo.3245496"}],"container-title":["Journal of Open Source Software"],"original-title":[],"link":[{"URL":"https:\/\/joss.theoj.org\/papers\/10.21105\/joss.09886.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:25:27Z","timestamp":1774956327000},"score":1,"resource":{"primary":{"URL":"https:\/\/joss.theoj.org\/papers\/10.21105\/joss.09886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,31]]},"references-count":28,"journal-issue":{"issue":"119","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["10.21105\/joss.09886"],"URL":"https:\/\/doi.org\/10.21105\/joss.09886","relation":{"has-review":[{"id-type":"uri","id":"https:\/\/github.com\/openjournals\/joss-reviews\/issues\/9886","asserted-by":"subject"}],"references":[{"id-type":"doi","id":"10.5281\/zenodo.19287728","asserted-by":"subject"}]},"ISSN":["2475-9066"],"issn-type":[{"value":"2475-9066","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,31]]}}}