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

arXiv:2006.12857 · Physical review. B./Physical review. B

Tensor-network strong-disorder renormalization groups for random quantum spin systems in two dimensions

Kouichi Seki, Toshiya Hikihara, Kouichi Okunishi

Published Oct 26, 2020• 10 citations
arXivHTMLPDF

Abstract

Novel randomness-induced disordered ground states in two-dimensional (2D) quantum spin systems have been attracting much interest. For quantitative analysis of such random quantum spin systems, one of the most promising numerical approaches is the tensor-network strong-disorder renormalization group (tSDRG), which was basically established for one-dimensional (1D) systems. In this paper, we propose a possible improvement of its algorithm toward 2D random spin systems, focusing on a generating process of the tree network structure of tensors, and precisely examine their performances for the random antiferromagnetic Heisenberg model not only on the 1D chain but also on the square- and triangular-lattices. On the basis of comparison with the exact numerical results up to 36 site systems, we demonstrate that accuracy of the optimal tSDRG algorithm is significantly improved for the 1D and 2D systems in the strong-randomness regime.

DOI
10.1103/physrevb.102.144439

Related papers

Entanglement-based tensor-network strong-disorder renormalization group

Kouichi Seki, Toshiya Hikihara, Kouichi Okunishi

We propose an entanglement-based algorithm of the tensor-network strong-disorder renormalization group (tSDRG) method for quantum spin systems with quenched randomness. In contrast to the previous tSDRG algorithm based on the energy spectrum of renormalized block Hamiltonians, we directly utilize the entanglement structure associated with the blocks to be renormalized. We examine accuracy of the algorithm for the random antiferromagnetic Heisenberg models on one-dimensional, triangular, and square lattices. We then find that the entanglement-based tSDRG achieves better accuracy than the previous one for the square-lattice model with weak randomness, while it is less efficient for the one-dimensional and triangular-lattice models particularly in the strong-randomness region. The theoretical background and possible improvements of the algorithm are also discussed.

arXiv:2107.01555•Physical review. B./Physical review. B•Oct 8, 2021•7 citations

Self-assembling tensor networks and holography in disordered spin chains

Andrew M. Goldsborough, Rudolf A. Römer

We show that the numerical strong disorder renormalization group algorithm of Hikihara et al. [Phys. Rev. B 60, 12116 (1999)] for the one-dimensional disordered Heisenberg model naturally describes a tree tensor network (TTN) with an irregular structure defined by the strength of the couplings. Employing the holographic interpretation of the TTN in Hilbert space, we compute expectation values, correlation functions, and the entanglement entropy using the geometrical properties of the TTN. We find that the disorder-averaged spin-spin correlation scales with the average path length through the tensor network while the entanglement entropy scales with the minimal surface connecting two regions. Furthermore, the entanglement entropy increases with both disorder and system size, resulting in an area-law violation. Our results demonstrate the usefulness of a self-assembling TTN approach to disordered systems and quantitatively validate the connection between holography and quantum many-body systems.

arXiv:1401.4874•Physical Review B•Jun 27, 2014•31 citations

Random spin-3/2 antiferromagnetic Heisenberg chains revisited

Yen-Tung Lin, Pochung Chen, Yu-Cheng Lin

We revisit the spin-reduction transition in the random spin-$3/2$ antiferromagnetic Heisenberg chain using the tensor-network strong-disorder renormalization group (tSDRG). The predicted transition separates two random-singlet (RS) phases: one formed by effective spin-$1/2$ moments at weaker disorder and the other by full spin-$3/2$ moments at stronger disorder. Within the Damle--Huse classification, this transition corresponds to an emergent permutation-symmetric $P_4$ multicritical point on a $P_2$ critical line associated with the RS phases. We first derive the critical exponents governing the disorder-averaged bulk and end-to-end correlation functions in the $P_n$ universality classes within the Damle--Huse framework. Using these theoretical predictions, together with a diagnostic constructed from the mean and variance of the energy-gap distribution, we identify the $P_4$ transition point and the reentrant behavior of the RS phase.

arXiv:2610.24994•Oct 18, 2026•0 citations

Machine Learning the Strong Disorder Renormalization Group Method for Disordered Quantum Spin Chains

A. Ustyuzhanin, J. Vahedi, S. Kettemann

