Classical simulation complexity of quantum machines

dc.contributor.author	Ablayev F.
dc.contributor.author	Gainutdinova A.
dc.date.accessioned	2018-09-17T20:39:17Z
dc.date.available	2018-09-17T20:39:17Z
dc.date.issued	2003
dc.identifier.issn	0302-9743
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/133832
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)). © Springer-Verlag Berlin Heidelberg 2003.
dc.relation.ispartofseries	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.title	Classical simulation complexity of quantum machines
dc.type	Article
dc.relation.ispartofseries-volume	2751
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	296
dc.source.id	SCOPUS03029743-2003-2751-SID35248891982

Files in this item

Size: 43.57Kb

Format: PDF

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