Efficient Representation of Boolean Components

This chapter discusses efficient representations for Boolean components occurring in quantum algorithms. More precisely, Boolean functions are first represented as matrices, where columns and rows represent input and output patterns, respectively. Then, decision diagrams (similar to those of the DD-based simulator presented earlier in this book) are utilized in order to gain a compact representation of these matrices. The algorithms of the remaining chapters of this part of the book then utilize matrix operations to solve the considered synthesis tasks.