Entanglement entropy of random partitioning
Disordered Systems and Neural Networks
2022-02-18 v1
Abstract
We study the entanglement entropy of random partitions in one- and two-dimensional critical fermionic systems. In an infinite system we consider a finite, connected (hypercubic) domain of linear extent , the points of which with probability belong to the subsystem. The leading contribution to the average entanglement entropy is found to scale with the volume as , where is a non-universal function, to which there is a logarithmic correction term, . In the prefactor is given by , where is the central charge of the model and is a universal function. In the prefactor has a different functional form of below and above the percolation threshold.
Cite
@article{arxiv.1910.06018,
title = {Entanglement entropy of random partitioning},
author = {Gergö Roósz and István A. Kovács and Ferenc Iglói},
journal= {arXiv preprint arXiv:1910.06018},
year = {2022}
}
Comments
9 pages, 9 figures