Complexity researcher challenges quantum paper's Turing machine assumptions
rrwilliams · x · 2026-10-13
Complexity theorist rrwilliams points out that a paper's abstract claims a "fixed finite-alphabet Turing machine with a fixed finite number of one-dimensional tapes" — yet under that model you cannot multiply arbitrarily large precision complex numbers in a single step. In context, critics argue the claimed ability to change "superpolynomially many" bits in one step contradicts the basic assumptions of the stated computation model, suggesting the core argument may be flawed. This is part of a public technical debate over recent quantum computing capability claims.
More from Research
- RFD4-Proteina's 'underrated' docs detail partial diffusion for protein redesign — AllThingsApx · 2026-10-23
- MPI-Sec PhD Thesis on Vulnerability Detection Benchmarks Includes Pre-LLM Classic "Top Score on the Wrong Exam" — mboehme_ · 2026-10-23
- LiveNerf's 29-day data finds no nerfing of Claude Opus 5.5 — TheOnlyVibemaster · 2026-10-23
- New paper makes 9 falsifiable predictions toward a major AI-enabled terror attack by 2027-2028 — StephenLCasper · 2026-10-23
- HumanoidPose recovers humanoid robots' full-body joint states from RGB video alone — cholz · 2026-10-23
- Sophont's Holon-S1 predicts genes and biomarkers from routine pathology slides — iScienceLuvr · 2026-10-23