ویراساینس.
سند علمی

Ancilla-free Reversible Logic Synthesis via Sorting

Anupam Chattopadhyay, Sharif Md Khairul Hossain

چکیده

Reversible logic synthesis is emerging as a major research component for post-CMOS computing devices, in particular Quantum computing. In this work, we link the reversible logic synthesis problem to sorting algorithms. Based on our analysis, an alternative derivation of the worst-case complexity of generated reversible circuits is provided. Furthermore, a novel column-wise reversible logic synthesis method, termed RevCol, is designed with inspiration from radix sort. Extending the principles of RevCol, we present a hybrid reversible logic synthesis framework. The theoretical and experimental results are presented. The results are extensively benchmarked with state-of-the-art ancilla-free reversible logic synthesis methods.

اسناد مشابه

  • Reversible Logic Synthesis with Minimal Usage of Ancilla Bits

    سند علمی۲۰۱۵CoRRSiyao Xu

    Reversible logic has attracted much research interest over the last few decades, especially due to its application in quantum computing. In the construction of reversible gates from basic gates, ancilla bits are commonly used to remove restrictions on the type of gates that a cer

  • Ancilla-Quantum Cost Trade-off during Reversible Logic Synthesis using Exclusive Sum-of-Products

    سند علمی۲۰۱۴CoRRAnupam Chattopadhyay, Nilanjan Pal, Soumajit Majumder

    Emerging technologies with asymptotic zero power dissipation, such as quantum computing, require the logical operations to be done in a reversible manner. In recent years, the problem of synthesizing Boolean functions in the reversible logic domain has gained significant research

  • Sorting Network for Reversible Logic Synthesis

    سند علمی۲۰۱۰CoRRMd. Saiful Islam, Md. Rafiqul Islam, Abdullah Al Mahmud, Muhammad Rezaul Karim

    In this paper, we have introduced an algorithm to implement a sorting network for reversible logic synthesis based on swapping bit strings. The algorithm first constructs a network in terms of n*n Toffoli gates read from left to right. The number of gates in the circuit produced

  • BSSSN: Bit String Swapping Sorting Network for Reversible Logic Synthesis

    سند علمی۲۰۱۰CoRRMd. Saiful Islam

    In this paper, we have introduced the notion of UselessGate and ReverseOperation. We have also given an algorithm to implement a sorting network for reversible logic synthesis based on swapping bit strings. The network is constructed in terms of n*n Toffoli Gates read from left t

  • Efficient ancilla-free reversible and quantum circuits for the Hidden Weighted Bit function

    مقاله‌ی دسترسی آزاد۲۰۲۱IEEE Transactions on Computers['Sergey Bravyi', 'Theodore J. Yoder', 'Dmitri A. Maslov', '']

    The Hidden Weighted Bit function plays an important role in the study of classical models computation. A common belief is that this exponentially hard for implementation by reversible ancilla-free circuits, even though introducing a small number ancillae allows very efficient imp

  • ARASP: An ASIP Processor for Automated Reversible Logic Synthesis

    مقاله۲۰۲۲Journal of Information Systems and TelecommunicationZeinab Kalantari, Marzieh Gerami, Mohammad eshghi

    Reversible logic has been emerged as a promising computing paradigm to design low power circuits in recent years. The synthesis of reversible circuits is very different from that of non-reversible circuits. Many researchers are studying methods for synthesizing reversible combina