Utilization of variable reordering in quantum ESCT minimization

MaRDI QIDQ3084842zbMATH OpenFDO

Authors M. Sampson, Dimitrios Voudouris, George Papakonstantinou

Publication date 25 March 2011

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• A quantum algorithm for finding minimal exclusive-or expressions for incompletely specified Boolean functions
• QMDD minimization using sifting for variable reordering
• Improving the quantum cost of reversible Boolean functions using reorder algorithm
• Cost optimization technique for quantum circuits
• Realization and synthesis of reversible functions

Cited in

(4)

• Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)
• A quantum algorithm for finding minimal exclusive-or expressions for incompletely specified Boolean functions
• Evaluating ESOP Optimization Methods in Quantum Compilation Flows
• QMDD minimization using sifting for variable reordering

This page was built for publication: Utilization of variable reordering in quantum ESCT minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084842)