We've got a new computer chip that cracks 'impossible' math problems by basically acting like a bunch of tiny magnets finding their groove.
arXiv · March 16, 2026 · 2603.12415
AI-generated illustration
Why it matters
Standard computers take massive amounts of energy and time to solve 'NP-Complete' puzzles, but this chip uses the physical properties of magnetic 'spins' to let the answer emerge naturally. It reaches 91% accuracy while using only a tiny fraction of the power of a traditional processor.
From the abstract
Computational workloads are growing exponentially, driving power consumption to unsustainable levels. Efficiently distributing large-scale networks is an NP-Complete problem equivalent to Boolean satisfiability (SAT), making it one of the core challenges in modern computation. To address this, physics and device inspired methods such as Ising systems have been explored for solving SAT more efficiently. In this work, we implement an Ising model equivalence of the 3-SAT problem using a ReRAM cross