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:1807.08984 · Journal of Statistical Mechanics Theory and Experiment

Improved matrix product operator renormalization group: application to the N -color random Ashkin–Teller chain

Christophe Chatelain

Published Sep 1, 2019• 3 citations
arXivHTMLPDF

Abstract

Abstract Strong-disorder renormalization group (SDRG), despite being a relatively simple real-space renormalization procedure, provides in principle exact results on the critical properties at the infinite-randomness fixed point of random quantum spin chains. Numerically, SDRG can be efficiently implemented as a renormalization of matrix product operators (MPO-RG). By considering larger blocks than SDRG, MPO-RG was recently used to compute non-critical quantities of finite chains that are inaccessible to SDRG. In this work, the accuracy of this approach is studied and two simple and fast improvements are proposed. The accuracy on the ground state energy is improved by a factor at least equal to four for the random Ising chain in a transverse field. Finally, the proposed algorithms are shown to yield Binder cumulants of the three-color random Ashkin–Teller chain that are compatible with a second-order phase transition while a first-order one is predicted by the original MPO-RG algorithm.

DOI
10.1088/1742-5468/ab3785

Related papers

Quantifying and improving the accuracy of the Matrix Product Operator Renormalization Group of random spin chains

Christophe Chatelain

A relatively simple real-space renormalization procedure, due to Ma and Dasgupta and known as Strong-Disorder Renormalization Group (SDRG), provides in principle exact results on the critical properties at the infinite-randomness fixed point of random spin chains. Numerically, SDRG can be efficiently implemented as a renormalization of Matrix Product Operators (MPO-RG). By considering larger blocks than SDRG, MPO-RG was recently used to compute non-critical quantities that are inaccessible to SDRG. In this work, we study the accuracy of the approach and propose two simple and fast improvements. We observe that the accuracy on the ground state energy is improved by a factor at least equal to 4.

•Jul 19, 2018•1 citation

Strong-randomness phenomena in quantum Ashkin–Teller models

Hatem Barghathi, Fawaz Y. Hrahsheh, José A. Hoyos +2 more

The N -color quantum Ashkin–Teller spin chain is a prototypical model for the study of strong-randomness phenomena at first-order and continuous quantum phase transitions. In this paper, we first review the existing strong-disorder renormalization group approaches to the random quantum Ashkin–Teller chain in the weak-coupling as well as the strong-coupling regimes. We then introduce a novel general variable transformation that unifies the treatment of the strong-coupling regime. This allows us to determine the phase diagram for all color numbers N , and the critical behavior for all . In the case of two colors, N = 2, a partially ordered product phase separates the paramagnetic and ferromagnetic phases in the strong-coupling regime. This phase is absent for all , i.e., there is a direct phase boundary between the paramagnetic and ferromagnetic phases. In agreement with the quantum version of the Aizenman–Wehr theorem, all phase transitions are continuous, even if their clean counterparts are of first order. We also discuss the various critical and multicritical points. They are all of infinite-randomness type, but depending on the coupling strength, they belong to different universality classes.

arXiv:1404.2509•Physica Scripta•Oct 1, 2015•18 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•1 citation

Transverse spin correlations of the random transverse-field Ising model

Ferenc Iglói, István A. Kovács

The critical behavior of the random transverse-field Ising model in finite-dimensional lattices is governed by infinite disorder fixed points, several properties of which have already been calculated by the use of the strong disorder renormalization-group (SDRG) method. Here we extend these studies and calculate the connected transverse-spin correlation function by a numerical implementation of the SDRG method in $d=1,2$, and 3 dimensions. At the critical point an algebraic decay of the form $\ensuremath{\sim}{r}^{\ensuremath{-}{\ensuremath{\eta}}_{t}}$ is found, with a decay exponent being approximately ${\ensuremath{\eta}}_{t}\ensuremath{\approx}2+2d$. In $d=1$ the results are related to dimer-dimer correlations in the random antiferromagnetic $XX$ chain and have been tested by numerical calculations using free-fermionic techniques.

arXiv:1712.07467•Physical review. B./Physical review. B•Mar 21, 2018•5 citations

Exact renormalization of the random transverse-field Ising spin chain in the strongly ordered and strongly disordered Griffiths phases

Ferenc Iglói

Fisher's [Phys. Rev. B $51,$ 6411 (1995)] real-space renormalization-group (RG) treatment of random transverse-field Ising spin chains is extended into the strongly ordered and strongly disordered Griffiths phases, and asymptotically exact results are obtained. In the noncritical region the asymmetry of the renormalization of the couplings and the transverse fields is related to a nonlinear quantum control parameter \ensuremath{\Delta}, which is a natural measure of the distance from the quantum critical point. \ensuremath{\Delta}, which is found to stay invariant along the RG trajectories, and has been expressed by the initial disorder distributions, stands in the singularity exponents of different physical quantities (magnetization, susceptibility, specific heat, etc.), which are exactly calculated. In this way we have observed a weak-universality scenario: the Griffiths-McCoy singularities do not depend on the form of the disorder, provided the nonlinear quantum control parameter has the same value. The exact scaling function of the magnetization with a small applied magnetic field is calculated, and the critical point magnetization singularity is determined in a simple, direct way.

arXiv:cond-mat/0108350•Physical review. B, Condensed matter•Jan 16, 2002•63 citations

Renormalization group study of random quantum magnets

István A. Kovács, Ferenc Iglói

We have developed a very efficient numerical algorithm of the strong disorder renormalization group method to study the critical behaviour of the random transverse field Ising model, which is a prototype of random quantum magnets. With this algorithm we can renormalize an N-site cluster within a time NlogN, independently of the topology of the graph, and we went up to N ∼ 4 × 10(6). We have studied regular lattices with dimension D ≤ 4 as well as Erdős-Rényi random graphs, which are infinite dimensional objects. In all cases the quantum critical behaviour is found to be controlled by an infinite disorder fixed point, in which disorder plays a dominant role over quantum fluctuations. As a consequence the renormalization procedure as well as the obtained critical properties are asymptotically exact for large systems. We have also studied Griffiths singularities in the paramagnetic and ferromagnetic phases and generalized the numerical algorithm for other random quantum systems.

arXiv:1109.4267•Journal of Physics Condensed Matter•Sep 19, 2011•60 citations
Abstract Strong-disorder renormalization group (SDRG), despite being a relatively simple real-space renormalization procedure, provides in principle exact results on the critical properties at the infinite-randomness fixed point of random quantum spin chains. Numerically, SDRG can be efficiently implemented as a renormalization of matrix product operators (MPO-RG). By considering larger blocks than SDRG, MPO-RG was recently used to compute non-critical quantities of finite chains that are inaccessible to SDRG. In this work, the accuracy of this approach is studied and two simple and fast improvements are proposed. The accuracy on the ground state energy is improved by a factor at least equal to four for the random Ising chain in a transverse field. Finally, the proposed algorithms are shown to yield Binder cumulants of the three-color random Ashkin–Teller chain that are compatible with a second-order phase transition while a first-order one is predicted by the original MPO-RG algorithm.
A relatively simple real-space renormalization procedure, due to Ma and Dasgupta and known as Strong-Disorder Renormalization Group (SDRG), provides in principle exact results on the critical properties at the infinite-randomness fixed point of random spin chains. Numerically, SDRG can be efficiently implemented as a renormalization of Matrix Product Operators (MPO-RG). By considering larger blocks than SDRG, MPO-RG was recently used to compute non-critical quantities that are inaccessible to SDRG. In this work, we study the accuracy of the approach and propose two simple and fast improvements. We observe that the accuracy on the ground state energy is improved by a factor at least equal to 4.
The N -color quantum Ashkin–Teller spin chain is a prototypical model for the study of strong-randomness phenomena at first-order and continuous quantum phase transitions. In this paper, we first review the existing strong-disorder renormalization group approaches to the random quantum Ashkin–Teller chain in the weak-coupling as well as the strong-coupling regimes. We then introduce a novel general variable transformation that unifies the treatment of the strong-coupling regime. This allows us to determine the phase diagram for all color numbers N , and the critical behavior for all . In the case of two colors, N = 2, a partially ordered product phase separates the paramagnetic and ferromagnetic phases in the strong-coupling regime. This phase is absent for all , i.e., there is a direct phase boundary between the paramagnetic and ferromagnetic phases. In agreement with the quantum version of the Aizenman–Wehr theorem, all phase transitions are continuous, even if their clean counterparts are of first order. We also discuss the various critical and multicritical points. They are all of infinite-randomness type, but depending on the coupling strength, they belong to different universality classes.
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.
The critical behavior of the random transverse-field Ising model in finite-dimensional lattices is governed by infinite disorder fixed points, several properties of which have already been calculated by the use of the strong disorder renormalization-group (SDRG) method. Here we extend these studies and calculate the connected transverse-spin correlation function by a numerical implementation of the SDRG method in d=1,2d=1,2d=1,2, and 3 dimensions. At the critical point an algebraic decay of the form $\ensuremath{\sim}{r}^{\ensuremath{-}{\ensuremath{\eta}}_{t}}$ is found, with a decay exponent being approximately ${\ensuremath{\eta}}_{t}\ensuremath{\approx}2+2d$. In d=1d=1d=1 the results are related to dimer-dimer correlations in the random antiferromagnetic XXXXXX chain and have been tested by numerical calculations using free-fermionic techniques.
Fisher's [Phys. Rev. B 51,51,51, 6411 (1995)] real-space renormalization-group (RG) treatment of random transverse-field Ising spin chains is extended into the strongly ordered and strongly disordered Griffiths phases, and asymptotically exact results are obtained. In the noncritical region the asymmetry of the renormalization of the couplings and the transverse fields is related to a nonlinear quantum control parameter \ensuremath{\Delta}, which is a natural measure of the distance from the quantum critical point. \ensuremath{\Delta}, which is found to stay invariant along the RG trajectories, and has been expressed by the initial disorder distributions, stands in the singularity exponents of different physical quantities (magnetization, susceptibility, specific heat, etc.), which are exactly calculated. In this way we have observed a weak-universality scenario: the Griffiths-McCoy singularities do not depend on the form of the disorder, provided the nonlinear quantum control parameter has the same value. The exact scaling function of the magnetization with a small applied magnetic field is calculated, and the critical point magnetization singularity is determined in a simple, direct way.
We have developed a very efficient numerical algorithm of the strong disorder renormalization group method to study the critical behaviour of the random transverse field Ising model, which is a prototype of random quantum magnets. With this algorithm we can renormalize an N-site cluster within a time NlogN, independently of the topology of the graph, and we went up to N ∼ 4 × 10(6). We have studied regular lattices with dimension D ≤ 4 as well as Erdős-Rényi random graphs, which are infinite dimensional objects. In all cases the quantum critical behaviour is found to be controlled by an infinite disorder fixed point, in which disorder plays a dominant role over quantum fluctuations. As a consequence the renormalization procedure as well as the obtained critical properties are asymptotically exact for large systems. We have also studied Griffiths singularities in the paramagnetic and ferromagnetic phases and generalized the numerical algorithm for other random quantum systems.