Physical Review B · 2009 · 252 citations · 50 references
Quantum Lattice SystemEngineeringMany-body Quantum PhysicLocal HamiltonianQuantum ComputingEntropic Area LawQuantum SimulationQuantum EntanglementQuantum SciencePhysicsQuantum Field TheoryQuantum AlgorithmTree Tensor NetworkTwo-dimensional Quantum SystemsEntropyNatural SciencesDisordered Quantum SystemQuantum DevicesQuantum SystemGround State
This work explores the use of a tree tensor network ansatz to simulate the ground state of a local Hamiltonian on a two-dimensional lattice. By exploiting the entropic area law, the tree tensor network ansatz seems to produce quasiexact results in systems with sizes well beyond the reach of exact diagonalization techniques. We describe an algorithm to approximate the ground state of a local Hamiltonian on a $L\ifmmode\times\else\texttimes\fi{}L$ lattice with the topology of a torus. Accurate results are obtained for $L={4,6,8}$, whereas approximate results are obtained for larger lattices. As an application of the approach, we analyze the scaling of the ground-state entanglement entropy at the quantum critical point of the model. We confirm the presence of a positive additive constant to the area law for half a torus. We also find a logarithmic additive correction to the entropic area law for a square block. The single copy entanglement for half a torus reveals similar corrections to the area law with a further term proportional to $1/L$.
50
The density-matrix renormalization group
Ulrich Schollwöck · Reviews of Modern Physics · 2005 · 3.3K citations · Full text
Concentrating partial entanglement by local operations
Charles H. Bennett, H. J. Bernstein, Sandu Popescu et al. · Physical Review A · 1996 · 3K citations · Full text
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Guifré Vidal · Physical Review Letters · 2003 · 2.3K citations · Full text