Sparsely Connected Data Structure that Supports Fast Quantum Search (image) University of California - San Diego Share Print E-Mail Caption 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 Usage Restrictions For use in news reports of this finding. For other uses, please contact email@example.com. Share Print E-Mail Disclaimer: AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert system.