eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2008-01-23
1
10
10.4230/DagSemProc.07411.3
article
Classical Simulation Complexity of Quantum Branching Programs
Ablayev, Farid
We present classical simulation techniques for measure once quantum
branching programs.
For bounded error syntactic quantum branching program of width $w$
that computes a function with error $delta$ we present a classical
deterministic branching program of the same length and width at most
$(1+2/(1-2delta))^{2w}$ that computes the same function.
Second technique is a classical stochastic simulation technique for
bounded error and unbounded error quantum branching programs. Our
result is that it is possible stochastically-classically simulate
quantum branching programs with the same length and almost the same
width, but we lost bounded error acceptance property.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07411/DagSemProc.07411.3/DagSemProc.07411.3.pdf
Quantum algorithms
Branching Programs
Complexity