Science News
from research organizations

Quantum computers could help search engines keep up with the Internet's growth

Date:
June 12, 2012
Source:
University of Southern California
Summary:
With the web constantly expanding, researchers have proposed – and demonstrated the feasibility – of using quantum computers to run Google's page ranking algorithm faster.
Share:
       
FULL STORY

Most people don't think twice about how Internet search engines work. You type in a word or phrase, hit enter, and poof -- a list of web pages pops up, organized by relevance.

Behind the scenes, a lot of math goes into figuring out exactly what qualifies as most relevant web page for your search. Google, for example, uses a page ranking algorithm that is rumored to be the largest numerical calculation carried out anywhere in the world. With the web constantly expanding, researchers at USC have proposed -- and demonstrated the feasibility -- of using quantum computers to speed up that process.

"This work is about trying to speed up the way we search on the web," said Daniel Lidar, corresponding author of a paper on the research that appeared in the journal Physical Review Letters on June 4.

As the Internet continues to grow, the time and resources needed to run the calculation -- which is done daily -- grow with it, Lidar said.

Lidar, who holds appointments at the USC Viterbi School of Engineering and the USC Dornsife College of Letters, Arts and Sciences, worked with colleagues Paolo Zanardi of USC Dornsife and first author Silvano Garnerone, formerly a postdoctoral researcher at USC and now of the University of Waterloo, to see whether quantum computing could be used to run the Google algorithm faster.

As opposed to traditional computer bits, which can encode distinctly either a one or a zero, quantum computers use quantum bits or "qubits," which can encode a one and a zero at the same time. This property, called superposition, some day will allow quantum computers to perform certain calculations much faster than traditional computers.

Currently, there isn't a quantum computer in the world anywhere near large enough to run Google's page ranking algorithm for the entire web. To simulate how a quantum computer might perform, the researchers generated models of the web that simulated a few thousand web pages.

The simulation showed that a quantum computer could, in principle, return the ranking of the most important pages in the web faster than traditional computers, and that this quantum speedup would improve the more pages needed to be ranked. Further, the researchers showed that to simply determine whether the web's page rankings should be updated, a quantum computer would be able to spit out a yes-or-no answer exponentially faster than a traditional computer.

This research was funded by number of sources, including the National Science Foundation, the NASA Ames Research Center, the Lockheed Martin Corporation University Research Initiative program, and a Google faculty research award to Lidar.


Story Source:

The above post is reprinted from materials provided by University of Southern California. Note: Materials may be edited for content and length.


Journal Reference:

  1. Silvano Garnerone, Paolo Zanardi, Daniel Lidar. Adiabatic Quantum Algorithm for Search Engine Ranking. Physical Review Letters, 2012; 108 (23) DOI: 10.1103/PhysRevLett.108.230506

Cite This Page:

University of Southern California. "Quantum computers could help search engines keep up with the Internet's growth." ScienceDaily. ScienceDaily, 12 June 2012. <www.sciencedaily.com/releases/2012/06/120612144612.htm>.
University of Southern California. (2012, June 12). Quantum computers could help search engines keep up with the Internet's growth. ScienceDaily. Retrieved July 30, 2015 from www.sciencedaily.com/releases/2012/06/120612144612.htm
University of Southern California. "Quantum computers could help search engines keep up with the Internet's growth." ScienceDaily. www.sciencedaily.com/releases/2012/06/120612144612.htm (accessed July 30, 2015).

Share This Page: