Potential speed bump in quantum computing eliminated: Global symmetry ...

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, assuming that the particle can directly hop from any item to any other, in a structure with global symmetry.

http://ift.tt/TsIy8H