Comparative power of quantum and classical computation models

dc.contributor.author	Ablayev F.
dc.date.accessioned	2018-09-17T20:38:40Z
dc.date.available	2018-09-17T20:38:40Z
dc.date.issued	2005
dc.identifier.issn	0277-786X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/133813
dc.description.abstract	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.
dc.relation.ispartofseries	Proceedings of SPIE - The International Society for Optical Engineering
dc.subject	Branching programs
dc.subject	Complexity
dc.subject	Finite automata
dc.subject	Lower bounds
dc.subject	Quantum computations
dc.title	Comparative power of quantum and classical computation models
dc.type	Conference Paper
dc.relation.ispartofseries-volume	5833
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	100
dc.source.id	SCOPUS0277786X-2005-5833-SID27744595866

Files in this item

Size: 43.22Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.