We train machine learning algorithms to infer the entanglement structure of disordered long-range interacting quantum spin chains by learning from the strong disorder renormalisation group (SDRG) method. The system consists of $S=1/2$-quantum spins coupled by antiferromagnetic power-law interactions with decay exponent $α$ at random positions on a one-dimensional chain. Using SDRG as a physics-informed teacher, we compare a Random Forest classifier as a classical baseline with a graph neural network (GNN) that operates directly on the interaction graph and learns a bond-ranking rule mirroring the SDRG decimation policy. The GNN achieves a disorder-averaged pairing accuracy close to one and reproduces the entanglement entropy $S(\ell)$ in excellent quantitative agreement with SDRG across all subsystem sizes and interaction exponents. RG flow heat maps confirm that the GNN learns the sequential decimation hierarchy rather than merely fitting final-state observables. Finite-temperature entanglement properties are incorporated via the SDRGX framework through a two-stage strategy, using the zero-temperature GNN to generate the RG flow and sampling thermal occupations from the canonical ensemble, yielding results in agreement with both numerical SDRGX and analytical predictions without retraining.

cond-mat.dis-nnCross-listedarXiv:2603.05164•Machine Learning Science and Technology•Mar 6, 2026•0 citations

Modified Tucker Decomposition for Tensor Network and Fast Linearized Tensor Renormalization Group Algorithm for Two-Dimensional Quantum Spin Lattice Systems

Shi-Ju Ran, Wei Li, Gang Su

We propose a novel algorithm with a modified Tucker decomposition for tensor network that allows for efficiently and precisely calculating the ground state and thermodynamic properties of two-dimensional (2D) quantum spin lattice systems, and is coined as the fast linearized tensor renormalization group (fLTRG). Its amazing efficiency and precision are examined by studying the spin-1/2 anisotropic Heisenberg antiferromagnet on a honeycomb lattice, and the results are found to be fairly in agreement with the quantum Monte Carlo calculations. It is also successfully applied to tackle a quasi-2D spin-1/2 frustrated bilayer honeycomb Heisenberg model, where a quantum phase transition from an ordered antiferromagnetic state to a gapless quantum spin liquid phase is found. The thermodynamic behaviors of this frustrated spin system are also explored. The present fLTRG algorithm could be readily extended to other quantum lattice systems.

arXiv:1112.0392•Dec 2, 2011•0 citations

Adaptive-weighted tree tensor networks for disordered quantum many-body systems

Giovanni Ferrari, Giuseppe Magnifico, Simone Montangero

We introduce an adaptive-weighted tree tensor network for the study of disordered and inhomogeneous quantum many-body systems. This Ansatz is assembled on the basis of the random couplings of the physical system with a procedure that considers a tunable weight parameter to prevent completely unbalanced trees. Using this approach, we compute the ground state of the two-dimensional quantum Ising model in the presence of quenched random disorder and frustration, with lattice size up to $32\ifmmode\times\else\texttimes\fi{}32$. We compare the results with the ones obtained using the standard homogeneous tree tensor networks and the completely self-assembled tree tensor networks, demonstrating a clear improvement of numerical precision as a function of the weight parameter, especially for large system sizes.

