Potential speed bump in quantum computing eliminated: Global symmetry not required for fast quantum search

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. Other structures were thought to slow down the search. Now researchers have used a physics technique in a novel way to prove that global symmetry is not required for a sped up search.

Read the whole article on Science Daily

More from Science Daily