Aaronson-Ambainis Conjecture proved! (By AI, of course)

·Shtetl-Optimized··

The “For Dummies” Version (apologies for not including this earlier): Yes, an AI solved a big open problem about quantum computing No, this doesn’t kill quantum supremacy, or change how we build quantum computers, or whatever else you read on Twitter What it does, is to rule out a potential class of quantum speedups that most of us didn’t believe would exist anyway (namely, those that would compute a yes-or-no property of exponentially many random bits, superpolynomially faster than any classica...

Read full article →

Related Articles

Should I run plain Docker Compose in production in 2026?
pmig · Hacker News · 6mo ago
Computer Use is 45x more expensive than structured APIs
palashawas · Hacker News · 6mo ago
Bun is being ported from Zig to Rust
SergeAx · Hacker News · 6mo ago
Show HN: Tilde.run – Agent sandbox with a transactional, versioned filesystem
ozkatz · Hacker News · 6mo ago
RaTeX: KaTeX-compatible LaTeX rendering engine in pure Rust
atilimcetin · Hacker News · 6mo ago