QMDD minimization using sifting for variable reordering
From MaRDI portal
Recommendations
- Minimization of quantum multiple-valued decision diagrams using data structure metrics
- On the ``Q in QMDDs: efficient representation of quantum functionality in the QMDD data-structure
- Reversible logic synthesis based on decision diagram variable ordering
- Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram
- Utilization of variable reordering in quantum ESCT minimization
Cited in
(8)- Efficient construction of QMDDs for irreversible, reversible, and quantum functions
- Reordering decision diagrams for quantum computing is harder than you might think
- On the ``Q in QMDDs: efficient representation of quantum functionality in the QMDD data-structure
- Utilization of variable reordering in quantum ESCT minimization
- Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram
- Quantum multiple-valued decision diagrams containing skipped variables
- Minimization of quantum multiple-valued decision diagrams using data structure metrics
- A tutorial on applying quantum multiple-valued decision diagrams to circuit simulation
This page was built for publication: QMDD minimization using sifting for variable reordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446301)
