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:2003.01138 · Physical review. B./Physical review. B

Mean-field entanglement transitions in random tree tensor networks

Javier Lopez-Piqueres, Brayden Ware, Romain Vasseur

Published Aug 6, 2020• 71 citations
arXivHTMLPDF

Abstract

Entanglement phase transitions in quantum chaotic systems subject to projective measurements and in random tensor networks have emerged as a new class of critical points separating phases with different entanglement scaling. We propose a mean-field theory of such transitions by studying the entanglement properties of random tree tensor networks. As a function of bond dimension, we find a phase transition separating area-law from logarithmic scaling of the entanglement entropy. Using a mapping onto a replica statistical mechanics model defined on a Cayley tree and the cavity method, we analyze the scaling properties of such transitions. Our approach provides a tractable, mean-field-like example of an entanglement transition. We verify our predictions numerically by computing directly the entanglement of random tree tensor network states.

DOI
10.1103/physrevb.102.064202

Related papers

Entanglement Entropy Transitions with Random Tensor Networks

Ryan Levy, Bryan K. Clark

Entanglement is a key quantum phenomena and understanding transitions between phases of matter with different entanglement properties are an interesting probe of quantum mechanics. We numerically study a model of a 2D tensor network proposed to have an entanglement entropy transition first considered by Vasseur et al.[Phys. Rev. B 100, 134203 (2019)]. We find that by varying the bond dimension of the tensors in the network we can observe a transition between an area and volume phase with a logarithmic critical point around $D\approx 2$. We further characterize the critical behavior measuring a critical exponent using entanglement entropy and the tripartite quantum mutual information, observe a crossover from a `nearly pure' to entangled area law phase using the the distributions of the entanglement entropy and find a cubic decay of the pairwise mutual information at the transition. We further consider the dependence of these observables for different Rényi entropy. This work helps further validate and characterize random tensor networks as a paradigmatic examples of an entanglement transition.

arXiv:2108.02225•Aug 4, 2021•8 citations

Measurement-induced criticality in random quantum circuits

Chao‐Ming Jian, Yi‐Zhuang You, Romain Vasseur +1 more

A new class of quantum entanglement transitions separating phases with different entanglement entropy scaling has been observed in recent numerical studies. Despite the numerical efforts, an analytical understanding of such transitions has remained elusive. Here, the authors propose a theory for the area-law to volume-law entanglement transition in many-body systems that undergo both random unitary evolutions and projective measurements. Using the replica method, the authors map analytically this entanglement transition to an ordering transition in a classical statistical mechanics model. They derive the general entanglement scaling properties at the transition and show a solvable limit where this transition can be mapped onto two-dimensional percolation.

arXiv:1908.08051•Physical review. B./Physical review. B•Mar 3, 2020•452 citations

Statistical mechanics model for Clifford random tensor networks and monitored quantum circuits

Yaodong Li, Romain Vasseur, Matthew P. A. Fisher +1 more

The authors explore critical properties of entanglement phase transitions in random tensor networks and monitored quantum circuits with Clifford tensors/gates for on-site Hilbert space dimensions which are powers of a prime number $p$. Exact mappings to replica spin models and characterizations of their symmetry groups predict that all universal properties will depend only on $p$. These predictions are confirmed with extensive numerical simulations. The authors also establish multifractal scaling of the purity, reflected in a continuous spectrum of critical exponents, while the typical exponent is the prefactor of the logarithm in the entanglement entropy.

arXiv:2110.02988•Physical review. B./Physical review. B•May 13, 2024•36 citations

Tensor networks and geometry for the modelling of disordered quantum many-body systems

Andrew M. Goldsborough, Rudolf A. Römer

Tensor networks provide a powerful and elegant approach to quantum manybody simulation. The simplest example is the density matrix renormalisation group (DMRG), which is based on the variational update of a matrix product state (MPS). It has proved to be the most accurate approach for the numerical study of strongly correlated one dimensional systems. We use DMRG to study the one dimensional disordered Bose-Hubbard model at fillings N=L = 1=2, 1 and 2 and show that the whole phase diagram for each can be successfully obtained by analysing entanglement properties alone. We �nd that the average entanglement is insufficient to accurately locate all of the phases, however using the standard error on the mean we are able to construct a phase diagram that is consistent with previous studies. It has recently been shown that there is a connection between the geometry of tensor networks and the entanglement and correlation properties that it can encode, which is a generalisation of the so called area law for entanglement entropy. This suggests that whilst gapped quantum systems can be accurately modeled using an MPS, a tensor network with a holographic geometry is natural to capture the logarithmic entanglement scaling and power law decaying correlation functions of critical systems. We create an algorithm for the disordered Heisenberg Hamiltonian that self assembles a tensor network based on the disorder in the couplings. The geometry created is that of a disordered tree tensor network (TTN) that when averaged has the holographic properties characteristic of critical systems. We continue the analysis of holographic tensor network geometry by considering the average length of leaf-to-leaf paths in various tree graphs, which is related to two-point correlation functions in tensor networks. For regular, complete trees we analytically calculate the average path length and all statistical moments, and generalise it for any splitting number. We then turn to the Catalan trees, which is the set of unique binary trees with n vertices, as it has a similar geometry to the disordered TTNs. We calculate the average depth of a leaf and show that it is equal to the average path length. We compare these analytic results with the structures found in the TTN and randomly constructed trees to show that the renormalisation involved in the TTN algorithm is crucial in the selection of the tree structure.

•Sep 13, 2026•0 citations

Entanglement transitions from holographic random tensor networks

Romain Vasseur, Andrew C. Potter, Yi‐Zhuang You +1 more

Universal features in patterns of entanglement of quantum states provide valuable information-theoretical insights into complex quantum many-body phases and dynamics. This work uncovers a novel class of phase transition between weakly- and strongly- entangled quantum states, described holographically at the boundary of a random tensor network. The univeral scaling structure of these transitions is explored via an exact mapping onto a classical spin model, which also opens the door to efficient numerical methods to study these complex quantum phenomena.

arXiv:1807.07082•Physical review. B./Physical review. B•Oct 9, 2019•216 citations

Entanglement transitions from restricted Boltzmann machines

Raimel A. Medina, Romain Vasseur, Maksym Serbyn

The search for novel entangled phases of matter has lead to the recent discovery of a new class of ``entanglement transitions,'' exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ans\"atze, we investigate under what conditions on the variational parameters these Ans\"atze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as $1/{r}^{\ensuremath{\alpha}}$ in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent $\ensuremath{\alpha}$. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions.

arXiv:2107.05735•Physical review. B./Physical review. B•Sep 30, 2021•35 citations
Entanglement phase transitions in quantum chaotic systems subject to projective measurements and in random tensor networks have emerged as a new class of critical points separating phases with different entanglement scaling. We propose a mean-field theory of such transitions by studying the entanglement properties of random tree tensor networks. As a function of bond dimension, we find a phase transition separating area-law from logarithmic scaling of the entanglement entropy. Using a mapping onto a replica statistical mechanics model defined on a Cayley tree and the cavity method, we analyze the scaling properties of such transitions. Our approach provides a tractable, mean-field-like example of an entanglement transition. We verify our predictions numerically by computing directly the entanglement of random tree tensor network states.
Entanglement is a key quantum phenomena and understanding transitions between phases of matter with different entanglement properties are an interesting probe of quantum mechanics. We numerically study a model of a 2D tensor network proposed to have an entanglement entropy transition first considered by Vasseur et al.[Phys. Rev. B 100, 134203 (2019)]. We find that by varying the bond dimension of the tensors in the network we can observe a transition between an area and volume phase with a logarithmic critical point around D≈2D\approx 2D≈2. We further characterize the critical behavior measuring a critical exponent using entanglement entropy and the tripartite quantum mutual information, observe a crossover from a `nearly pure' to entangled area law phase using the the distributions of the entanglement entropy and find a cubic decay of the pairwise mutual information at the transition. We further consider the dependence of these observables for different Rényi entropy. This work helps further validate and characterize random tensor networks as a paradigmatic examples of an entanglement transition.
A new class of quantum entanglement transitions separating phases with different entanglement entropy scaling has been observed in recent numerical studies. Despite the numerical efforts, an analytical understanding of such transitions has remained elusive. Here, the authors propose a theory for the area-law to volume-law entanglement transition in many-body systems that undergo both random unitary evolutions and projective measurements. Using the replica method, the authors map analytically this entanglement transition to an ordering transition in a classical statistical mechanics model. They derive the general entanglement scaling properties at the transition and show a solvable limit where this transition can be mapped onto two-dimensional percolation.
The authors explore critical properties of entanglement phase transitions in random tensor networks and monitored quantum circuits with Clifford tensors/gates for on-site Hilbert space dimensions which are powers of a prime number ppp. Exact mappings to replica spin models and characterizations of their symmetry groups predict that all universal properties will depend only on ppp. These predictions are confirmed with extensive numerical simulations. The authors also establish multifractal scaling of the purity, reflected in a continuous spectrum of critical exponents, while the typical exponent is the prefactor of the logarithm in the entanglement entropy.
Tensor networks provide a powerful and elegant approach to quantum manybody simulation. The simplest example is the density matrix renormalisation group (DMRG), which is based on the variational update of a matrix product state (MPS). It has proved to be the most accurate approach for the numerical study of strongly correlated one dimensional systems. We use DMRG to study the one dimensional disordered Bose-Hubbard model at fillings N=L = 1=2, 1 and 2 and show that the whole phase diagram for each can be successfully obtained by analysing entanglement properties alone. We �nd that the average entanglement is insufficient to accurately locate all of the phases, however using the standard error on the mean we are able to construct a phase diagram that is consistent with previous studies. It has recently been shown that there is a connection between the geometry of tensor networks and the entanglement and correlation properties that it can encode, which is a generalisation of the so called area law for entanglement entropy. This suggests that whilst gapped quantum systems can be accurately modeled using an MPS, a tensor network with a holographic geometry is natural to capture the logarithmic entanglement scaling and power law decaying correlation functions of critical systems. We create an algorithm for the disordered Heisenberg Hamiltonian that self assembles a tensor network based on the disorder in the couplings. The geometry created is that of a disordered tree tensor network (TTN) that when averaged has the holographic properties characteristic of critical systems. We continue the analysis of holographic tensor network geometry by considering the average length of leaf-to-leaf paths in various tree graphs, which is related to two-point correlation functions in tensor networks. For regular, complete trees we analytically calculate the average path length and all statistical moments, and generalise it for any splitting number. We then turn to the Catalan trees, which is the set of unique binary trees with n vertices, as it has a similar geometry to the disordered TTNs. We calculate the average depth of a leaf and show that it is equal to the average path length. We compare these analytic results with the structures found in the TTN and randomly constructed trees to show that the renormalisation involved in the TTN algorithm is crucial in the selection of the tree structure.
Universal features in patterns of entanglement of quantum states provide valuable information-theoretical insights into complex quantum many-body phases and dynamics. This work uncovers a novel class of phase transition between weakly- and strongly- entangled quantum states, described holographically at the boundary of a random tensor network. The univeral scaling structure of these transitions is explored via an exact mapping onto a classical spin model, which also opens the door to efficient numerical methods to study these complex quantum phenomena.
The search for novel entangled phases of matter has lead to the recent discovery of a new class of ``entanglement transitions,'' exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ans\"atze, we investigate under what conditions on the variational parameters these Ans\"atze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as $1/{r}^{\ensuremath{\alpha}}$ in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent $\ensuremath{\alpha}$. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions.