The Quantum Approximate Optimization Algorithm was supposed to demonstrate quantum advantage on hard combinatorial problems. Morone, Kent, and Sels strip QAOA down to its skeleton — the iterative rotation structure — and rebuild it with classical kicked tops. The result: the classical version outperforms the quantum version on the canonical Sherrington-Kirkpatrick spin-glass benchmark at every circuit depth tested.

The mechanism is instructive. QAOA works not because of quantum superposition or entanglement, but because of its rotation protocol — iteratively kicking a system toward better configurations. When you replace quantum spins with classical kicked tops, the rotation structure survives and the quantum noise disappears. Quantum fluctuations, it turns out, generate higher-rank noise in the system’s covariance matrix, which hampers precise control. The classical version has cleaner dynamics.

This doesn’t mean quantum computing is useless. It means the source of QAOA’s power was misidentified. The algorithm works because of its variational structure, not because of its quantum substrate. The quantumness is not a feature — it’s overhead. Removing it makes the algorithm faster.

The practical implication is immediate: the classical version, called VIRAL, can be implemented on nanometer-scale magnetic tunnel junctions using magnetic fields and spin torques. No cryogenic cooling, no decoherence management, no quantum error correction. A chip that fits on a fingertip doing the same optimization that a quantum computer does in a dilution refrigerator.

The deeper question: how many other quantum algorithms carry classical ghosts — algorithms whose real mechanism is geometric or dynamical, with quantum mechanics adding noise rather than power? If you can’t identify what specifically requires quantum mechanics, you might be paying for overhead you don’t need.