Claim record · edition 0.1.0
MERA introduces disentanglers before coarse-graining, allowing it to reproduce the entanglement scaling of critical systems that a tree tensor network cannot.
A unitary applied across block boundaries removes short-range entanglement that would otherwise have to be carried upward through the isometries, so the network reaches logarithmic entanglement scaling.
Limits of this claim
The cost prefactor in the bond dimension is high, and the higher-dimensional generalization is substantially harder than the one-dimensional construction.
Supporting sources
primary paper · identifier verified
Entanglement renormalization
Guifré Vidal · 2005
arXiv:cond-mat/0512165
Introduces entanglement renormalization and the disentangler that distinguishes MERA from a plain tree network.
Source record →primary paper · identifier verified
A class of quantum many-body states that can be efficiently simulated
G. Vidal · 2006
arXiv:quant-ph/0610099
Primary source for the MERA ansatz and its efficient contraction, including the scale-invariant construction.
Source record →