Reversible Logic Circuit Synthesis

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

30 pages, 14 figs+tables. To appear in IEEE Transactions on Computer-Aided Design of Electronic Circuits. Contains results pre

Scientific paper

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 field 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. We study circuit decompositions of reversible circuits where gates of the same type are next to each other. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover's search algorithm, and show a significant improvement over a previously proposed synthesis algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Reversible Logic Circuit Synthesis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reversible Logic Circuit Synthesis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reversible Logic Circuit Synthesis will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-679032

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.