The point is the relative cost difference between function evaluations and function minimization.
Well yeah, but the definitions of P and NP involve the size of the input. Your original claim was that we can solve “much harder than NP-complete” problems with quantum voodoo. I don’t think you’ve proved it yet, but if you revise it to somehow talk about “relative cost differences”, it does become somewhat more believable.
Well yeah, but the definitions of P and NP involve the size of the input. Your original claim was that we can solve “much harder than NP-complete” problems with quantum voodoo. I don’t think you’ve proved it yet, but if you revise it to somehow talk about “relative cost differences”, it does become somewhat more believable.