Reading superconducting qubits while suppressing unwanted state transitions
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…
We haven't written up this one. Phys.org has the full story — the link below goes straight to it.