{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T02:33:40Z","timestamp":1773196420722,"version":"3.50.1"},"reference-count":83,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"crossref","award":["#1942995"],"award-info":[{"award-number":["#1942995"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Department of Energy (DOE) Advanced Scientific Computing Research program","award":["DE-SC0023483"],"award-info":[{"award-number":["DE-SC0023483"]}]}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>Tensor network contractions are widely used in statistical physics, quantum computing, and computer science. We introduce a method to efficiently approximate tensor network contractions using low-rank approximations, where each intermediate tensor generated during the contractions is approximated as a low-rank binary tree tensor network. The proposed algorithm has the flexibility to incorporate a large portion of the environment when performing low-rank approximations, which can lead to high accuracy for a given rank. Here, the environment refers to the remaining set of tensors in the network, and low-rank approximations with larger environments can generally provide higher accuracy. For contracting tensor networks defined on lattices, the proposed algorithm can be viewed as a generalization of the standard boundary-based algorithms. In addition, the algorithm includes a cost-efficient density matrix algorithm for approximating a tensor network with a general graph structure into a tree structure, whose computational cost is asymptotically upper-bounded by that of the standard algorithm that uses canonicalization. Experimental results indicate that the proposed technique outperforms previously proposed approximate tensor network contraction algorithms for multiple problems in terms of both accuracy and efficiency.<\/jats:p>","DOI":"10.22331\/q-2024-12-27-1580","type":"journal-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T17:18:45Z","timestamp":1735319925000},"page":"1580","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":3,"title":["Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm"],"prefix":"10.22331","volume":"8","author":[{"given":"Linjian","family":"Ma","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA"}]},{"given":"Matthew","family":"Fishman","sequence":"additional","affiliation":[{"name":"Center for Computational Quantum Physics, Flatiron Institute, New York, New York 10010, USA"}]},{"given":"Edwin Miles","family":"Stoudenmire","sequence":"additional","affiliation":[{"name":"Center for Computational Quantum Physics, Flatiron Institute, New York, New York 10010, USA"}]},{"given":"Edgar","family":"Solomonik","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA"}]}],"member":"9598","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Thomas D. Ahle, Michael Kapralov, Jakob B. T. Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, and Amir Zandieh. Oblivious Sketching of High-Degree Polynomial Kernels, page 141\u2013160. Society for Industrial and Applied Mathematics, January 2020. ISBN 9781611975994. 10.1137\/1.9781611975994.9. URL https:\/\/doi.org\/10.1137\/1.9781611975994.9.","DOI":"10.1137\/1.9781611975994.9"},{"key":"1","doi-asserted-by":"publisher","unstructured":"R. Alkabetz and I. Arad. Tensor networks contraction and the belief propagation algorithm. Physical Review Research, 3 (2), April 2021. ISSN 2643-1564. 10.1103\/physrevresearch.3.023073. URL https:\/\/doi.org\/10.1103\/PhysRevResearch.3.023073.","DOI":"10.1103\/physrevresearch.3.023073"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Sanjeev Arora, Satish Rao, and Umesh Vazirani. Expander flows, geometric embeddings and graph partitioning. Journal of the ACM, 56 (2): 1\u201337, April 2009. ISSN 1557-735X. 10.1145\/1502793.1502794. URL https:\/\/doi.org\/10.1145\/1502793.1502794.","DOI":"10.1145\/1502793.1502794"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al. Quantum supremacy using a programmable superconducting processor. Nature, 574 (7779): 505\u2013510, October 2019. ISSN 1476-4687. 10.1038\/s41586-019-1666-5. URL https:\/\/doi.org\/10.1038\/s41586-019-1666-5.","DOI":"10.1038\/s41586-019-1666-5"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Daniel Bauernfeind, Manuel Zingl, Robert Triebl, Markus Aichhorn, and Hans Gerd Evertz. Fork tensor-product states: Efficient multiorbital real-time DMFT solver. Physical Review X, 7 (3), July 2017. ISSN 2160-3308. 10.1103\/physrevx.7.031013. URL https:\/\/doi.org\/10.1103\/PhysRevX.7.031013.","DOI":"10.1103\/physrevx.7.031013"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Viral B. Shah. Julia: A fresh approach to numerical computing. SIAM Review, 59 (1): 65\u201398, January 2017. ISSN 1095-7200. 10.1137\/141000671. URL https:\/\/doi.org\/10.1137\/141000671.","DOI":"10.1137\/141000671"},{"key":"6","doi-asserted-by":"publisher","unstructured":"S.L. Bezrukov, J.D. Chavez, L.H. Harper, M. R\u00f6ttger, and U.-P. Schroeder. The congestion of n-cube layout on a rectangular grid. Discrete Mathematics, 213 (1\u20133): 13\u201319, February 2000. ISSN 0012-365X. 10.1016\/s0012-365x(99)00162-4. URL https:\/\/doi.org\/10.1016\/S0012-365X(99)00162-4.","DOI":"10.1016\/s0012-365x(99)00162-4"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Jacob D. Biamonte, Jason Morton, and Jacob Turner. Tensor network contractions for #SAT. Journal of Statistical Physics, 160 (5): 1389\u20131404, June 2015. ISSN 1572-9613. 10.1007\/s10955-015-1276-z. URL https:\/\/doi.org\/10.1007\/s10955-015-1276-z.","DOI":"10.1007\/s10955-015-1276-z"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Dan Bienstock. On embedding graphs in trees. Journal of Combinatorial Theory, Series B, 49 (1): 103\u2013136, June 1990. ISSN 0095-8956. 10.1016\/0095-8956(90)90066-9. URL https:\/\/doi.org\/10.1016\/0095-8956(90)90066-9.","DOI":"10.1016\/0095-8956(90)90066-9"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J. Bremner, John M. Martinis, and Hartmut Neven. Characterizing quantum supremacy in near-term devices. Nature Physics, 14 (6): 595\u2013600, April 2018. ISSN 1745-2481. 10.1038\/s41567-018-0124-x. URL https:\/\/doi.org\/10.1038\/s41567-018-0124-x.","DOI":"10.1038\/s41567-018-0124-x"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Moses Charikar, Mohammad Taghi Hajiaghayi, Howard Karloff, and Satish Rao. $\\ell_2^2$ spreading metrics for vertex ordering problems. Algorithmica, 56: 577\u2013604, 2010. 10.1007\/s00453-008-9191-1.","DOI":"10.1007\/s00453-008-9191-1"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Jielun Chen, Jiaqing Jiang, Dominik Hangleiter, and Norbert Schuch. Sign problem in tensor network contraction. 2024. 10.48550\/arXiv.2404.19023. URL https:\/\/doi.org\/10.48550\/arXiv.2404.19023.","DOI":"10.48550\/arXiv.2404.19023"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Natalia Chepiga and Steven R. White. Comb tensor networks. Physical Review B, 99 (23), June 2019. ISSN 2469-9969. 10.1103\/physrevb.99.235426. URL https:\/\/doi.org\/10.1103\/PhysRevB.99.235426.","DOI":"10.1103\/physrevb.99.235426"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Christopher T Chubb. General tensor network decoding of 2D pauli codes. 2021. 10.48550\/arXiv.2101.04125. URL https:\/\/doi.org\/10.48550\/arXiv.2101.04125.","DOI":"10.48550\/arXiv.2101.04125"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Andrzej Cichocki. Tensor networks for big data analytics and large-scale optimization problems. 2014. 10.48550\/ARXIV.1407.3124. URL https:\/\/doi.org\/10.48550\/ARXIV.1407.3124.","DOI":"10.48550\/ARXIV.1407.3124"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Carsten Damm, Markus Holzer, and Pierre McKenzie. The complexity of tensor calculus. computational complexity, 11 (1): 54\u201389, 2002. 10.1109\/ccc.2000.856737. URL https:\/\/doi.org\/10.1109\/CCC.2000.856737.","DOI":"10.1109\/ccc.2000.856737"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Nikhil R. Devanur, Subhash A. Khot, Rishi Saket, and Nisheeth K. Vishnoi. Integrality gaps for sparsest cut and minimum linear arrangement problems. In Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, STOC06, page 537\u2013546. ACM, May 2006. 10.1145\/1132516.1132594. URL https:\/\/doi.org\/10.1145\/1132516.1132594.","DOI":"10.1145\/1132516.1132594"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, and Alon Shalita. Compressing graphs and indexes with recursive graph bisection. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201916. ACM, August 2016. 10.1145\/2939672.2939862. URL https:\/\/doi.org\/10.1145\/2939672.2939862.","DOI":"10.1145\/2939672.2939862"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Josep D\u00edaz, Jordi Petit, and Maria Serna. A survey of graph layout problems. ACM Computing Surveys, 34 (3): 313\u2013356, September 2002. ISSN 1557-7341. 10.1145\/568522.568523. URL https:\/\/doi.org\/10.1145\/568522.568523.","DOI":"10.1145\/568522.568523"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Guy Even, Joseph Seffi Naor, Satish Rao, and Baruch Schieber. Divide-and-conquer approximation algorithms via spreading metrics. Journal of the ACM, 47 (4): 585\u2013616, July 2000. ISSN 1557-735X. 10.1145\/347476.347478. URL https:\/\/doi.org\/10.1145\/347476.347478.","DOI":"10.1145\/347476.347478"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Uriel Feige and James R. Lee. An improved approximation ratio for the minimum linear arrangement problem. Information Processing Letters, 101 (1): 26\u201329, January 2007. ISSN 0020-0190. 10.1016\/j.ipl.2006.07.009. URL https:\/\/doi.org\/10.1016\/j.ipl.2006.07.009.","DOI":"10.1016\/j.ipl.2006.07.009"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Timo Felser, Simone Notarnicola, and Simone Montangero. Efficient tensor network ansatz for high-dimensional quantum many-body problems. Physical Review Letters, 126 (17), April 2021. ISSN 1079-7114. 10.1103\/physrevlett.126.170603. URL https:\/\/doi.org\/10.1103\/PhysRevLett.126.170603.","DOI":"10.1103\/physrevlett.126.170603"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Giovanni Ferrari, Giuseppe Magnifico, and Simone Montangero. Adaptive-weighted tree tensor networks for disordered quantum many-body systems. Physical Review B, 105 (21), June 2022. ISSN 2469-9969. 10.1103\/physrevb.105.214201. URL https:\/\/doi.org\/10.1103\/PhysRevB.105.214201.","DOI":"10.1103\/physrevb.105.214201"},{"key":"23","doi-asserted-by":"publisher","unstructured":"Matthew Fishman, Steven White, and Edwin Stoudenmire. The ITensor software library for tensor network calculations. SciPost Physics Codebases, August 2022. 10.21468\/scipostphyscodeb.4. URL https:\/\/doi.org\/10.21468\/SciPostPhysCodeb.4.","DOI":"10.21468\/scipostphyscodeb.4"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Johnnie Gray. quimb: A Python package for quantum information and many-body calculations. Journal of Open Source Software, 3 (29): 819, September 2018. ISSN 2475-9066. 10.21105\/joss.00819. URL https:\/\/doi.org\/10.21105\/joss.00819.","DOI":"10.21105\/joss.00819"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Johnnie Gray and Garnet Kin-Lic Chan. Hyperoptimized approximate contraction of tensor networks with arbitrary geometry. Physical Review X, 14 (1), January 2024. ISSN 2160-3308. 10.1103\/physrevx.14.011009. URL https:\/\/doi.org\/10.1103\/PhysRevX.14.011009.","DOI":"10.1103\/physrevx.14.011009"},{"key":"26","doi-asserted-by":"publisher","unstructured":"Johnnie Gray and Stefanos Kourtis. Hyper-optimized tensor network contraction. Quantum, 5: 410, March 2021. ISSN 2521-327X. 10.22331\/q-2021-03-15-410. URL https:\/\/doi.org\/10.22331\/q-2021-03-15-410.","DOI":"10.22331\/q-2021-03-15-410"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Ming Gu and Stanley C. Eisenstat. Efficient algorithms for computing a strong rank-revealing QR factorization. SIAM Journal on Scientific Computing, 17 (4): 848\u2013869, July 1996. ISSN 1095-7197. 10.1137\/0917055. URL https:\/\/doi.org\/10.1137\/0917055.","DOI":"10.1137\/0917055"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Chu Guo, Yong Liu, Min Xiong, Shichuan Xue, Xiang Fu, Anqi Huang, Xiaogang Qiang, Ping Xu, Junhua Liu, Shenggen Zheng, He-Liang Huang, Mingtang Deng, Dario Poletti, Wan-Su Bao, and Junjie Wu. General-purpose quantum circuit simulator with projected entangled-pair states and the quantum supremacy frontier. Physical Review Letters, 123 (19), November 2019. ISSN 1079-7114. 10.1103\/physrevlett.123.190501. URL https:\/\/doi.org\/10.1103\/PhysRevLett.123.190501.","DOI":"10.1103\/physrevlett.123.190501"},{"key":"29","doi-asserted-by":"publisher","unstructured":"N. Halko, P. G. Martinsson, and J. A. Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53 (2): 217\u2013288, January 2011. ISSN 1095-7200. 10.1137\/090771806. URL https:\/\/doi.org\/10.1137\/090771806.","DOI":"10.1137\/090771806"},{"key":"30","doi-asserted-by":"publisher","unstructured":"M.D. Hansen. Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems. In 30th Annual Symposium on Foundations of Computer Science, page 604\u2013609. IEEE, 1989. 10.1109\/sfcs.1989.63542. URL https:\/\/doi.org\/10.1109\/SFCS.1989.63542.","DOI":"10.1109\/sfcs.1989.63542"},{"key":"31","doi-asserted-by":"publisher","unstructured":"L. H. Harper. Optimal assignments of numbers to vertices. Journal of the Society for Industrial and Applied Mathematics, 12 (1): 131\u2013135, March 1964. ISSN 2168-3484. 10.1137\/0112012. URL https:\/\/doi.org\/10.1137\/0112012.","DOI":"10.1137\/0112012"},{"key":"32","doi-asserted-by":"publisher","unstructured":"Stephen W. Hruska. On tree congestion of graphs. Discrete Mathematics, 308 (10): 1801\u20131809, May 2008. ISSN 0012-365X. 10.1016\/j.disc.2007.04.030. URL https:\/\/doi.org\/10.1016\/j.disc.2007.04.030.","DOI":"10.1016\/j.disc.2007.04.030"},{"key":"33","doi-asserted-by":"publisher","unstructured":"Cameron Ibrahim, Danylo Lykov, Zichang He, Yuri Alexeev, and Ilya Safro. Constructing optimal contraction trees for tensor network quantum circuit simulation. In 2022 IEEE High Performance Extreme Computing Conference (HPEC), page 1\u20138. IEEE, September 2022. 10.1109\/hpec55821.2022.9926353. URL https:\/\/doi.org\/10.1109\/HPEC55821.2022.9926353.","DOI":"10.1109\/hpec55821.2022.9926353"},{"key":"34","doi-asserted-by":"publisher","unstructured":"Adam Jermyn. Automatic contraction of unstructured tensor networks. SciPost Physics, 8 (1), January 2020. ISSN 2542-4653. 10.21468\/scipostphys.8.1.005. URL https:\/\/doi.org\/10.21468\/SciPostPhys.8.1.005.","DOI":"10.21468\/scipostphys.8.1.005"},{"key":"35","unstructured":"George Karypis. METIS: Unstructured graph partitioning and sparse matrix ordering system. Technical report, 1997."},{"key":"36","doi-asserted-by":"publisher","unstructured":"Tamara G. Kolda and Brett W. Bader. Tensor decompositions and applications. SIAM Review, 51 (3): 455\u2013500, August 2009. ISSN 1095-7200. 10.1137\/07070111x. URL https:\/\/doi.org\/10.1137\/07070111X.","DOI":"10.1137\/07070111x"},{"key":"37","doi-asserted-by":"publisher","unstructured":"Stefanos Kourtis, Claudio Chamon, Eduardo Mucciolo, and Andrei Ruckenstein. Fast counting with tensor networks. SciPost Physics, 7 (5), November 2019. ISSN 2542-4653. 10.21468\/scipostphys.7.5.060. URL https:\/\/doi.org\/10.21468\/SciPostPhys.7.5.060.","DOI":"10.21468\/scipostphys.7.5.060"},{"key":"38","doi-asserted-by":"publisher","unstructured":"T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science. IEEE, 1988. 10.1109\/sfcs.1988.21958. URL https:\/\/doi.org\/10.1109\/SFCS.1988.21958.","DOI":"10.1109\/sfcs.1988.21958"},{"key":"39","doi-asserted-by":"publisher","unstructured":"Michael Levin and Cody P. Nave. Tensor renormalization group approach to two-dimensional classical lattice models. Physical Review Letters, 99 (12), September 2007. ISSN 1079-7114. 10.1103\/physrevlett.99.120601. URL https:\/\/doi.org\/10.1103\/PhysRevLett.99.120601.","DOI":"10.1103\/physrevlett.99.120601"},{"key":"40","unstructured":"Chao Li, Junhua Zeng, Zerui Tao, and Qibin Zhao. Permutation search of tensor network structures via local sampling. In International Conference on Machine Learning, pages 13106\u201313124. PMLR, 2022."},{"key":"41","unstructured":"Jingling Li, Yanchao Sun, Jiahao Su, Taiji Suzuki, and Furong Huang. Understanding generalization in deep learning via tensor methods. In International Conference on Artificial Intelligence and Statistics, pages 504\u2013515. PMLR, 2020."},{"key":"42","doi-asserted-by":"publisher","unstructured":"Hai-Jun Liao, Jin-Guo Liu, Lei Wang, and Tao Xiang. Differentiable programming tensor networks. Physical Review X, 9 (3), September 2019. ISSN 2160-3308. 10.1103\/physrevx.9.031041. URL https:\/\/doi.org\/10.1103\/PhysRevX.9.031041.","DOI":"10.1103\/physrevx.9.031041"},{"key":"43","doi-asserted-by":"publisher","unstructured":"Jin-Guo Liu, Xun Gao, Madelyn Cain, Mikhail D. Lukin, and Sheng-Tao Wang. Computing solution space properties of combinatorial optimization problems via generic tensor networks. SIAM Journal on Scientific Computing, 45 (3): A1239\u2013A1270, June 2023. ISSN 1095-7197. 10.1137\/22m1501787. URL https:\/\/doi.org\/10.1137\/22M1501787.","DOI":"10.1137\/22m1501787"},{"key":"44","doi-asserted-by":"publisher","unstructured":"Michael Lubasch, J. Ignacio Cirac, and Mari-Carmen Ba\u00f1uls. Algorithms for finite projected entangled pair states. Physical Review B, 90 (6), August 2014a. ISSN 1550-235X. 10.1103\/physrevb.90.064425. URL https:\/\/doi.org\/10.1103\/PhysRevB.90.064425.","DOI":"10.1103\/physrevb.90.064425"},{"key":"45","doi-asserted-by":"publisher","unstructured":"Michael Lubasch, J Ignacio Cirac, and Mari-Carmen Ba\u00f1uls. Unifying projected entangled pair state contractions. New Journal of Physics, 16 (3): 033014, March 2014b. ISSN 1367-2630. 10.1088\/1367-2630\/16\/3\/033014. URL https:\/\/doi.org\/10.1088\/1367-2630\/16\/3\/033014.","DOI":"10.1088\/1367-2630\/16\/3\/033014"},{"key":"46","unstructured":"Linjian Ma and Edgar Solomonik. Fast and accurate randomized algorithms for low-rank tensor decompositions. Advances in Neural Information Processing Systems, 34: 24299\u201324312, 2021."},{"key":"47","unstructured":"Linjian Ma and Edgar Solomonik. Cost-efficient gaussian tensor network embeddings for tensor-structured inputs. In Advances in Neural Information Processing Systems, volume 35, pages 38980\u201338993, 2022."},{"key":"48","doi-asserted-by":"publisher","unstructured":"Linjian Ma and Chao Yang. Low rank approximation in simulations of quantum algorithms. Journal of Computational Science, 59: 101561, March 2022. ISSN 1877-7503. 10.1016\/j.jocs.2022.101561. URL https:\/\/doi.org\/10.1016\/j.jocs.2022.101561.","DOI":"10.1016\/j.jocs.2022.101561"},{"key":"49","doi-asserted-by":"publisher","unstructured":"Linjian Ma, Jiayu Ye, and Edgar Solomonik. AutoHOOT: Automatic high-order optimization for tensors. In Proceedings of the ACM International Conference on Parallel Architectures and Compilation Techniques, PACT \u201920, page 125\u2013137. ACM, September 2020. 10.1145\/3410463.3414647. URL https:\/\/doi.org\/10.1145\/3410463.3414647.","DOI":"10.1145\/3410463.3414647"},{"key":"50","doi-asserted-by":"publisher","unstructured":"Paul Manuel, Indra Rajasingh, Bharati Rajan, and Helda Mercy. Exact wirelength of hypercubes on a grid. Discrete Applied Mathematics, 157 (7): 1486\u20131495, April 2009. ISSN 0166-218X. 10.1016\/j.dam.2008.09.013. URL https:\/\/doi.org\/10.1016\/j.dam.2008.09.013.","DOI":"10.1016\/j.dam.2008.09.013"},{"key":"51","doi-asserted-by":"publisher","unstructured":"Akira Matsubayashi. Separator-based graph embedding into multidimensional grids with small edge-congestion. Discrete Applied Mathematics, 185: 119\u2013137, April 2015. ISSN 0166-218X. 10.1016\/j.dam.2014.11.024. URL https:\/\/doi.org\/10.1016\/j.dam.2014.11.024.","DOI":"10.1016\/j.dam.2014.11.024"},{"key":"52","unstructured":"Tensornetwork.org contributors. Density matrix algorithm. tensornetwork.org, 2021."},{"key":"53","doi-asserted-by":"publisher","unstructured":"V. Murg, F. Verstraete, R. Schneider, P. R. Nagy, and \u00d6. Legeza. Tree tensor network state with variable tensor order: An efficient multireference method for strongly correlated systems. Journal of Chemical Theory and Computation, 11 (3): 1027\u20131036, February 2015. ISSN 1549-9626. 10.1021\/ct501187j. URL https:\/\/doi.org\/10.1021\/ct501187j.","DOI":"10.1021\/ct501187j"},{"key":"54","doi-asserted-by":"publisher","unstructured":"Naoki Nakatani and Garnet Kin-Lic Chan. Efficient tree tensor network states (TTNS) for quantum chemistry: Generalizations of the density matrix renormalization group algorithm. The Journal of Chemical Physics, 138 (13), April 2013. ISSN 1089-7690. 10.1063\/1.4798639. URL https:\/\/doi.org\/10.1063\/1.4798639.","DOI":"10.1063\/1.4798639"},{"key":"55","doi-asserted-by":"publisher","unstructured":"Bryan O&apos;Gorman. Parameterization of tensor network contraction. 2019. 10.48550\/arXiv.1906.00013. URL https:\/\/doi.org\/10.48550\/arXiv.1906.00013.","DOI":"10.48550\/arXiv.1906.00013"},{"key":"56","doi-asserted-by":"publisher","unstructured":"Rom\u00e1n Or\u00fas. Tensor networks for complex quantum systems. Nature Reviews Physics, 1 (9): 538\u2013550, August 2019. ISSN 2522-5820. 10.1038\/s42254-019-0086-7. URL https:\/\/doi.org\/10.1038\/s42254-019-0086-7.","DOI":"10.1038\/s42254-019-0086-7"},{"key":"57","doi-asserted-by":"publisher","unstructured":"Rom\u00e1n Or\u00fas. A practical introduction to tensor networks: Matrix product states and projected entangled pair states. Annals of Physics, 349: 117\u2013158, October 2014. ISSN 0003-4916. 10.1016\/j.aop.2014.06.013. URL https:\/\/doi.org\/10.1016\/j.aop.2014.06.013.","DOI":"10.1016\/j.aop.2014.06.013"},{"key":"58","doi-asserted-by":"publisher","unstructured":"I. V. Oseledets. Tensor-train decomposition. SIAM Journal on Scientific Computing, 33 (5): 2295\u20132317, January 2011. ISSN 1095-7197. 10.1137\/090752286. URL https:\/\/doi.org\/10.1137\/090752286.","DOI":"10.1137\/090752286"},{"key":"59","doi-asserted-by":"publisher","unstructured":"Sebastian Paeckel, Thomas K\u00f6hler, Andreas Swoboda, Salvatore R. Manmana, Ulrich Schollw\u00f6ck, and Claudius Hubig. Time-evolution methods for matrix-product states. Annals of Physics, 411: 167998, December 2019. ISSN 0003-4916. 10.1016\/j.aop.2019.167998. URL https:\/\/doi.org\/10.1016\/j.aop.2019.167998.","DOI":"10.1016\/j.aop.2019.167998"},{"key":"60","doi-asserted-by":"publisher","unstructured":"Feng Pan, Pengfei Zhou, Sujie Li, and Pan Zhang. Contracting arbitrary tensor networks: General approximate algorithm and applications in graphical models and quantum circuit simulations. Physical Review Letters, 125 (6), August 2020. ISSN 1079-7114. 10.1103\/physrevlett.125.060503. URL https:\/\/doi.org\/10.1103\/PhysRevLett.125.060503.","DOI":"10.1103\/physrevlett.125.060503"},{"key":"61","doi-asserted-by":"publisher","unstructured":"Yuchen Pang, Tianyi Hao, Annika Dugad, Yiqing Zhou, and Edgar Solomonik. Efficient 2D tensor network simulation of quantum systems. In SC20: International Conference for High Performance Computing, Networking, Storage and Analysis, pages 1\u201314. IEEE, 2020. 10.5555\/3433701.3433719. URL https:\/\/dl.acm.org\/doi\/10.5555\/3433701.3433719.","DOI":"10.5555\/3433701.3433719"},{"key":"62","unstructured":"Beheshteh Rakhshan and Guillaume Rabusseau. Tensorized random projections. In International Conference on Artificial Intelligence and Statistics, pages 3306\u20133316. PMLR, 2020."},{"key":"63","doi-asserted-by":"publisher","unstructured":"Satish Rao and Andr\u00e9a W. Richa. New approximation techniques for some linear ordering problems. SIAM Journal on Computing, 34 (2): 388\u2013404, January 2005. ISSN 1095-7111. 10.1137\/s0097539702413197. URL https:\/\/doi.org\/10.1137\/S0097539702413197.","DOI":"10.1137\/s0097539702413197"},{"key":"64","doi-asserted-by":"publisher","unstructured":"J A Reyes and E M Stoudenmire. Multi-scale tensor network architecture for machine learning. Machine Learning: Science and Technology, 2 (3): 035036, July 2021. ISSN 2632-2153. 10.1088\/2632-2153\/abffe8. URL https:\/\/doi.org\/10.1088\/2632-2153\/abffe8.","DOI":"10.1088\/2632-2153\/abffe8"},{"key":"65","doi-asserted-by":"publisher","unstructured":"Subhayan Sahu and Brian Swingle. Efficient tensor network simulation of quantum many-body physics on sparse graphs. 2022. 10.48550\/arXiv.2206.04701. URL https:\/\/doi.org\/10.48550\/arXiv.2206.04701.","DOI":"10.48550\/arXiv.2206.04701"},{"key":"66","doi-asserted-by":"publisher","unstructured":"Sebastian Schlag, Tobias Heuer, Lars Gottesb\u00fcren, Yaroslav Akhremtsev, Christian Schulz, and Peter Sanders. High-quality hypergraph partitioning. ACM Journal of Experimental Algorithmics, 27: 1\u201339, December 2022. ISSN 1084-6654. 10.1145\/3529090. URL https:\/\/doi.org\/10.1145\/3529090.","DOI":"10.1145\/3529090"},{"key":"67","doi-asserted-by":"publisher","unstructured":"U. Schollw\u00f6ck. The density-matrix renormalization group. Reviews of Modern Physics, 77 (1): 259\u2013315, April 2005. ISSN 1539-0756. 10.1103\/revmodphys.77.259. URL https:\/\/doi.org\/10.1103\/RevModPhys.77.259.","DOI":"10.1103\/revmodphys.77.259"},{"key":"68","doi-asserted-by":"publisher","unstructured":"Philipp Seitz, Ismael Medina, Esther Cruz, Qunsheng Huang, and Christian B. Mendl. Simulating quantum circuits using tree tensor networks. Quantum, 7: 964, March 2023. ISSN 2521-327X. 10.22331\/q-2023-03-30-964. URL https:\/\/doi.org\/10.22331\/q-2023-03-30-964.","DOI":"10.22331\/q-2023-03-30-964"},{"key":"69","doi-asserted-by":"publisher","unstructured":"Y.-Y. Shi, L.-M. Duan, and G. Vidal. Classical simulation of quantum many-body systems with a tree tensor network. Physical Review A, 74 (2), August 2006. ISSN 1094-1622. 10.1103\/physreva.74.022320. URL https:\/\/doi.org\/10.1103\/PhysRevA.74.022320.","DOI":"10.1103\/physreva.74.022320"},{"key":"70","doi-asserted-by":"publisher","unstructured":"Horst D. Simon and Shang-Hua Teng. How good is recursive bisection? SIAM Journal on Scientific Computing, 18 (5): 1436\u20131445, September 1997. ISSN 1095-7197. 10.1137\/s1064827593255135. URL https:\/\/doi.org\/10.1137\/S1064827593255135.","DOI":"10.1137\/s1064827593255135"},{"key":"71","doi-asserted-by":"publisher","unstructured":"E M Stoudenmire and Steven R White. Minimally entangled typical thermal state algorithms. New Journal of Physics, 12 (5): 055026, may 2010. 10.1088\/1367-2630\/12\/5\/055026. URL https:\/\/doi.org\/10.1088\/1367-2630\/12\/5\/055026.","DOI":"10.1088\/1367-2630\/12\/5\/055026"},{"key":"72","doi-asserted-by":"publisher","unstructured":"Edwin Stoudenmire and David J Schwab. Supervised learning with tensor networks. Advances in Neural Information Processing Systems, 29, 2016. 10.5555\/3157382.3157634. URL https:\/\/dl.acm.org\/doi\/10.5555\/3157382.3157634.","DOI":"10.5555\/3157382.3157634"},{"key":"73","doi-asserted-by":"publisher","unstructured":"Volker Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13 (4): 354\u2013356, August 1969. ISSN 0945-3245. 10.1007\/bf02165411. URL https:\/\/doi.org\/10.1007\/BF02165411.","DOI":"10.1007\/bf02165411"},{"key":"74","doi-asserted-by":"publisher","unstructured":"Szil\u00e1rd Szalay, Max Pfeffer, Valentin Murg, Gergely Barcza, Frank Verstraete, Reinhold Schneider, and Ors Legeza. Tensor product methods and entanglement optimization for ab initio quantum chemistry. International Journal of Quantum Chemistry, 115 (19): 1342\u20131391, 2015. 10.1002\/qua.24898. URL https:\/\/doi.org\/10.1002\/qua.24898.","DOI":"10.1002\/qua.24898"},{"key":"75","doi-asserted-by":"publisher","unstructured":"Dimitrios M. Thilikos, Maria Serna, and Hans L. Bodlaender. Cutwidth I: A linear time fixed parameter algorithm. Journal of Algorithms, 56 (1): 1\u201324, July 2005. ISSN 0196-6774. 10.1016\/j.jalgor.2004.12.001. URL https:\/\/doi.org\/10.1016\/j.jalgor.2004.12.001.","DOI":"10.1016\/j.jalgor.2004.12.001"},{"key":"76","unstructured":"Vijay V Vazirani. Approximation algorithms, volume 1. Springer, 2001."},{"key":"77","doi-asserted-by":"publisher","unstructured":"F. Verstraete, V. Murg, and J.I. Cirac. Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems. Advances in Physics, 57 (2): 143\u2013224, March 2008. ISSN 1460-6976. 10.1080\/14789940801912366. URL https:\/\/doi.org\/10.1080\/14789940801912366.","DOI":"10.1080\/14789940801912366"},{"key":"78","doi-asserted-by":"publisher","unstructured":"Frank Verstraete and J Ignacio Cirac. Renormalization algorithms for quantum-many body systems in two and higher dimensions. 2004. 10.48550\/ARXIV.COND-MAT\/0407066. URL https:\/\/doi.org\/10.48550\/ARXIV.COND-MAT\/0407066.","DOI":"10.48550\/ARXIV.COND-MAT\/0407066"},{"key":"79","doi-asserted-by":"publisher","unstructured":"Guifr\u00e9 Vidal. Efficient classical simulation of slightly entangled quantum computations. Physical Review Letters, 91 (14), October 2003. ISSN 1079-7114. 10.1103\/physrevlett.91.147902. URL https:\/\/doi.org\/10.1103\/PhysRevLett.91.147902.","DOI":"10.1103\/physrevlett.91.147902"},{"key":"80","doi-asserted-by":"publisher","unstructured":"Steven R. White. Density matrix formulation for quantum renormalization groups. Physical Review Letters, 69 (19): 2863\u20132866, November 1992. ISSN 0031-9007. 10.1103\/physrevlett.69.2863. URL https:\/\/doi.org\/10.1103\/PhysRevLett.69.2863.","DOI":"10.1103\/physrevlett.69.2863"},{"key":"81","doi-asserted-by":"publisher","unstructured":"Yifan Zhang and Edgar Solomonik. On stability of tensor networks and canonical forms. 2020. 10.48550\/arXiv.2001.01191. URL https:\/\/doi.org\/10.48550\/arXiv.2001.01191.","DOI":"10.48550\/arXiv.2001.01191"},{"key":"82","doi-asserted-by":"publisher","unstructured":"Yiqing Zhou, E. Miles Stoudenmire, and Xavier Waintal. What limits the simulation of quantum computers? Physical Review X, 10 (4), November 2020. ISSN 2160-3308. 10.1103\/physrevx.10.041038. URL https:\/\/doi.org\/10.1103\/PhysRevX.10.041038.","DOI":"10.1103\/physrevx.10.041038"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-12-27-1580\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T17:19:07Z","timestamp":1735319947000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-12-27-1580\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"references-count":83,"URL":"https:\/\/doi.org\/10.22331\/q-2024-12-27-1580","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"article-number":"1580"}}