Classical Simulation Complexity of Quantum Branching Programs

Author Farid Ablayev



PDF
Thumbnail PDF

Files

DagSemProc.07411.3.pdf
  • Filesize: 212 kB
  • 10 pages
DagSemProc.07411.3-add.pdf
  • Filesize: 171 kB

Document Identifiers

Author Details

Farid Ablayev

Cite As Get BibTex

Farid Ablayev. Classical Simulation Complexity of Quantum Branching Programs. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008) https://doi.org/10.4230/DagSemProc.07411.3

Abstract

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.

Subject Classification

Keywords
  • Quantum algorithms
  • Branching Programs
  • Complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail