Related papers: Entanglement Entropy From Tensor Network States fo…
The entanglement entropy of a free scalar field in its ground state is dominated by an area law term. It is noteworthy, however, that the study of entanglement in scalar field theory has not advanced far beyond the ground state. In this…
For the purpose of clarifying a new approach to understanding quantum entanglement using thermofield dynamics (TFD), entanglement entropies of non-equilibrium finite-spin systems are examined for both traditional and extended cases. The…
We develop a graph-based method to study the entanglement entropy of Calderbank-Shor-Steane quantum codes. This method offers a straightforward interpretation for the entanglement entropy of quantum error correcting codes through…
A new numerical approach to entanglement entropies of the Renyi type is proposed for one-dimensional quantum field theories. The method extends the truncated conformal spectrum approach and we will demonstrate that it is especially suited…
In this thesis I present numerical studies of entanglement entropy and the quantum null energy condition in strongly coupled far-from-equilibrium quantum states using holography. I give a careful introduction into the numerical methods used…
Tensor-network codes enable the construction of large stabilizer codes out of tensors describing smaller stabilizer codes. An application of tensor-network codes was an efficient and exact decoder for holographic codes. Here, we show how to…
We consider the bipartite entanglement entropy of ground states of extended quantum systems with a large degeneracy. Often, as when there is a spontaneously broken global Lie group symmetry, basis elements of the lowest-energy space form a…
We study the structure of entanglement in a supersymmetric lattice model of fermions on certain types of decorated graphs with quenched disorder. In particular, we construct models with controllable ground state degeneracy protected by…
We propose a simple connection between matrix quantum mechanics and tensor networks. This allows us to imbue tensor networks with some interesting additional structure. The geometry of the graph describing the tensor network state is…
The exact treatment of Markovian models of complex systems requires knowledge of probability distributions exponentially large in the number of components $n$. Mean-field approximations provide an effective reduction in complexity of the…
Entanglement-based quantum networks exhibit a unique flexibility in the choice of entangled resource states that are then locally manipulated by the nodes to fulfill any request in the network. Furthermore, this manipulation is not uniquely…
This review focuses on the field of quantum entanglement applied to condensed matter physics systems with strong correlations, a domain which has rapidly grown over the last decade. By tracing out part of the degrees of freedom of…
Here we investigate the connection between topological order and the geometric entanglement, as measured by the logarithm of the overlap between a given state and its closest product state of blocks. We do this for a variety of…
The entanglement entropy of the $\nu = 1/3$ and $\nu = 5/2$ quantum Hall states in the presence of short range random disorder has been calculated by direct diagonalization. A microscopic model of electron-electron interaction is used,…
We study entanglement properties of systems with spontaneously broken continuous symmetry. We find that in addition to the expected area law behavior, the entanglement entropy contains a subleading contribution which diverges…
The entanglement entropy can be an effective diagnostic tool for probing topological phase transitions. In one-dimensional single particle systems, the periodic driving generates a variety of topological phases and edge modes. In this work,…
Binary Tree States (BTS) are states whose decomposition on a quantum register basis formed by a set of qubits can be made sequentially. Such states sometimes appear naturally in many-body systems treated in Fock space when a global symmetry…
An efficient algorithm is constructed for contracting two-dimensional tensor networks under periodic boundary conditions. The central ingredient is a novel renormalization step that scales linearly with system size, i.e. from $L \to L+1$.…
We consider the problem of a generic stabilizer Hamiltonian under local, incoherent Pauli errors. Using two different approaches -- (i) Haah's polynomial formalism arXiv:1204.1063 and (ii) the homological perspective on CSS codes -- we…
Sparse tensor networks are commonly used to represent contractions over sparse tensors. Tensor contractions are higher-order analogs of matrix multiplication. Tensor networks arise commonly in many domains of scientific computing and data…