Complexity of reversible circuits and their quantum implementations
From MaRDI portal
Publication:2634672
DOI10.1016/j.tcs.2016.01.011zbMath1335.68093WikidataQ59242186 ScholiaQ59242186MaRDI QIDQ2634672
Mathias Soeken, Nabila Abdessaied, Matthew Amy, Rolf Drechsler
Publication date: 18 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.011
synthesis; upper bounds; complexity analysis; reversible circuits; quantum circuits; reversible functions; technology mapping
Related Items
Boolean satisfiability in quantum compilation, OR-Toffoli and OR-Peres Reversible Gates, Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures, Simulation of a multidimensional input quantum perceptron, An improved and cost reduced quantum circuit generator approach for image encoding applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Young subgroups for reversible computers.
- On figures of merit in reversible and quantum logic designs
- Upper bounds for reversible circuits based on Young subgroups
- Reversible Computing
- Quantum Circuit Optimization by Hadamard Gate Reduction
- A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis