Menu

Reading superconducting qubits while suppressing unwanted state transitions
📰

Reading superconducting qubits while suppressing unwanted state transitions

#phys#science#computer#conjecture#quantum
Reading 0:00
15s threshold

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.