Talk page
Title:
Fradkin, Fredkin or Fridkin?
Speaker:
Abstract:
Recently, a class of exactly solvable spin chains with highly entangled ground states has attracted much attention. The models are closely related to combinatorial problems such as the enumeration of lattice paths. A simple example is the Fredkin spin chain introduced by Salberger and Korepin, in which the unique ground state can be expressed in terms of colored Dyck paths. In this talk, I will introduce a generalization of the Fredkin spin chain with one adjustable parameter $t$. The unique ground state of the generalized model is written as a weighted superposition of colored Dyck paths. The entanglement entropy (EE) in the ground state depends on both the deformation parameter $t$ and the number of colors $s$. I will discuss various properties of the model. In particular, I will show that the entanglement entropy scales linearly with the system size when $t>1$ and $s>1$.
Link:
Workshop: