In this paper we develop novel algorithms for the simulation of quantum circuits on classical computers. The most efficient techniques previously studied, represent both quantum state vectors and quantum operator matrices as Multi-Terminal Binary Decision Diagrams (MTBDDS). This paper shows how to avoid representing quantum operators as matrices. Instead, we introduce a class of quantum operators that can be represented more compactly using a symbolic, BDD-based representation. We propose algorithms that apply operators on quantum states, using the symbolic representation. Our algorithms are shown to have superior performance over previous techniques, both asymptotically and experimentally. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Samoladas, V. (2008). Improved BDD algorithms for the simulation of quantum circuits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 720–731). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_60
Mendeley helps you to discover research relevant for your work.