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.
Related
- Learning to Rank Tensor Network Contraction Plans for GPU-Accelerated Quantum Circuit Simulation
- ArcTN: Efficient Tensor-Network Contraction Planning for Quantum Circuit Simulation
- A compact, interrogable Tree Tensor Network Jet Tagger on Lund declustering trees
- A Tensor-Network Chebyshev--Galerkin Method for Boundary-Value Problems in Computational Mechanics
- Stochastic Tensor Contraction for Efficient MP2 Exchange
BibTeX
@misc{manabe2026ctbmps,
title = {{CT-bMPS: Approximate Tensor Network Contraction with Boundary MPS on Contraction Trees}},
author = {Hidetaka Manabe and Feng Pan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.06574},
eprint = {2610.06574},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.06574},
}
RIS
TY - UNPB
TI - CT-bMPS: Approximate Tensor Network Contraction with Boundary MPS on Contraction Trees
AU - Hidetaka Manabe
AU - Feng Pan
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2610.06574
UR - https://arxiv.org/abs/2610.06574
AB - 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.
ER -