REVIEW 3 cited by
Seeing topological entanglement through the information convex
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
The information convex allows us to look into certain information-theoretic constraints in two-dimensional topological orders. We provide a derivation of the topological contribution $\ln d_a$ to the von Neumann entropy, where $d_a$ is the quantum dimension of anyon $a$. This value emerges as the only value consistent with strong subadditivity, assuming a certain topological dependence of the information convex structure. In particular, it is assumed that the fusion multiplicities are coherently encoded in a 2-hole disk. A similar contribution ($\ln d_{\alpha}$) is derived for gapped boundaries. This method further allows us to identify the fusion probabilities and certain constraints on the fusion theory. We also derive a linear bound on the circuit depth of unitary non-Abelian string operators and discuss how it generalizes and changes in the presence of a gapped boundary.
Forward citations
Cited by 3 Pith papers
-
A systematic search for conformal field theories in very small spaces
A symmetry-free entropy search on four-site states recovers known CFTs and yields unclassified candidate CFTs with 1<c<2.
-
A Universal Circuit Set Using the $S_3$ Quantum Double
A complete circuit-level blueprint for universal quantum computation using the D(S3) quantum double, with anyon interferometry and a concatenated local error-correcting code.
-
Ishibashi States, Topological Orders with Boundaries and Topological Entanglement Entropy II -- Cutting through the boundary
When an entanglement cut ends on a gapped boundary of a 2+1D topological phase, the topological entanglement entropy is controlled by the half-linking matrix, which replaces the modular S matrix used without boundaries.
Discussion (0). Continue with ORCID to comment.