Independent subsets search in a directed graph

When the problems of artificial intelligence, transport logistics, design automation, building intelligent CAD, mathematical economic, sociological and other are being solved it´s necessary to solve problems of determining unrelated objects. Unrelated objects search based on different criteria can solve problems of science, technology and production effectively. The paper proposes a quantum algorithm to determine the independent subsets in a directed graph. It allows developing algorithms with polynomial complexity, and in some cases, linear and quadratic complexity.