REVIEW 3 cited by
Entanglement on linked boundaries in Chern-Simons theory with generic gauge groups
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We study the entanglement for a state on linked torus boundaries in $3d$ Chern-Simons theory with a generic gauge group and present the asymptotic bounds of R\'enyi entropy at two different limits: (i) large Chern-Simons coupling $k$, and (ii) large rank $r$ of the gauge group. These results show that the R\'enyi entropies cannot diverge faster than $\ln k$ and $\ln r$, respectively. We focus on torus links $T(2,2n)$ with topological linking number $n$. The R\'enyi entropy for these links shows a periodic structure in $n$ and vanishes whenever $n = 0 \text{ (mod } \textsf{p})$, where the integer $\textsf{p}$ is a function of coupling $k$ and rank $r$. We highlight that the refined Chern-Simons link invariants can remove such a periodic structure in $n$.
Forward citations
Cited by 3 Pith papers
-
Large-party limit of topological entanglement entropy in Chern-Simons theory
As the number of parties d grows to infinity, the entanglement entropy of Chern-Simons torus-link states is carried only by Abelian anyons and is bounded above by ln|Z_G|.
-
Analyzing reduced density matrices in SU(2) Chern-Simons theory
For p-party pure states from T_{p,p} torus link complements in SU(2)_k Chern-Simons theory, the characteristic polynomials of (1|p-1)-reduced density matrices are monic polynomials with rational coefficients.
-
Entanglement distillation of boundary states of large N SU(N)1, Chern-Simons theory and Riemann surfaces
A tree tensor network for distilling SU(N)_1 Chern-Simons boundary states is proposed, but its key fusion-matrix identification is asserted without derivation.
Discussion (0). Continue with ORCID to comment.