Utilizing Partitioning for Distributed Tensor Network Contraction

Tensor networks have proven to be a valuable tool, for instance, in the classical simulation of (strongly correlated) quantum systems. As the size of the systems increases, contracting larger tensor networks becomes computationally demanding. In this work, we explore the use of partitioning to distribute the contraction task across a distributed memory architecture, commonly found in high-performance computing environments. This approach offers a promising alternative to the widely used parallelization based on slicing, which often incurs significant computational overhead. We particularly investigate how a given partitioning can be optimized to enable efficient contraction, as both computational and memory costs are highly sensitive to the chosen strategy. To this end, we introduce a simulated annealing-based method that iteratively refines a partitioning to minimize the operation count along the critical path, thereby reducing time-to-solution. The algorithm is evaluated on MQT Bench circuits and achieves a lower computational cost in 47 of 71 circuits, with improvements up to [Formula: see text] orders of magnitude compared to contraction paths generated by Cotengra, a state-of-the-art contraction path finding library.