SearcharxivSearch

arXiv · 2510.19428

Lattice-reflection symmetry in tensor-network renormalization group with entanglement filtering in two and three dimensions

Abstract

Tensor-network renormalization group (TNRG) is an efficient real-space renormalization group method for studying the criticality in both classical and quantum lattice systems. Exploiting symmetries of a system in a TNRG algorithm can simplify the implementation of the algorithm and can help produce correct tensor RG flows. Although a general framework for considering a global on-site symmetry has been established, it is still unclear how to incorporate a lattice symmetry in TNRG. As a first step for lattice symmetries, we propose a method to incorporate the lattice-reflection symmetry in the context of a TNRG with entanglement filtering in both two and three dimensions (2D and 3D). To achieve this, we write down a general definition of lattice-reflection symmetry in tensor-network language. Then, we introduce a transposition trick for exploiting and imposing the lattice-reflection symmetry in two basic TNRG operations: projective truncations and entanglement filtering. Using the transposition trick, the detailed algorithms of the TNRG map in both 2D and 3D are laid out, where the lattice-reflection symmetry is preserved and imposed. Finally, we demonstrate how to construct the linearization of the TNRG maps in a given lattice-reflection sector, with the help of which it becomes possible to extract scaling dimensions in each sector separately. Our work paves the way for understanding the lattice-rotation symmetry in TNRG.

Explore related subjects

Keep this discovery

BibTeXRIS

Xinliang Lyu, Naoki Kawashima. 2025-10-22. Lattice-reflection symmetry in tensor-network renormalization group with entanglement filtering in two and three dimensions. https://doi.org/10.1103/z7sk-7sq8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech