QMDD Minimization using Sifting for Variable Reordering

D. Michael Miller, David Y. Feinstein and Mitchell A. Thornton

This paper considers variable reordering for quantum multiple-valued decision diagrams (QMDDs) used to represent the matrices describing reversible/quantum gates and circuits. An efficient method for adjacent variable interchange is presented and this method is employed to imple-ment a vertex reduction procedure for QMDDs using sifting. Experimental results are presented showing the effectiveness of the proposed technique.