Classical Simulation Complexity of Quantum Branching Programs

Farid M. Ablayev. Classical Simulation Complexity of Quantum Branching Programs. In Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf, editors, Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007. Volume 07411 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.