Quantum Computers Were Never Necessary — E8 Geometry Achieves Classical Equivalence Without Cryogenic Hardware — E8 Intelligence Research

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

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-29
DOI
https://doi.org/10.5281/zenodo.20436066
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Quantum Computers Were Never Necessary — E8 Geometry Achieves Classical Equivalence Without Cryogenic Hardware — E8 Intelligence Research

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Quantum Computers Were Never Necessary — E8 Geometry Achieves Classical Equivalence Without Cryogenic Hardware — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

Abstract

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

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.