Embedding Functions Into Reversible Circuits: A Probabilistic Approach to the Number of Lines
(In Proceedings of the 56th Annual Design Automation Conference, presented in Las Vegas, NV, USA, ACM, ISBN: 978-1-4503-6725-7/19/06, Jun. 2019)
Abstract
In order to compute a non-invertible function on a reversible circuit, one needs to embed the function into a larger function which has some garbage bits, corresponding to additional lines. The problem of determining the minimal number of garbage bits that are needed to embed a given function has attracted extensive research, largely motivated by quantum computing, where the number of lines equals the number of qubits. However, all approaches that are known have either no theoretical quality guarantees (bounds on approximation factors) or require exponential runtime. We present an efficient probabilistic approximation algorithm with theoretical bounds.
Documents
download article:
Recorded talk (best effort)
BibTeX
@inproceedings{gleinig-embedding, author={Niels Gleinig and Frances Ann Hubis and Torsten Hoefler}, title={{Embedding Functions Into Reversible Circuits: A Probabilistic Approach to the Number of Lines}}, year={2019}, month={Jun.}, booktitle={Proceedings of the 56th Annual Design Automation Conference}, location={Las Vegas, NV, USA}, publisher={ACM}, isbn={978-1-4503-6725-7/19/06}, source={http://www.unixer.de/~htor/publications/}, }
