Can anyone with a solid CS background comment on whether this relates to P!=NP at all?

I mean this deals with Hamiltonian cycles (which is the focus of a well know NP hard problems). It talks about lower boundaries for randomness (which relates to the information stored in the graph). The article talks about gaps which are logarithmic.

I can't quite articulate it, but somehow intuitively, it sounds like it could connect.