Data structures influence speed of quantum search in unexpected ways

Data structures influence speed of quantum search in unexpected ways
Quantum search slows unexpectedly on the highly connected data structure represented by this graph. Mathematical description: a 5-simplex with each vertex replaced with a complete graph of 5 vertices. Credit: Tom Wong

Using the quantum property of superposition, quantum computers will be able to find target items within large piles of data far faster than conventional computers ever could. But the speed of the search will likely depend on the structure of the data.

Such a search would proceed as a quantum particle jumps from one node of a connected set of data to another. Intuition says that the search would be fastest in a highly connected database.

"Say we are searching for a particular cafe in a city. How quickly we find it can depend on the layout of the city and the location of the cafe within the city. We might imagine that the more connected the city is, the easier it is to move around, and the easier it is to find the cafe," said Tom Wong, one of the authors of a new analysis of the speed of such a search on databases with different structures and degrees of connectivity.

In a paper published by Physical Review Letters on March 20, David Meyer, a professor of mathematics at the University of California, San Diego, and Wong, who recently earned a Ph.D. in physics from UC San Diego and is now at the University of Latvia, showed that this logic doesn't hold for .

"We turned an intuition on its head," Wong said. "Searching with a , we showed the opposite, giving an example where searching in a city with low connectivity yields fast search, and an example where searching in a city with high connectivity yields slow search. Thus the quantum world is much richer than our classical intuitions might lead us to believe."

Data structures influence speed of quantum search in unexpected ways
Both intuition and previous work seem to indicate that quantum searches will slow in sparsely connected data structures, like the one illustrated by this graph, but a new analysis shows the search for the "correct" node, marked in red, will proceed at optimum speed. Mathematical description: a graph with 12 vertices constructed by joining two complete graphs of six vertices by a single edge. Credit: Tom Wong

Explore further

New analysis eliminates a potential speed bump in quantum computing

Journal information: Physical Review Letters

Citation: Data structures influence speed of quantum search in unexpected ways (2015, March 17) retrieved 24 April 2019 from
This document is subject to copyright. Apart from any fair dealing for the purpose of private study or research, no part may be reproduced without the written permission. The content is provided for information purposes only.

Feedback to editors

User comments

Mar 18, 2015
"We turned an intuition on its head,"

...Wouldn't intuition dictate the opposite: that a network with fewer connections is faster to search as the options to connect (ie Reed Law) are lower? A network full of pathways, even ones which are shortcuts, would take longer to optimize. In fact isn't this the whole nature of Quantum computing, that they can check all possibilities at once? It seems like the system they are testing isn't actually operating in a quantum way.

Also I should note, I don't understand quantum mechanics. And I didn't read the paper.

Mar 18, 2015
Hello, is there any link to the actual paper?

Apr 13, 2015
Connectivity is a Poor Indicator of Fast Quantum Search
I agree with quantone that quantum waves in a low connected network have quite less destructive interferences and are thus quite less lost.

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more