Entanglement of Free Fermions on Johnson Graphs
arXiv:2104.11581 · doi:10.1063/5.0099879
Abstract
Free fermions on Johnson graphs are considered and the entanglement entropy of sets of neighborhoods is computed. For a subsystem composed of a single neighborhood, an analytical expression is provided by the decomposition in irreducible submodules of the Terwilliger algebra of embedded in two copies of . For a subsytem composed of multiple neighborhoods, the construction of a block-tridiagonal operator which commutes with the entanglement Hamiltonian is presented, its usefulness in computing the entropy is stressed and the area law pre-factor is discussed.
arXiv comment24 pages
References in corpus (14)
- The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue
- Calculation of reduced density matrices from correlation functions
- Reduced density matrices and entanglement entropy in free lattice models
- Entanglement in solvable many-particle models
- A short review on entanglement in quantum spin systems
- Free-Fermion entanglement and orthogonal polynomials
- Algebraic Heun operator and band-time limiting
- Algebraic Bethe Ansatz for the XXZ Gaudin Models with Generic Boundary
- A duality principle for the multi-block entanglement entropy of free fermion systems
- Heun operator of Lie type and the modified algebraic Bethe ansatz
- Entanglement of Free Fermions on Hadamard Graphs
- Truncation of the reflection algebra and the Hahn algebra
- Entanglement entropy in the Hamming networks
- Entanglement entropy in the Hypercube networks
Cited by in corpus (8)
- Bivariate -polynomial association schemes
- The Clebsch--Gordan coefficients of and the Terwilliger algebras of Johnson graphs
- Fermionic logarithmic negativity in the Krawtchouk chain
- Absence of logarithmic enhancement in the entanglement scaling of free fermions on folded cubes
- An imperceptible connection between the Clebsch--Gordan coefficients of and the Terwilliger algebras of Grassmann graphs
- The Clebsch-Gordan Rule for , the Krawtchouk Algebras and the Hamming Graphs
- Entanglement of free-fermion systems, signal processing and algebraic combinatorics
- The Terwilliger algebra of symplectic dual polar graphs, the subspace lattices and