Discover · phys.org

Reading superconducting qubits while suppressing unwanted state transitions

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

More ways to use this
Open on another device
Scan this QR code to open the same public page

Scan to open this page. Your saved notes and account access are not included.

Download QR code

Open the page link

Names and references

  1. Reading — person

Keep going

Each of these is read from what this estate already kept: the feed a piece came through, the publisher behind it, the credits and topics the publisher printed. None of it is a recommendation, an identity or a record kept anywhere else.

More like this

Also from Phys.org

  1. Newly discovered gut viruses offer clues to the origins of the smallpox virus familyphys.org
  2. Dark personality traits linked to better chance at getting a second datephys.org
  3. Trying to hide some information? Your eyes might give you awayphys.org
  4. Long DNA strands turn chaotic fluid motion into a steady rhythmphys.org
  5. Strange radio signals from space could come from a dead starphys.org
  6. Centuries of portrait paintings reveal how female beauty ideals have changedphys.org