Why would that be true? Every approach I've seen needs to jump around in memory to find indices and then the coordinates. It's the polar opposite of being bound by memory bandwidth.
Yes the GP said “bandwidth” when they perhaps meant “latency” but the gist and spirit of their post was good. The cpu has a lot of spare cycles, particularly if it can be arranged to be without dependency so it can be crunched instead of stalling?