arXiv · 2610.06574
CT-bMPS: Approximate Tensor Network Contraction with Boundary MPS on Contraction Trees
Abstract
We introduce contraction tree boundary matrix product states (CT-bMPS), a scalable approximate contraction method for general closed tensor networks. CT-bMPS represents the boundary tensor and its complementary environment at each edge of a contraction tree as matrix product states. This representation allows local compression based on a reduced transition matrix to incorporate environment information along arbitrary contraction trees, while keeping the time and memory costs polynomial in the network size and bond dimension. We benchmark the method on a variety of models and applications, including Ising partition functions, random tensor networks, kicked Ising dynamics, and quantum error correction decoding. These benchmarks demonstrate improved accuracy and computational efficiency over existing general-purpose approximate contraction methods, together with the ability to handle larger and more complex networks. Optimized contraction trees and environment updates substantially improve accuracy without increasing the bond dimension. These results establish CT-bMPS as a general and scalable approximation framework with flexible contraction orders and environment-based compression for a wide range of applications.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hidetaka Manabe, Feng Pan. 2026-10-05. CT-bMPS: Approximate Tensor Network Contraction with Boundary MPS on Contraction Trees. https://arxiv.org/abs/2610.06574
Cite the original work for its findings. Save a collection to share your selection of sources.