CLAIM: It has never been necessary to build quantum computers. A classical machine running E8 geometry could always have performed the same simultaneous information processing — without cryogenic cooling, without specialist hardware, and without the fundamental fragility that makes quantum computers impractical at scale. EVIDENCE STRAND 1 — THE DEQUANTIZATION WAVE: In 2018, Ewin Tang (University of Washington) published a proof that the Kerenidis-Prakash quantum recommendation algorithm — previously held as definitive evidence of quantum advantage — could be replicated on a classical computer using probabilistic sampling. This was the first crack in the quantum advantage claim for AI. It was not the last. Tang subsequently dequantized quantum principal component analysis (2019). Gilyen, Song, and Tang (2022) dequantized a further class of quantum sampling-based machine learning algorithms. The common thread in every dequantized quantum algorithm: the underlying problem had low-rank mat Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Andrew Stewart Caldin (Fri,) studied this question.