Fast two-dimensional tensor-network contraction via subspace iteration

• URL: http://arxiv.org/abs/2607.15158v1
• Date: Thu, 16 Jul 2026 16:00:54 GMT
• Title: Fast two-dimensional tensor-network contraction via subspace iteration
• Abstract summary: Subspace-it CTMRG (SI-CTMRG) is a QR-based projector construction that replaces each large-matrix SVD with an SVD of a much smaller matrix.<n>We demonstrate the efficiency and accuracy of the method for the triangular-lattice Heisenberg antiferromagnetization, reaching state-of-the-art iPEPS results on a single H100 GPU in approximately 10 hours of computation.
• Score: 3.5000658943213594
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The corner transfer matrix renormalization group (CTMRG) is one of the standard contraction methods for infinite projected entangled-pair states (iPEPS), but its computational cost is dominated by repeated truncated singular value decompositions (SVDs). We introduce subspace-iteration CTMRG (SI-CTMRG), a QR-based projector construction that replaces each large-matrix SVD with an SVD of a much smaller matrix. The resulting algorithm shifts the dominant cost from decompositions to tensor contractions, making it highly suited to GPU acceleration and yielding speedups of up to two orders of magnitude over standard CTMRG. We demonstrate the efficiency and accuracy of the method for the triangular-lattice Heisenberg antiferromagnet, reaching state-of-the-art iPEPS results on a single H100 GPU in approximately 10 hours of computation.

Related papers

• Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging [6.836244339651614]
  Singular Value Decomposition (SVD) underlies matrix factor tasks across computational imaging.<n>SVD algorithms are inherently sequential, constraining real-time throughput and limit online deployment in clinical pipelines.<n>This study introduces Quasi-SVD, a differentiable, fully parallelized matrix factorization framework for GPUs.
  arXiv  Detail & Related papers  (2026-07-28T16:47:59Z)
• Scaling Parallel Sequence Models to Foundation-Scale Vision Encoders [123.58723804218151]
  Vision foundation models are bottlenecked by the quadratic cost of self-attention.<n>We present C-GSPN based on 2D spatial propagation propagation.
  arXiv  Detail & Related papers  (2026-05-30T14:29:43Z)
• NeuMatC: A General Neural Framework for Fast Parametric Matrix Operation [75.91285900600549]
  We propose textbftextitNeural Matrix Computation Framework (NeuMatC), which elegantly tackles general parametric matrix operation tasks.<n>NeuMatC unsupervisedly learns a low-rank and continuous mapping from parameters to their corresponding matrix operation results.<n> Experimental results on both synthetic and real-world datasets demonstrate the promising performance of NeuMatC.
  arXiv  Detail & Related papers  (2025-11-28T07:21:17Z)
• Efficient iPEPS Simulation on the Honeycomb Lattice via QR-based CTMRG [2.0227357325437034]
  We develop a QR-based corner transfer matrix renormalization group (CTMRG) framework for contracting infinite projected entangled-pair states (iPEPS) on honeycomb lattices.<n>Our method explicitly uses the lattice's native C3v symmetry at each site, generalizing QR-based acceleration to enable efficient and stable contractions.
  arXiv  Detail & Related papers  (2025-09-05T13:29:46Z)
• FFT-based Dynamic Subspace Selection for Low-Rank Adaptive Optimization of Large Language Models [49.397861654088636]
  We propose a two-step procedure to approximate SVD/QR-based gradient projections into lower-dimensional spaces.<n>We show that our strategy achieves faster runtime and reduced memory usage by up to $25%$ across different model sizes.
  arXiv  Detail & Related papers  (2025-05-23T14:37:00Z)
• Accelerating two-dimensional tensor network contractions using QR-decompositions [3.6498714804297387]
  We propose a contraction scheme for $C_4v$-symmetric tensor networks based on combining the corner transfer matrix renormalization group with QR-decompositions.<n>Our approach achieves up to two orders of magnitude speedup compared to standard CTMRG and yields state-of-the-art results.
  arXiv  Detail & Related papers  (2025-05-01T12:48:26Z)
• Variationally optimizing infinite projected entangled-pair states at large bond dimensions: A split corner transfer matrix renormalization group approach [0.2796197251957244]
  We introduce an alternative "split-CTMRG" algorithm, which maintains separate PEPS layers and leverages new environment tensors, reducing computational complexity while preserving accuracy.<n> Benchmarks on quantum lattice models demonstrate substantial speedups for variational energy optimization, rendering this method valuable for large-scale PEPS simulations.
  arXiv  Detail & Related papers  (2025-02-14T16:59:33Z)
• Image Reconstruction for Accelerated MR Scan with Faster Fourier Convolutional Neural Networks [87.87578529398019]
  Partial scan is a common approach to accelerate Magnetic Resonance Imaging (MRI) data acquisition in both 2D and 3D settings. We propose a novel convolutional operator called Faster Fourier Convolution (FasterFC) to replace the two consecutive convolution operations. A 2D accelerated MRI method, FasterFC-End-to-End-VarNet, which uses FasterFC to improve the sensitivity maps and reconstruction quality. A 3D accelerated MRI method called FasterFC-based Single-to-group Network (FAS-Net) that utilizes a single-to-group algorithm to guide k-space domain reconstruction
  arXiv  Detail & Related papers  (2023-06-05T13:53:57Z)
• Fast Time-Evolution of Matrix-Product States using the QR decomposition [0.0]
  We propose and benchmark a modified time evolution block decimation algorithm that uses a truncation scheme based on the QR decomposition instead of the singular value decomposition (SVD) The modification reduces the scaling with the dimension of the physical Hilbert space $d$ from $d3$ down to $d2$. In a benchmark simulation of a global quench in a quantum clock model, we observe a speedup of up to three orders of magnitude comparing QR and SVD based updates on an A100 GPU.
  arXiv  Detail & Related papers  (2022-12-19T19:00:05Z)
• GLEAM: Greedy Learning for Large-Scale Accelerated MRI Reconstruction [50.248694764703714]
  Unrolled neural networks have recently achieved state-of-the-art accelerated MRI reconstruction. These networks unroll iterative optimization algorithms by alternating between physics-based consistency and neural-network based regularization. We propose Greedy LEarning for Accelerated MRI reconstruction, an efficient training strategy for high-dimensional imaging settings.
  arXiv  Detail & Related papers  (2022-07-18T06:01:29Z)
• Batch-efficient EigenDecomposition for Small and Medium Matrices [65.67315418971688]
  EigenDecomposition (ED) is at the heart of many computer vision algorithms and applications. We propose a QR-based ED method dedicated to the application scenarios of computer vision.
  arXiv  Detail & Related papers  (2022-07-09T09:14:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.