Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Volume 13, Issue 1, Pages 45–64 (Mi da23)  
This article is cited in 1 scientific paper (total in 1 paper)

On simulating the quantum and classical branching programs

A. F. Gainutdinova

N. G. Chebotarev Research Institute of Mathematics and Mechanics, Kazan State University
Full-text PDF (287 kB) Citations (1)
References:
PDF
HTML
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.
Received: 24.05.2005
English version:
Journal of Applied and Industrial Mathematics, 2007, Volume 1, Issue 1, Pages 33–44
DOI: https://doi.org/10.1134/S1990478907010048
Bibliographic databases:
UDC: 519.72
Language: Russian
Citation: A. F. Gainutdinova, “On simulating the quantum and classical branching programs”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006), 45–64; J. Appl. Industr. Math., 1:1 (2007), 33–44
Citation in format AMSBIB
\Bibitem{Gai06}
\by A.~F.~Gainutdinova
\paper On simulating the quantum and classical branching programs
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2006
\vol 13
\issue 1
\pages 45--64
\mathnet{http://mi.mathnet.ru/da23}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2258903}
\zmath{https://zbmath.org/?q=an:1249.68078}
\transl
\jour J. Appl. Industr. Math.
\yr 2007
\vol 1
\issue 1
\pages 33--44
\crossref{https://doi.org/10.1134/S1990478907010048}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-67849121903}
Linking options:
  • https://www.mathnet.ru/eng/da23
  • https://www.mathnet.ru/eng/da/v13/s1/i1/p45
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:254
    Full-text PDF :109
    References:39
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024