Abstract
The effort that the has been put in the field of complex computation has been brought a lot of changes. The issue of proving or disapproving whether a set of binomially verifiable problems is equal to a set of bounded problems. The paper gives a detailed overview of the myth surrounding the quantum complexity and the implication that has brought to the world of quantum physics. To better understand the concept, it is crucial to introduce a Turing machine which is based on the quantum mechanical concept. In addition, the relationship between quantum oracle and Turing machine is exploded. The paper will also give ...
