Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Reversible logic circuit synthesis

Reversible logic circuit synthesis Reversible Logic Circuit Synthesis £ Vivek V. Shende, Aditya K. Prasad, Igor L. Markov, and John P. Hayes Advanced Computer Architecture Laboratory, University of Michigan, Ann Arbor, MI 48109-2122 vshende,akprasad,imarkov,jhayes @umich.edu ABSTRACT Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement in the emerging eld of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels). We prove constructively that every even permutation can be implemented without temporary storage using NOT, CNOT and TOFFOLI gates. We describe an algorithm for the synthesis of optimal circuits and study the reversible functions on three wires, reporting distributions of circuit sizes. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover ™s search algorithm, and show a signi cant improvement over a previously proposed synthesis algorithm. 1. INTRODUCTION In most computing tasks, the number of output bits is relatively small compared to the number of input bits. For example, in a decision problem, the output is only one bit (yes or no) and the input can be as large as http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Reversible logic circuit synthesis

Shende, Vivek V.; Prasad, Aditya K.; Markov, Igor L.; Hayes, John P.
Association for Computing Machinery — Nov 10, 2002
Download PDF
8 pages

Loading next page...
 
/lp/association-for-computing-machinery/reversible-logic-circuit-synthesis-pdNY0n2aNc

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Datasource
Association for Computing Machinery
Copyright
Copyright © 2002 by ACM Inc.
ISBN
0-7803-7607-2
doi
10.1145/774572.774625
Publisher site
See Article on Publisher Site

Abstract

Reversible Logic Circuit Synthesis £ Vivek V. Shende, Aditya K. Prasad, Igor L. Markov, and John P. Hayes Advanced Computer Architecture Laboratory, University of Michigan, Ann Arbor, MI 48109-2122 vshende,akprasad,imarkov,jhayes @umich.edu ABSTRACT Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement in the emerging eld of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels). We prove constructively that every even permutation can be implemented without temporary storage using NOT, CNOT and TOFFOLI gates. We describe an algorithm for the synthesis of optimal circuits and study the reversible functions on three wires, reporting distributions of circuit sizes. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover ™s search algorithm, and show a signi cant improvement over a previously proposed synthesis algorithm. 1. INTRODUCTION In most computing tasks, the number of output bits is relatively small compared to the number of input bits. For example, in a decision problem, the output is only one bit (yes or no) and the input can be as large as

There are no references for this article.