There is no known polynomial-time algorithm that can solve an NP problem. Evolutionary search has been shown to be a viable method of finding acceptable solutions within a reasonable time period. Recently quantum computers have surfaced as another alternative method. But these two methods use radically different philosophies for solving NP problems even though both search methods are non-deterministic. This paper uses instances of {\bf SAT}, {\bf 3SAT} and {\bf TSP} to describe how these two methods differ in their approach to solving NP problems.
This chapter explores the following two interrelated issues surrounding quantum theory: measurement problem; and interpretations of quantum theory. The measurement problem arises with quantum theory in a way that it has never arisen with earlier scientific theories and, as it is closely tied to the question of what is really going on in experiments and phenomena involving quantum entities. Interpretations of quantum theory primarily involve views on what sort of reality could underlie the known facts. The measurement problem provides a convenient way to broadly categorize approaches to interpretations of quantum theory. In particular, interpretations will be divided into collapse interpretations and non-collapse interpretations. All of the viable interpretations of quantum theory - collapse interpretations as well as non-collapse interpretations - have features that strike most people as substantially odd. The chapter also presents an overview of the most common collapse interpretations, and further looks at some common noncollapse interpretations.