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.
CITATION STYLE
Ablayev, F., & Gainutdinova, A. (2003). Classical simulation complexity of quantum machines. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2751, 296–302. https://doi.org/10.1007/978-3-540-45077-1_27
Mendeley helps you to discover research relevant for your work.