Yes, you are talking about a search in a 2^80 keyspace, even with quantum speedups.
I have no problem with searching in a 2^80 keyspace with conventional means in a second. I have a low likelihood of finding the key but the likelihood is around the same if I do 100000 searches that take 1 second or one search that takes 100000 seconds.
If I want to stay under a 10 minute time threshold I can just switch the key I'm attacking every second.
I don't know enough about quantum computation to know whether switching the attacked key frequently possible in the same way with the quantum algortihms but I would expect it to be.
I'm sorry, I don't understand. That doesn't make it any more economical. 2^80 is a big, big number: 1,208,925,819,614,629,174,706,176. Assuming you could try a billion keys a second (that's quite the quantum computer!) then it'd still take you nearly 40 million years before you have a reasonable chance of guessing a single key.