The complexity of Area-lawed Hamiltonians
One could consider the following slightly silly example of a 2d system which obeys an area law which is QMA-complete.  Take a 2d system, one row of which is equal to one of the known QMA-complete 1d Hamiltonians (see Aharonov, Gottesman, Irani, Kempe), and all the other rows are in a product state.  Then, this obeys an area law (consider drawing a rectangle which includes the given row, with k rows and l columns; the entanglement is bounded by a constant times l and the area is also at least equal to l).

However, this, in my opinion, certainly doesn't mean that proving an area law in 2d would be pointless from the point of view of complexity.  Rather, I think it means that we need to consider not just the area law for entanglement entropy, but other entanglement properties also.  One such property would be having a PEPS of polynomial bond dimension.  Actually, proving that there is an area law in 2d does not imply having a PEPS of polynomial bond dimension.  The implication in 1d relies on the fact that we can cut the system across various bonds, truncate to a polynomial Schmidt rank across each bond, and bound the error.  This procedure doesn't work in 2d.  So, proving the existence of a PEPS for a gapped system in 2d would be a next step.  My feeling is that proving an area law in 2d would be a good first step to doing that.

In fact, it is well-studied in condensed matter physics that there exist gapless 2d Hamiltonians which obey an area law.  While in 1d, the systems which are described by conformal field theory have a logarithmic behavior of the entanglement entropy, in 2d many critical systems show an area law and then the logs show up in subleading behavior, so the entropy is equal to L + const*log(L)+...  That is, the interesting, universal terms in the entropy are not the leading terms, but the subleading, in such 2d theories.