Highly Connected Data Structure on which Quantum Search Would Slow (image) University of California - San Diego Share Print E-Mail Caption 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 Usage Restrictions For use in news reports of this finding. For other uses, please contact firstname.lastname@example.org. 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.