Cofactor Sharing for Reversible Logic Synthesis

Autor:	Massoud Pedram, Mehdi Saeedi, Alireza Shafaei
Rok vydání:	2014
Předmět:	Modular exponentiation Theoretical computer science Computer science Parallel computing Oracle Logic synthesis Hardware and Architecture Lookup table Quantum algorithm Quantum walk Electrical and Electronic Engineering Realization (systems) Software Hardware_LOGICDESIGN Logic optimization
Zdroj:	ACM Journal on Emerging Technologies in Computing Systems. 11:1-21
ISSN:	1550-4840 1550-4832
Popis:	Improving circuit realization of known quantum algorithms by CAD techniques has benefits for quantum experimentalists. In this article, the problem of synthesizing a given function on a set of ancillea is addressed. The proposed approach benefits from extensive sharing of cofactors among cubes that appear on function outputs. Accordingly, it can be considered a multilevel logic optimization technique for reversible circuits. In particular, the suggested approach can efficiently implement any n -input, m -output lookup table (LUT) by a reversible circuit. This problem has interesting applications in the Shor's number-factoring algorithm and in quantum walk on sparse graphs. Simulation results reveal that the proposed cofactor-sharing synthesis algorithm has a significant impact on reducing the size of modular exponentiation circuits for Shor's quantum factoring algorithm, oracle circuits in quantum walk on sparse graphs, and the well-known MCNC benchmarks.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::fd17a24b2d7839c08222899c23c77af4 https://doi.org/10.1145/2629524 Zobrazit plný text záznamu