New analysis eliminates a potential speed bump in quantum computing

A quantum particle can search for an item in an unsorted “database” by jumping from one item to another in superposition, and it does so faster than a classical computer ever could.

from Phys.org – spotlight science and technology news stories http://ift.tt/1nkS6v7
via IFTTT

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s