No matter how fast classical computers get, the number of steps they need to solve a given problem will always be set by rules that make intuitive sense to us. Say, for instance, that you have a guest list with one hundred names written in no particular order, and that you want to search for a specific name in the list. You'd have to look at the names one by one, compare each one to the name you're looking for, and go through the entire list if necessary (on average it will take you fifty "tries" to find a match, no more and no less).