Quantum Multiple-Valued Decision Diagrams with Linear Transformations
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Due to the rapid development of quantum computing, the compact representation of quantum operations based on decision diagrams has been received more and more attraction. Since variable orders have a significant impact on the size of the decision diagram, identifying a good variable order is of paramount importance. In this paper, we integrate linear transformations into an efficient and canonical form of quantum computing: Quantum Multiple-Valued Decision Diagrams (QMDDs) and develop a novel canonical representation, namely linearly transformed QMDDs (LTQMDDs). We design a linear sifting algorithm for LTQMDDs that search a good linear transformation to obtain a more compact form of quantum function. Experimental results show that the linear sifting algorithm is able to generate decision diagrams that are significantly improved compared with the original sifting algorithm. Moreover, for certain types of circuits, linear sifting algorithm have good performance whereas sifting algorithm does not decrease the size of QMDDs.