Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.