Function translations and search-based transformation for MVL reversible circuit synthesis

•Two function translations and search transformation-based synthesis are introduced.•Simplifying the circuit post-synthesis is considered with novel gate pairing.•Quantum circuit implementation constraints are considered.•Experimental results for all 2-input 3-valued functions are given.•Other examp...

Full description

Saved in:
Bibliographic Details
Published in:Science of computer programming 2021-12, Vol.212, p.102704, Article 102704
Main Authors: Miller, D. Michael, Dueck, Gerhard W.
Format: Article
Language:English
Subjects:
Circuit simplification
Multiple-valued logic
Quantum circuits
Reversible circuits
Transformation-based synthesis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Two function translations and search transformation-based synthesis are introduced.•Simplifying the circuit post-synthesis is considered with novel gate pairing.•Quantum circuit implementation constraints are considered.•Experimental results for all 2-input 3-valued functions are given.•Other examples show both the effectiveness and limitations of the new approaches. Two new function translations and a novel bounded search transformation-based synthesis approach that finds a reversible circuit implementation for a given 3-valued reversible function are presented. Methods for simplifying the circuit post-synthesis and quantum circuit implementation constraints are also considered. Experimental results for all 2-input 3-valued functions show the effectiveness of the new approaches compared to earlier transformation-based synthesis approaches. Other examples are given to show both the effectiveness and limitations of the new approaches which point to a number of key areas for further research.
ISSN:0167-6423
1872-7964
DOI:10.1016/j.scico.2021.102704