combinatorics – Will Shor's algorithm break a permuted list in post-quantum?

If I create a list of 100 random numbers – create a hash from the list – swap the list – then give you the swapped list and hash from the original list … it would take you a while to find the control of the origin of the numbers in the list … since this list would have approximately 9.3326215443e + 157 possible permutations (unauthorized repetitions).

Will the Shor algorithm make it easier to search for the original order of such a permuted list once quantum computers become available?