Assuming a quantum computer running at 1 GHz. (Very liberal, as most problems won't require more than a few MHz with a large register is usually sufficient to solve most problems quickly).
Now, because we're using a first generation quantum computer, let's assume we have 32 bits.
2^32 = 4,294,967,296 operations each cycle. And we have to emulate 10 minutes of Super Mario World 4.12 x 10^18662 times. Now, unfortunately, quantum computers are non-deterministic. So, in order to effectively emulate even a simple deterministic in a quantum computer you have to do every operation at least 3 times (Then it's only probable, but because there is probably a great number of isochronic files, chances are you won't achieve a desync in at least one of them; however, each canidate must be double checked with a deterministic machine for false positives).
We're assuming, very, very conservatively, that each movie file only takes 1.1 million (because I like round numbers) operations to analyze once, (without displaying anything of course, just simple number crunching because we're only looking for the trigger credits register to change). So, for an even vaugly probably outcome, each operation must be done 3 times. Good thing is, you're doing it for 4 billion different files at the same time.
So now you do it for each set of 4 billion three times, then you do it again on the best canidates in each set of 4 billion, etc, until you're left with a small number of canidates. Then you crosscheck them with a classical computer.
So, down to the math, we're only going to do the first iteration, because the 2nd, 3rd, etc, go much faster than the first, and are omitted for the sake of brievity.
So realivant rectal figures,
100 million ops per 4 billion files (1.1 million x 3 per op x 3 per try)
1 billion ops per second
so,
40 billion files per second
4 x 10^18662 files to check
1 x 10^18652 seconds
Now let's do this the opposite way, how many qubits are required to solve it within a human being's lifetime (arbitrarily selected to be around 70 years)?
2 x 10^9 seconds
4 x 10^18662 files to check
2 x 10^18653 files/second
100 million ops required/set
1 billion ops/second
10 sets/second
2 x 10^18652 files/set
ceiling(log2(2 x 10^18652)) = 61962 qubits/register according to Maple. Which is convienently close enough to 2^16 that it'd probably be easier to build the 65536 qubit processor than program for the 61962 processor.
So yeah, we're on 64-bit processor now. And I think the highest bit processor is 512. So, how long do you think it'll take to achieve a 65536 qubit processor? Certainly not in our lifetime.
I winnar is yuo!
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
