The following pages link to Mathias Soeken (Q491239):
Displaying 18 items.
- Ancilla-free synthesis of large reversible functions using binary decision diagrams (Q491242) (← links)
- Quantum circuits for floating-point arithmetic (Q1796377) (← links)
- SAT-based {CNOT, \(T\)} quantum circuit synthesis (Q1796379) (← links)
- The complexity of error metrics (Q1799556) (← links)
- Pairs of majority-decomposing functions (Q1799568) (← links)
- Upper bounds for reversible circuits based on Young subgroups (Q2446569) (← links)
- Complexity of reversible circuits and their quantum implementations (Q2634672) (← links)
- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT (Q2818016) (← links)
- Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics (Q2822512) (← links)
- Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition (Q2822513) (← links)
- White Dots do Matter: Rewriting Reversible Logic Circuits (Q2868449) (← links)
- Reducing the Depth of Quantum Circuits Using Additional Circuit Lines (Q2868452) (← links)
- Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models (Q3012970) (← links)
- Enumeration of Reversible Functions and Its Application to Circuit Complexity (Q3186605) (← links)
- A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis (Q3186608) (← links)
- Quantum Circuit Optimization by Hadamard Gate Reduction (Q3188921) (← links)
- Mapping NCV Circuits to Optimized Clifford+T Circuits (Q3188922) (← links)
- Boolean satisfiability in quantum compilation (Q4993497) (← links)
