Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The European Physical Journal Plus

Entanglement entropy of free fermions on directed graphs

M. A. Jafarizadeh, F. Eghbalifam, S. Nami

Published Dec 1, 2017• 6 citations
Publisher
DOI
10.1140/epjp/i2017-11805-1

Related papers

Entanglement entropy, the reduced density matrices of free fermions, and beyond

Pasquale Calabrese

Journal of Physics A Mathematical and Theoretical•Sep 23, 2016•10 citations

The Absence of the Selfaveraging Property of the Entanglement Entropy of Disordered Free Fermions in One Dimension

Leonid Andreevich Pastur, Victor V. Slavin

arXiv:1703.06054•Journal of Statistical Physics•Nov 27, 2017•12 citations

Entanglement entropy scaling laws and eigenstate thermalization in free fermion systems

Hsin-Hua Lai, Kun Yang

Bulletin of the American Physical Society•Mar 2, 2015•0 citations

Entanglement entropy in the spinless free fermion model and its application to the graph isomorphism problem

M. A. Jafarizadeh, F. Eghbalifam, S. Nami

Abstract In this paper, the entanglement entropy is investigated in the ground state of a spinless free fermion Hamiltonian where its hopping matrix is given by the adjacency matrix of the graph. The bipartite entanglement entropy is calculated from the eigenvalues of the correlation matrix. The entanglement entropy and mutual information are calculated for some scalable graphs including a complete graph and three sets of strongly regular graphs (SRGs). In addition, the volume law scaling has been shown for these graphs. Then, we use the entanglement entropy as a tool for studying the graph isomorphism problem in some non-isomorphic pairs of graphs in order to distinguish them from each other. Two graphs are isomorphic when they are related to each other by relabeling the graph vertices. We study the graph isomorphism in non-isomorphic SRGs, distance-regular graphs and pseudo distance-regular graphs. Most pairs of non-isomorphic SRGs can be distinguished from each other by using fermionic entanglement entropy.

Journal of Physics A Mathematical and Theoretical•Jan 19, 2018•5 citations

Calculation of Entanglement Entropy in Fermion Lattices

Michelle Storms, Rajiv R. P. Singh

Bulletin of the American Physical Society•Oct 4, 2013•0 citations

Entanglement of free fermions on Johnson graphs

Pierre-Antoine Bernard, Nicolas Crampé, Luc Vinet

Free fermions on Johnson graphs J(n, k) 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 J(n, k) embedded in two copies of su(2). For a subsystem composed of multiple neighborhoods, the construction of a block-tridiagonal operator that commutes with the entanglement Hamiltonian is presented, its usefulness in computing the entropy is stressed, and the area law pre-factor is discussed.

arXiv:2104.11581•Journal of Mathematical Physics•Jun 1, 2023•22 citations
Abstract In this paper, the entanglement entropy is investigated in the ground state of a spinless free fermion Hamiltonian where its hopping matrix is given by the adjacency matrix of the graph. The bipartite entanglement entropy is calculated from the eigenvalues of the correlation matrix. The entanglement entropy and mutual information are calculated for some scalable graphs including a complete graph and three sets of strongly regular graphs (SRGs). In addition, the volume law scaling has been shown for these graphs. Then, we use the entanglement entropy as a tool for studying the graph isomorphism problem in some non-isomorphic pairs of graphs in order to distinguish them from each other. Two graphs are isomorphic when they are related to each other by relabeling the graph vertices. We study the graph isomorphism in non-isomorphic SRGs, distance-regular graphs and pseudo distance-regular graphs. Most pairs of non-isomorphic SRGs can be distinguished from each other by using fermionic entanglement entropy.
Free fermions on Johnson graphs J(n, k) 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 J(n, k) embedded in two copies of su(2). For a subsystem composed of multiple neighborhoods, the construction of a block-tridiagonal operator that commutes with the entanglement Hamiltonian is presented, its usefulness in computing the entropy is stressed, and the area law pre-factor is discussed.