Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physica A Statistical Mechanics and its Applications

Transfer tensor method applied to non-translation invariant models

G. Sobotta

Published May 1, 1985• 5 citations
Publisher
DOI
10.1016/0378-4371(85)90082-2

Related papers

Transfer tensor method applied to translation invariant models

G. Sobotta

Physica A Statistical Mechanics and its Applications•Mar 1, 1985•6 citations

Entanglement transitions in translation-invariant tensor networks

Yi-Cheng Wang, Samuel J. Garratt, Ehud Altman

We study the complexity of approximately contracting translation-invariant tensor networks. The computational cost of row-by-row tensor network contraction, which defines a discrete time evolution governed by a fixed transfer matrix, is associated with the entanglement of the state of a row. By analyzing a family of tensor networks whose transfer matrices interpolate between chaotic Floquet and strongly non-unitary limits, we uncover a transition between volume- and area-law entanglement in states evolved under the transfer matrix. We show that deep in the volume-law phase the spectrum of the transfer matrix in the complex plane consists of a dense ring with a sharp outer edge, reminiscent of behavior identified for non-unitary random matrices. At late times an evolving row state therefore has significant contributions from many eigenvectors with nearly degenerate eigenvalue magnitudes. In the area-law phase, there is instead a distinct leading eigenvalue. Our results establish connections between contraction complexity, spectral properties of the transfer matrix, and purification under non-unitary dynamics.

quant-pharXiv:2605.04026•May 6, 2026•0 citations

Application of the transfer tensor method: A variational method

G. Sobotta

Physica A Statistical Mechanics and its Applications•Sep 1, 1985•8 citations

Translation invariant tensor product states in a finite lattice system

Jianwei Cai, Qiaoni Chen, Hui‐Hai Zhao +4 more

We show that the matrix (or more generally tensor) product states in a finite translation invariant system can be accurately constructed from the same set of local matrices (or tensors) that are determined from an infinite lattice system in one or higher dimensions. This provides an efficient approach for studying translation invariant tensor product states in finite lattice systems. Two methods are introduced to determine these size-independent local tensors.

arXiv:1011.2060•Chinese Physics B•Nov 1, 2011•2 citations

Transfer tensor method in statistical mechanics

G. Sobotta

Physica A Statistical Mechanics and its Applications•Jan 1, 1985•8 citations

Survey of Tensor Networks

Samuel Desrosiers, Glen Evenbly, Thomas E. Baker

Bulletin of the American Physical Society•Mar 5, 2019•0 citations
We study the complexity of approximately contracting translation-invariant tensor networks. The computational cost of row-by-row tensor network contraction, which defines a discrete time evolution governed by a fixed transfer matrix, is associated with the entanglement of the state of a row. By analyzing a family of tensor networks whose transfer matrices interpolate between chaotic Floquet and strongly non-unitary limits, we uncover a transition between volume- and area-law entanglement in states evolved under the transfer matrix. We show that deep in the volume-law phase the spectrum of the transfer matrix in the complex plane consists of a dense ring with a sharp outer edge, reminiscent of behavior identified for non-unitary random matrices. At late times an evolving row state therefore has significant contributions from many eigenvectors with nearly degenerate eigenvalue magnitudes. In the area-law phase, there is instead a distinct leading eigenvalue. Our results establish connections between contraction complexity, spectral properties of the transfer matrix, and purification under non-unitary dynamics.