arXiv:2111.12398•Physical review. B./Physical review. B•Jun 6, 2022•22 citations
Novel randomness-induced disordered ground states in two-dimensional (2D) quantum spin systems have been attracting much interest. For quantitative analysis of such random quantum spin systems, one of the most promising numerical approaches is the tensor-network strong-disorder renormalization group (tSDRG), which was basically established for one-dimensional (1D) systems. In this paper, we propose a possible improvement of its algorithm toward 2D random spin systems, focusing on a generating process of the tree network structure of tensors, and precisely examine their performances for the random antiferromagnetic Heisenberg model not only on the 1D chain but also on the square- and triangular-lattices. On the basis of comparison with the exact numerical results up to 36 site systems, we demonstrate that accuracy of the optimal tSDRG algorithm is significantly improved for the 1D and 2D systems in the strong-randomness regime.
We propose an entanglement-based algorithm of the tensor-network strong-disorder renormalization group (tSDRG) method for quantum spin systems with quenched randomness. In contrast to the previous tSDRG algorithm based on the energy spectrum of renormalized block Hamiltonians, we directly utilize the entanglement structure associated with the blocks to be renormalized. We examine accuracy of the algorithm for the random antiferromagnetic Heisenberg models on one-dimensional, triangular, and square lattices. We then find that the entanglement-based tSDRG achieves better accuracy than the previous one for the square-lattice model with weak randomness, while it is less efficient for the one-dimensional and triangular-lattice models particularly in the strong-randomness region. The theoretical background and possible improvements of the algorithm are also discussed.
We show that the numerical strong disorder renormalization group algorithm of Hikihara et al. [Phys. Rev. B 60, 12116 (1999)] for the one-dimensional disordered Heisenberg model naturally describes a tree tensor network (TTN) with an irregular structure defined by the strength of the couplings. Employing the holographic interpretation of the TTN in Hilbert space, we compute expectation values, correlation functions, and the entanglement entropy using the geometrical properties of the TTN. We find that the disorder-averaged spin-spin correlation scales with the average path length through the tensor network while the entanglement entropy scales with the minimal surface connecting two regions. Furthermore, the entanglement entropy increases with both disorder and system size, resulting in an area-law violation. Our results demonstrate the usefulness of a self-assembling TTN approach to disordered systems and quantitatively validate the connection between holography and quantum many-body systems.
We revisit the spin-reduction transition in the random spin-3/23/23/2 antiferromagnetic Heisenberg chain using the tensor-network strong-disorder renormalization group (tSDRG). The predicted transition separates two random-singlet (RS) phases: one formed by effective spin-1/21/21/2 moments at weaker disorder and the other by full spin-3/23/23/2 moments at stronger disorder. Within the Damle--Huse classification, this transition corresponds to an emergent permutation-symmetric P4P_4P4​ multicritical point on a P2P_2P2​ critical line associated with the RS phases. We first derive the critical exponents governing the disorder-averaged bulk and end-to-end correlation functions in the PnP_nPn​ universality classes within the Damle--Huse framework. Using these theoretical predictions, together with a diagnostic constructed from the mean and variance of the energy-gap distribution, we identify the P4P_4P4​ transition point and the reentrant behavior of the RS phase.
We train machine learning algorithms to infer the entanglement structure of disordered long-range interacting quantum spin chains by learning from the strong disorder renormalisation group (SDRG) method. The system consists of S=1/2S=1/2S=1/2-quantum spins coupled by antiferromagnetic power-law interactions with decay exponent ααα at random positions on a one-dimensional chain. Using SDRG as a physics-informed teacher, we compare a Random Forest classifier as a classical baseline with a graph neural network (GNN) that operates directly on the interaction graph and learns a bond-ranking rule mirroring the SDRG decimation policy. The GNN achieves a disorder-averaged pairing accuracy close to one and reproduces the entanglement entropy S(ℓ)S(\ell)S(ℓ) in excellent quantitative agreement with SDRG across all subsystem sizes and interaction exponents. RG flow heat maps confirm that the GNN learns the sequential decimation hierarchy rather than merely fitting final-state observables. Finite-temperature entanglement properties are incorporated via the SDRGX framework through a two-stage strategy, using the zero-temperature GNN to generate the RG flow and sampling thermal occupations from the canonical ensemble, yielding results in agreement with both numerical SDRGX and analytical predictions without retraining.
We propose a novel algorithm with a modified Tucker decomposition for tensor network that allows for efficiently and precisely calculating the ground state and thermodynamic properties of two-dimensional (2D) quantum spin lattice systems, and is coined as the fast linearized tensor renormalization group (fLTRG). Its amazing efficiency and precision are examined by studying the spin-1/2 anisotropic Heisenberg antiferromagnet on a honeycomb lattice, and the results are found to be fairly in agreement with the quantum Monte Carlo calculations. It is also successfully applied to tackle a quasi-2D spin-1/2 frustrated bilayer honeycomb Heisenberg model, where a quantum phase transition from an ordered antiferromagnetic state to a gapless quantum spin liquid phase is found. The thermodynamic behaviors of this frustrated spin system are also explored. The present fLTRG algorithm could be readily extended to other quantum lattice systems.
We introduce an adaptive-weighted tree tensor network for the study of disordered and inhomogeneous quantum many-body systems. This Ansatz is assembled on the basis of the random couplings of the physical system with a procedure that considers a tunable weight parameter to prevent completely unbalanced trees. Using this approach, we compute the ground state of the two-dimensional quantum Ising model in the presence of quenched random disorder and frustration, with lattice size up to $32\ifmmode\times\else\texttimes\fi{}32$. We compare the results with the ones obtained using the standard homogeneous tree tensor networks and the completely self-assembled tree tensor networks, demonstrating a clear improvement of numerical precision as a function of the weight parameter, especially for large system sizes.