Upper bounds for reversible circuits based on Young subgroups
From MaRDI portal
Publication:2446569
Recommendations
Cites work
Cited in
(12)- \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction
- Canonical mixed-polarity multi-target Toffoli circuits: shift and removal
- Complexity of reversible circuits and their quantum implementations
- Canonical multi-target Toffoli circuits
- Ricercar: a language for describing and rewriting reversible circuits with ancillae and its permutation semantics
- Technology mapping for single target gate based circuits using Boolean functional decomposition
- Optimal 4-bit reversible mixed-polarity Toffoli circuits
- Classifying data using near-term quantum devices
- Ancilla-free synthesis of large reversible functions using binary decision diagrams
- Asymptotically optimal synthesis of reversible circuits
- Nearly optimal circuit size for sparse quantum state preparation
- Young subgroups for reversible computers.
This page was built for publication: Upper bounds for reversible circuits based on Young subgroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446569)