If you could reduce the search space by 99%, it will still be too large.
If you reduce the search space of 2 bit keys by 99% then there there are only 0.04 keys left. That's too small to find a single key, not too large.
There are actually no 2-bit RSA keys. The smallest possible key is n=10, e=3.
Conveniently, d=3 too, i.e. encryption and decryption is the same operation.
I guess you can think of it as a ROT-13 of the RSA world.
Then all possible keys fit into the 0.04 bit remaining keyspace.
Assuming the logic is gate free lol. For real to call two qubits a 'processor' has to be a new low. These reviewers should be in science prison.