I guess searching for the seeds that would result in a specific string can be interpreted as a hash function? It takes a long time to find the right seed or com

I guess searching for the seeds that would result in a specific string can be interpreted as a hash function? It takes a long time to find the right seed or combination of seeds that generate a certain string. Call that a hash value of the string, then you can reverse the hash by applying it to the randomString() method. Could it be possible to use something like this for "quantum compression"? If you use a quantum computer to find the combinations of seeds that generate a given string, could that be used for compression?