INDBInternet News Database 2.5 Updated just now · 296 sources Show or hide images Light or dark

Reading superconducting qubits while suppressing unwanted state transitions

Save Like Comments Compare coverage
Image from Phys

Summary

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.

Description from Phys.

Who is covering this

  1. Phys Center Factuality: Mostly factual US
    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...

Comments

Comments need JavaScript.