Comparative Power of Quantum and Classical Computation Models

摘要

In the talk we present results on compaxitve power of classical and quantum computational models. We focus on two well known in Computer Science models: finite automata which is known as uniform computational model and branching programs which is known as nonuniform computational model.