aiqbench analysis
This paper investigates the computational cost scaling of matrix product states (MPS) versus tree tensor network states (TTNS) for simulating 2D and 3D quantum many-body systems with area-law entanglement. The study reveals a counterintuitive finding where MPS simulations remain more efficient than TTNS for large systems in dimensions greater than one, despite the latter's reduced graph distance. These results provide critical insights into optimizing classical simulation strategies that benchmark future quantum hardware capabilities.
Cost scaling of MPS and TTNS simulations for 2D and 3D systems with area-law entanglement
arXiv:2601.08132v2 Announce Type: replace Abstract: Tensor network states are an indispensable tool for the simulation of strongly correlated quantum many-body systems. In recent years, tree tensor network states (TTNS) have been successfully used for two-dimensional systems and to benchmark quantum simulation approaches for condensed matter, nuclear, and particle physics. In comparison to the more traditional approach based on matrix product states (MPS), the graph distance of physical degrees of freedom can be drastically reduced in TTNS. Surprisingly, it turns out that, for large systems in $D>1$ spatial dimensions, MPS simulations of low-energy states are nevertheless more efficient than TTNS simulations. With a focus on $D=2$ and 3, the scaling of computational costs for different boundary conditions is determined under the assumption that the system obeys an entanglement (log-)area law, implying that bond dimensions scale exponentially in the interface area of the associated subsystems.
Abstract:Tensor network states are an indispensable tool for the simulation of strongly correlated quantum many-body systems. In recent years, tree tensor network states (TTNS) have been successfully used for two-dimensional systems and to benchmark quantum simulation approaches for condensed matter, nuclear, and particle physics. In comparison to the more traditional approach based on matrix product states (MPS), the graph distance of physical degrees of freedom can be drastically reduced in TTNS. Surprisingly, it turns out that, for large systems in $D>1$ spatial dimensions, MPS simulations of low-energy states are nevertheless more efficient than TTNS simulations. With a focus on $D=2$ and 3, the scaling of computational costs for different boundary conditions is determined under the assumption that the system obeys an entanglement (log-)area law, implying that bond dimensions scale exponentially in the interface area of the associated subsystems.
Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el); Computational Physics (physics.comp-ph)
arXiv:2601.08132 [quant-ph]
(or arXiv:2601.08132v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2601.08132 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 237 words
Related coverage

Team Simulates Entangled Qubits with Limited Resources
Quantum Zeitgeist · Oct 29, 2026
Classical Simulation Healed by Quantum Entanglement
arXiv · Oct 6, 2026
Practical Scalability of Tensor Network Quantum Emulators for Molecular Hamiltonian Simulation
arXiv · Aug 31, 2026
Universal Driven Critical Dynamics of Entanglement Entropy
arXiv · Sep 4, 2026