Entanglement entropy and treewidth
Area laws are the physics of bounded width.
Area laws bound the width
A quantum state obeys an area law when the entanglement entropy across any region scales with the boundary of that region rather than its volume. Boundary scaling is exactly the condition that keeps cut sizes — and therefore effective treewidth — bounded. That is the deep reason area-law ground states are efficiently representable classically.
Volume-law entanglement is the opposite: entropy that grows with the bulk, which forces cuts and treewidth to grow too. Volume-law states are the hard ones, and they are exactly where classical simulation cost explodes.
The bridge to the meter
Entanglement entropy is the physicist's name for the same quantity treewidth measures combinatorially: the amount of information that must cross a cut. Area law versus volume law is bounded versus growing treewidth, restated in the language of physics.
Questions
Why are area-law states easy to simulate?
Because bounded boundary entanglement means bounded effective treewidth, and bounded treewidth means efficient contraction — e.g. via matrix product states in one dimension.
What breaks classical simulation?
Volume-law entanglement: entropy growing with system size forces treewidth to grow, and the cost follows exponentially.