Utilizing partitioning for distributed tensor network contraction

DOI10.1137/25M1788488MaRDI QIDQ7410850zbMATH OpenFDO

Authors Manuel Geiger, Qunsheng Huang, Christian B. Mendl

Publication date 2026

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M1788488

zbMATH Keywords

high-performance computingpartitioningquantum computationsimulated annealingtensor network

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Quantum computation (81P68)

Cites work

• Graph bisection with Pareto optimization
• Matrix product state representations
• Optimization by simulated annealing
• Parameterization of tensor network contraction
• Simulating Quantum Computation by Contracting Tensor Networks
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

This page was built for publication: Utilizing partitioning for distributed tensor network contraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7410850)