БЛОГ

Jul 17, 2016

Primitive Quantum Computers Are Already Outperforming Current Machines

Posted by in categories: computing, information science, particle physics, quantum physics

A team has used simple quantum processors to run “quantum walk” algorithms, showing that even primitive quantum computers can outperform the classical variety in certain scenarios—and suggesting that the age of quantum computing may be closer than we imagined.

By now, most readers of Futurism are probably pretty well acquainted with the concept (and fantastic promise) of quantum computing.

For those who aren’t, the idea is fairly (!) simple: Quantum computers exploit three very unusual features that operate at the quantum scale—that electrons can be both particles and waves, that objects can be in many places at once, and they can maintain an instantaneous connection even when separated by vast distances (a property called “entanglement”).

Read more

3

Comments — comments are now closed.

  • tuito on July 17, 2016 9:29 pm

    It is mind boggling the advances we have made since 1995 to 2016, WOW.

  • tuito on July 17, 2016 9:30 pm

    Amazing the advances we have achieved since 1995 to 2016. WOW

  • TITO MARTIN on July 17, 2016 9:32 pm

    AMAZING HOW THIS MAY TURN OUT TO BE AI,WOW