Published In

Kybernetes

Document Type

Post-Print

Publication Date

2004

Subjects

Quantum computing, Computable functions, Computational complexity, Reversible logic, Logic programming

Abstract

Modified Reconstructability Analysis (MRA) can be realized reversibly by utilizing Boolean reversible (3,3) logic gates that are universal in two arguments. The quantum computation of the reversible MRA circuits is also introduced. The reversible MRA transformations are given a quantum form by using the normal matrix representation of such gates. The MRA-based quantum decomposition may play an important role in the synthesis of logic structures using future technologies that consume less power and occupy less space.

Description

Authors' version of an article that subsequently appeared in Kybernetes, published by Emerald Group Publishing Limited. The version of record is available at http://dx.doi.org/10.1108/03684920410533976.

DOI

10.1108/03684920410533976

Persistent Identifier

http://archives.pdx.edu/ds/psu/16501

Share

COinS