Is a computational model that can instantly access any storage address and can access any arbitrary number of them at once more powerful then a TM?

Question

This would be a computational model that would have unbounded space. But with a jump command that can access and do operations on any finite number of cells at once. Actual calculations would take time, but space could be accessed instantly. If it is not can it at-least solve some problems faster then a Turing machine?