On classical simulation of quantum machines

dc.contributor.author	Ablayev F.
dc.contributor.author	Gainutdinova A.
dc.date.accessioned	2018-09-17T20:38:38Z
dc.date.available	2018-09-17T20:38:38Z
dc.date.issued	2005
dc.identifier.issn	0277-786X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/133812
dc.description.abstract	We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary of this technique we obtain several results on relationship among classical and quantum complexity classes such as: PrQP = PP, BQP ⊆ PP and PrQSPACE(S(n)) = PrPSPACE(S(n)).
dc.relation.ispartofseries	Proceedings of SPIE - The International Society for Optical Engineering
dc.subject	Complexity
dc.subject	Quantum computations
dc.subject	Turing machines
dc.title	On classical simulation of quantum machines
dc.type	Conference Paper
dc.relation.ispartofseries-volume	5833
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	109
dc.source.id	SCOPUS0277786X-2005-5833-SID27744530564

Files in this item

Size: 43.73Kb

Format: PDF

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