Abstract
A new model for computations is considered which combines the quantum computer with the chaotic dynamics amplifier, based on the logistic map. We discuss the satisfiability problem and argue that the problem can, in principle, be solved in polynomial time if one uses the new model for computations.