Pages that link to "Item:Q353018"
From MaRDI portal
The following pages link to Depth-optimized reversible circuit synthesis (Q353018):
Displaying 14 items.
- On asymptotic gate complexity and depth of reversible circuits without additional memory (Q340566) (← links)
- Synthesis of quantum circuits for linear nearest neighbor architectures (Q544832) (← links)
- Synthesis of reversible circuits with minimal costs (Q734115) (← links)
- Reversible circuit synthesis by genetic programming using dynamic gate libraries (Q1679386) (← links)
- Optimized 4-bit quantum reversible arithmetic logic unit (Q1700857) (← links)
- Tools for quantum and reversible circuit compilation (Q1705571) (← links)
- Improving synthesis of reversible circuits: exploiting redundancies in paths and nodes of QMDDs (Q1705611) (← links)
- Depth optimization for topological quantum circuits (Q2018168) (← links)
- Verified compilation of space-efficient reversible circuits (Q2164204) (← links)
- Towards a Cost Metric for Nearest Neighbor Constraints in Reversible Circuits (Q2822521) (← links)
- Application of Functional Decomposition in Synthesis of Reversible Circuits (Q2822524) (← links)
- A Post-Synthesis Optimization Technique for Reversible Circuits Exploiting Negative Control Lines (Q2982334) (← links)
- (Q5325296) (← links)
- (Q5368765) (← links)