Scientists have found the exact point where physics becomes too complicated for even the world's most powerful computers to simulate.
April 17, 2026
Original Paper
A complexity phase transition at the EPR Hamiltonian
arXiv · 2604.13026
The Takeaway
For years, we've known some quantum systems are 'easy' to model while others seem impossible, but we never knew exactly where the line was. This paper identifies the 'EPR* problem' as the tipping point where a system goes from predictable to 'QMA-complete,' meaning it’s fundamentally too hard for classical math. By mapping this boundary, researchers have essentially found the 'complexity wall' of our universe. It’s like finding the resolution limit of a video game—beyond this point, the simulation just gets too heavy for the hardware to handle. This means we now know exactly which types of materials or molecules we must use quantum computers to understand because our current tech will never be enough, no matter how much we upgrade it.
From the abstract
We study the computational complexity of 2-local Hamiltonian problems generated by a positive-weight symmetric interaction term, encompassing many canonical problems in statistical mechanics and optimization. We show these problems belong to one of three complexity phases: QMA-complete, StoqMA-complete, and reducible to a new problem we call EPR*. The phases are physically interpretable, corresponding to the energy level ordering of the local term.The EPR* problem is a simple generalization of t