We present a new strategy for contracting tensor networks in arbitrary geometries. This method is designed to follow as strictly as possible the renormalization group philosophy, by first contracting tensors in an exact way and, then, performing a co
ntrolled truncation of the resulting tensor. We benchmark this approximation procedure in two dimensions against an exact contraction. We then apply the same idea to a three dimensional system. The underlying rational for emphasizing the exact coarse graining renormalization group step prior to truncation is related to monogamy of entanglement.
Entanglement entropy obeys area law scaling for typical physical quantum systems. This may naively be argued to follow from locality of interactions. We show that this is not the case by constructing an explicit simple spin chain Hamiltonian with nea
rest neighbor interactions that presents an entanglement volume scaling law. This non-translational model is contrived to have couplings that force the accumulation of singlet bonds across the half chain. Our result is complementary to the known relation between non-translational invariant, nearest neighbor interacting Hamiltonians and QMA complete problems.
We review some of the recent progress on the study of entropy of entanglement in many-body quantum systems. Emphasis is placed on the scaling properties of entropy for one-dimensional multi-partite models at quantum phase transitions and, more genera
lly, on the concept of area law. We also briefly describe the relation between entanglement and the presence of impurities, the idea of particle entanglement, the evolution of entanglement along renormalization group trajectories, the dynamical evolution of entanglement and the fate of entanglement along a quantum computation.
We construct a quantum algorithm that creates the Laughlin state for an arbitrary number of particles $n$ in the case of filling fraction one. This quantum circuit is efficient since it only uses $n(n-1)/2$ local qudit gates and its depth scales as $
2n-3$. We further prove the optimality of the circuit using permutation theory arguments and we compute exactly how entanglement develops along the action of each gate. Finally, we discuss its experimental feasibility decomposing the qudits and the gates in terms of qubits and two qubit-gates as well as the generalization to arbitrary filling fraction.
