Monday, November 16, 2026
Science

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...

Reading superconducting qubits while suppressing unwanted state transitions
Image: Phys.org
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.

Originally published at Phys.org

The Morning Briefing

Subscribe to our Newsletter

Be the first to receive the latest news, market analysis and updates — delivered straight to your inbox.