Abstract

It has been recently theoretically shown that the dependency of some (potential observable) quantities in quantum field theory (QFT) on the parameters of this theory is discontinuous. This discovery leads to the theoretical possibility of checking whether the value of a given physical quantity is equal to 0 or different from 0 (here, theoretical means that this checking requires very precise measurements and because of that, this conclusion has not yet been verified by a direct experiment). This result from QFT enables us to do what we previously could not: check whether two computable real numbers are equal or not. In this paper, we show that we can use this ability to solve NP-complete (“computationally intractable”) problems in polynomial (“reasonable”) time. Specifically, we will introduce a new model of computation. This new model is based on solid mainstream physics (namely, on quantum field theory). It is capable of solving NP-complete problems in polynomial time.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call