Scientists at the Center for Computational Quantum Physics (CCQ) at the Flatiron Institute and Boston University have solved a complex quantum physics problem using a classical computer and new mathematical tools. This problem had previously been presented as a demonstration of "quantum supremacy," meaning the ability of a quantum computer to perform calculations intractable for classical machines. The advance challenges the dividing line between quantum and classical computational capability, at least for certain problems.

The problem in question is the simulation of the dynamics of a many-body quantum system, a task that grows exponentially in complexity with the number of particles. In particular, the team addressed a random quantum circuit sampling problem, a task that Google had used in 2019 to claim quantum supremacy with its Sycamore processor. The key to the team's success lies in an innovative algorithm that exploits the underlying structures of the problem, allowing for efficient simulation on conventional hardware.

This development does not invalidate the long-term potential of quantum computing but underscores the importance of optimizing classical algorithms and mathematical techniques. It demonstrates that the frontier of quantum supremacy is dynamic and depends on both hardware and software. The work suggests that there is still considerable room to improve the efficiency of classical computers in solving quantum problems, which could delay the need for large-scale quantum computers for certain applications and foster healthy competition in the search for computational solutions.