Contact: Tom Wong
University of California - San Diego
Caption: In a complete graph (left) every node is connected to every other. For other well studied graphs, the Paley graph in the center and the Latin square graph on the right, that is not true. A quantum particle could hop directly to the target position, in red, only from connected nodes, marked in blue.
Credit: Tom Wong, UC San Diego
Usage Restrictions: For use to illustrate news coverage of this finding. For other uses please contact Tom Wong at tOgw002@physics.ucsd.edu
Related news release: New analysis eliminates a potential speed bump in quantum computing