Comparative power of quantum and classical computation models
Farid Mansurovich Ablayev · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2005
In the talk we present results on comparitve 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.