scholarly journals The Group Zoo of Classical Reversible Computing and Quantum Computing

Author(s):  
Alexis De Vos ◽  
Stijn De Baerdemacker
2021 ◽  
Author(s):  
Edinelço Dalcumune ◽  
Luis A. B. Kowada ◽  
Celina M. H. de Figueiredo ◽  
Franklin De L. Marquezino

One of the main motivations for reversible computing is that quantum computing has as one of its foundations the reversibility of all gates, that is, quantum computing circuit models are reversible. An important problem in reversible computing that has been intensively studied for the last decades is the synthesis of reversible circuits. The extended abstract considers optimization rules aiming to a new algorithm for post-synthesis optimization of reversible circuits composed of generalized Toffoli gates.


In this era of nanometer semiconductor nodes, the transistor scaling and voltage scaling are not any longer in line with each other, leading to the failure of the Dennard scaling. Thus, it poses a severe design challenge. Reversible computing plays a vital role in applications like low power CMOS, nanotechnology, quantum computing, optical computing, digital signal processing, cryptography, computer graphics andmany more. The primary reasons for designing reversible logic are diminishing the quantum cost, profundity of the circuits and the garbage outputs. It is impossible to determine the quantum computing without implementing the reversible computation. This paper will represent the literature survey based on several papers on combinational circuits using reversible computing and also the future scope is to be discussed.


2019 ◽  
Author(s):  
Mark Fingerhuth ◽  
Tomáš Babej ◽  
Peter Wittek

2019 ◽  
Author(s):  
Federica Eftimiadi ◽  
Enrico Pugni Trimigliozzi

Reversible computing is a paradigm where computing models are defined so that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. Also, it is one of the basic microscopic physical laws of nature. Reversible computing refers tothe computation that could always be reversed to recover its earlier state. It is based on reversible physics, which implies that we can never truly erase information in a computer. Reversible computing is very difficult and its engineering hurdles are enormous. This paper provides a brief introduction to reversible computing. With these constraints, one can still satisfactorily deal with both functional and structural aspects of computing processes; at the same time, one attains a closer correspondence between the behavior of abstract computing systems and the microscopic physical laws (which are presumed to be strictly reversible) that underlay any implementation of such systems Available online at https://int-scientific-journals.com


2018 ◽  
Author(s):  
Rajendra K. Bera

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.


2001 ◽  
Author(s):  
Timothy E. Havel ◽  
David G. Cory

Sign in / Sign up

Export Citation Format

Share Document