On simulating the quantum and classical branching programs

dc.contributor.author	Gainutdinova A.
dc.date.accessioned	2018-09-18T20:33:27Z
dc.date.available	2018-09-18T20:33:27Z
dc.date.issued	2007
dc.identifier.issn	1990-4789
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/141120
dc.description.abstract	The complexity classes defined on the basis of branching programs are considered. Some basic relations are established between the complexity classes defined by the probabilistic and quantum branching programs (measure-once, as well as measure-many), computing with bounded or unbounded error. To prove these relations, we developed a method of "linear simulation" of a quantum branching program and a method of "quantum simulation" of a probabilistic branching program. © Pleiades Publishing, Ltd. 2007.
dc.relation.ispartofseries	Journal of Applied and Industrial Mathematics
dc.title	On simulating the quantum and classical branching programs
dc.type	Article
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	1
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	33
dc.source.id	SCOPUS19904789-2007-1-1-SID67849121903

Файлы в этом документе

Имя: SCOPUS19904789-20 ...

Размер: 43.60Kb

Формат: PDF

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