ByteBrief
We're a portrait publication through and through. Turn your phone back and your briefing picks up right where you left it.
(We tried widescreen once. It wasn't us.)

Four researchers won a best-paper award at the 2026 Symposium on Theory of Computing for identifying a computational problem that requires a quantum proof. No classical proof can replace it. The result resolves a 20-year open question in quantum complexity theory.
Tap to vote and see what everyone thinks.
Summary by ByteBrief