New! Sign up for our free email newsletter.
Science News
from research organizations

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

Date:
May 20, 2014
Source:
University of California - San Diego
Summary:
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.
Share:
FULL STORY

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.

This assertion assumes, however, that the particle can directly hop from any item to any other. Any restriction on which items the particle can directly hop to could slow down the search.

"Intuition says that a symmetric database allows the particle to hop freely enough to retain the quantum speedup, but our research has shown this intuition to be false," says Tom Wong, a physicist at the University of California, San Diego.

In a paper accepted for publication by Physical Review Letters, the researchers used a technique familiar to physicists called "degenerate perturbation theory" in a novel way to prove that global symmetry is not required for a sped up search.

Information scientists represent the database to be searched as a graph. In globally symmetric graphs, the nodes can be swapped with each other such that the connections between them are preserved. "Strongly regular graphs" don't share this property, but this analysis shows they also support a fast search through local symmetries.

Their finding extends the use of this theory to the field of quantum information science and expands the kinds of data structures on which quantum computing outperforms classical computing.


Story Source:

Materials provided by University of California - San Diego. Note: Content may be edited for style and length.


Journal Reference:

  1. Jonatan Janmark, David A. Meyer, and Thomas G. Wong. Global symmetry is unnecessary for fast quantum search. Phys. Rev. Lett., 2014

Cite This Page:

University of California - San Diego. "Potential speed bump in quantum computing eliminated: Global symmetry not required for fast quantum search." ScienceDaily. ScienceDaily, 20 May 2014. <www.sciencedaily.com/releases/2014/05/140520142414.htm>.
University of California - San Diego. (2014, May 20). Potential speed bump in quantum computing eliminated: Global symmetry not required for fast quantum search. ScienceDaily. Retrieved May 20, 2024 from www.sciencedaily.com/releases/2014/05/140520142414.htm
University of California - San Diego. "Potential speed bump in quantum computing eliminated: Global symmetry not required for fast quantum search." ScienceDaily. www.sciencedaily.com/releases/2014/05/140520142414.htm (accessed May 20, 2024).

Explore More

from ScienceDaily

RELATED STORIES