← ALB News · curated headline

Reading superconducting qubits while suppressing unwanted state transitions

Phys.org · WORLD · Science · 11/16/2026, 11:20:42 AM

Recently an artificial intelligence proved an 18-year-old conjecture in computer science, called the Aaronson–Ambainis conjecture. The proof settles a long-standing conjecture (educated guess) that eliminates one proposed route to enormous quantum computer speedups, ruling out one particular variant of "quantum supremacy," the term for the hypothesis that a programmable quantum computer can solve a problem that no classical computer can solve in any "feasible" amount of time.

Continue to Phys.org →

You are being forwarded in 6s — stay on this page