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

Association for Computing Machinery — Nov 10, 2002

Loading next page...
 
/lp/association-for-computing-machinery/reversible-logic-circuit-synthesis-pdNY0n2aNc
Datasource
Association for Computing Machinery
Copyright
Copyright © 2002 by ACM Inc.
ISBN
0-7803-7607-2
D.O.I.
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.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off