“Synthesis of Reversible Circuits.” In , 101–108.

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. 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.

Synthesis of reversible circuits.

“Synthesis of Reversible Logic for Nanoelectronic Circuits.”  35 (3): 325–341.

Synthesis of reversible logic for nanoelectronic circuits.

Shaunak Basu and Subhashree Basu. Article: Reversible Logic Synthesis of Sequential Circuits. 129(11):29-32, November 2015. Published by Foundation of Computer Science (FCS), NY, USA.

Synthesis and testing are two important areas of reversible logic.

Reversible logic is gaining importance in recent years largely due to its property of low power consumption. It has a wide range of applications which include advance computing, low power CMOS, optical information processing, quantum computing, DNA cryptography and nanotechnology. Reversible gates are the building blocks of quantum computation. This paper presents a novel design of D, JK and T flip-flops using the existing reversible gates. All circuits have been modeled and verified using Verilog and Modelsim. A comparative study in terms of the number of gates, number of garbage outputs and quantum costs is also presented.

“Synthesis of Reversible Logic for Nanoelectronic Circuits.”  35.3 (2007): 325–341.

Synthesis of reversible logic circuits - IEEE Xplore …

This paper proposes an exact synthesisapproach based on an iterative deepening version of the A* algorithmusing the multiple-control Toffoli gate library.

Reversible Logic Circuit Synthesis

AB - 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. 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.

BDD-based synthesis of reversible logic for large functions.

AB - 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 the distribution of circuit sizes. We also study canonical circuit decompositions where gates of the same kind are grouped together. 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.

Using crosspoint faults in simplifying Toffoli networks.

Jha, ``SLOPES: Hardware-softwareco-synthesis of low power real-time distributed embedded systems withdynamically reconfigurable FPGAs," IEEE Trans.

Synthesis of Reversible Logic Circuits - Scribd

N2 - 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 the distribution of circuit sizes. We also study canonical circuit decompositions where gates of the same kind are grouped together. 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.