![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical Physics Seminars > Self-assembling tensor networks, holography in disordered spin chains and leaf-to-leaf distances in graphs
![]() Self-assembling tensor networks, holography in disordered spin chains and leaf-to-leaf distances in graphsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Mike Gunn. 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. This talk is part of the Theoretical Physics Seminars series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsAstrophysics Talks Series Type the title of a new list here analysisOther talks[Friday seminar]: Irradiated brown dwarfs in the desert Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems The percolating cluster is invisible to image recognition with deep learning Many-body localization from Hilbert- and real-space points of view Signatures of structural criticality and universality in the cellular anatomy of the brain |