Experiments have shattered expectations by pushing the limits of classical computing. Physicists from the Flatiron Institute’s Center for Computational Quantum Physics found that classical computers can simulate a complex quantum system, previously thought to be unique to quantum processing.
The problem involves simulating the dynamics of transverse field Ising (TFI) models, which describe the alignment of quantum spin states between particles. Researchers identified the presence of confinement, a behavior where extremely stable states appear in the interconnected chaos of particle properties. This confinement limits energy and entanglement patterns, making it possible for classical computers to model.
The team demonstrated that classical computer algorithms can describe what’s happening in the TFI model more efficiently and accurately than quantum computers. In this system, magnets won’t suddenly scramble; instead, they oscillate around their initial state.
The findings set limits on the potential of quantum computers, striking tasks from their list. However, scientists continue to push these systems to explore possibilities. The research helps clarify the boundary between what can be done with quantum and classical computing, making it slightly more defined.
Source: https://www.sciencealert.com/computers-find-impossible-solution-beating-quantum-tech-at-own-game