US team finds ‘super-polynomial’ problems that even quantum computers can’t crack
SMRTR summary
Researchers at the California Institute of Technology have discovered that quantum computers cannot efficiently solve certain "super-polynomial" problems, specifically determining quantum phases of matter from unknown states. While quantum computers excel at many complex calculations, this study reveals fundamental limits when the correlation length of quantum systems grows faster than the logarithm of system size, making computation time exponentially longer and effectively unsolvable within reasonable timeframes.
SMRTR provides this summary for quick context. The original article belongs to Interesting Engineering.
Read the original article