Published in: Dagstuhl Seminar Proceedings, Volume 7411, Algebraic Methods in Computational Complexity (2008)
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)
@InProceedings{ablayev:DagSemProc.07411.3, author = {Ablayev, Farid}, title = {{Classical Simulation Complexity of Quantum Branching Programs}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7411}, editor = {Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07411.3}, URN = {urn:nbn:de:0030-drops-13107}, doi = {10.4230/DagSemProc.07411.3}, annote = {Keywords: Quantum algorithms, Branching Programs, Complexity} }
Feedback for Dagstuhl Publishing