Earlier quoted context omitted.
The class of integrals that QCD solutions belong to is known to be NP-hard. It is not known specifically that QCD itself is NP-hard but it is suspected to be by many.
Would this mean that either the strong Church-Turing thesis(any model of computation based on physical reality gives the same class of problems solvable in polynomial time as a Turing machine) is wrong or P=NP?
If you're looking for something to raise your hair even farther, some suspect that gravity is outright uncomputable[0] due to the unclassifiability of 4-manifolds and the expectation that quantum gravity will require summing over possible spacetimes.
Since all of our computers are built with QED, it should come as no surprise that everything else made out of QED-obeying-matter, like Turing machines are imagined to be, is equally difficult to compute and equally powerful at computing. I don't see why you'd expect the other field theories to fall in to the same computational class.