Related papers: Entanglement of free-fermion systems, signal proce…
This work proposes a minimal model extending the duality between classical statistical spin systems and fermionic systems beyond the case of free fermions. A Jordan-Wigner transformation applied to a two-dimensional tensor network maps the…
Frustration-free Hamiltonians provide pivotal models for understanding quantum many-body systems. In this paper, we establish a general framework for frustration-free fermionic systems. First, we derive a necessary and sufficient condition…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
We develop a general theory of frustration-free free-fermion systems and derive the necessary and sufficient conditions for such Hamiltonians. Assuming locality and translation invariance, we find that any band touching between the valence…
We exploit and clarify the use of random matrix theory for the calculation of the entanglement entropy of free Fermi gases. We apply this method to obtain analytic predictions for Renyi entanglement entropies of a one-dimensional gas…
We study the half system entanglement Hamiltonians of the ground state of free fermion critical transverse field Ising model with periodic boundary conditions in the presence of defects. In general, we observe that these defects introduce…
The Jordan-Wigner transformation is frequently utilised to rewrite quantum spin chains in terms of fermionic operators. When the resulting Hamiltonian is bilinear in these fermions, i.e. the fermions are free, the exact spectrum follows…
We investigate the dynamics of Entanglement Hamiltonians (EHs) in dissipative free-fermionic systems using a recent operator-based formulation of the quasiparticle picture. Focusing on gain and loss dissipation, we study the post-quench…
We initiate the study of combinatorial algorithms for Triangle Detection in $H$-free graphs. The goal is to decide if a graph that forbids a fixed pattern $H$ as a subgraph contains a triangle, using only "combinatorial" methods that…
We discuss the relation between fermion entanglement and bipartite entanglement. We first show that an exact correspondence between them arises when the states are constrained to have a definite local number parity. Moreover, for arbitrary…
Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…
We studied numerically the distribution of the entanglement Hamiltonian eigenvalues in two one-dimensional free fermion models and the typical three-dimensional Anderson model. We showed numerically that this distribution depends on the…
We consider the problem of estimating undirected triangle-free graphs of high dimensional distributions. Triangle-free graphs form a rich graph family which allows arbitrary loopy structures but 3-cliques. For inferential tractability, we…
This article introduces and discusses the concept of entanglement detachment. Under some circumstances, enlarging a few couplings of a Hamiltonian can effectively detach a (possibly disjoint) block within the ground state. This detachment…
The paper examines a trapped one-dimensional system of multicomponent spinless fermions that interact with a zero-range two-body potential. We show that when the repulsion between particles is very large the system can be approached…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
In this letter we study the negativity of one dimensional free fermions. We derive the general form of the $\mathbb{Z}_{N}$ symmetric term in moments of the partial transposed (reduced) density matrix, which is an algebraic function of the…
We propose a framework for optimal $t$-matchings excluding the prescribed $t$-factors in bipartite graphs. The proposed framework is a generalization of the nonbipartite matching problem and includes several problems, such as the…
We construct entanglement renormalization schemes which provably approximate the ground states of non-interacting fermion nearest-neighbor hopping Hamiltonians on the one-dimensional discrete line and the two-dimensional square lattice.…
We give a linear-time algorithm to decide 3-colorability of a triangle-free graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the…