Make it reversible: Efficient embedding of non-reversible functions
Authors:
- Alwin ZulehnerAZAlwin Zulehner
- Robert WilleRWRobert Wille
- 1 March 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 458-463
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Taking one-to-one mappings for granted: Advanced logic design of encoder circuits2017
- Embedding of Large Boolean Functions for Reversible LogicACM Journal on Emerging Technologies in Computing Systems, 2015
- QMDDs: Efficient Quantum Function Representation and ManipulationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2015
- Automatic design of low-power encoders using reversible circuit synthesis2012
- Synthesis of reversible circuits with minimal lines for large functions2012
- Determining the minimal number of lines for large reversible circuits2011
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonanceNature, 2001
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Energy recovery circuits using reversible and partially reversible logicIEEE Transactions on Circuits and Systems I: Regular Papers, 1996
- Logical Reversibility of ComputationIBM Journal of Research and Development, 1973