QMDD Minimization using Sifting for Variable Reordering
David Michael Miller, David Y. Feinstein, Mitchell Aaron Thornton · 2007
This paper considers variable reordering for quantum multiplevalued 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 implement a vertex reduction procedure for QMDDs using sifting. Experimental results are presented showing the effectiveness of the proposed technique.