Reversible Modified Reconstructability Analysis of Boolean Circuits and Its Quantum ComputationKybernetes
- Quantum computing,
- Computable functions,
- Computational complexity,
- Reversible logic,
- Logic programming
AbstractModified 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.
Citation InformationAl-Rabadi, A., and Zwick, M. (2004). "Reversible Modified Reconstructability Analysis of Boolean Circuits and Its Quantum Computation." Kybernetes, vol. 33, No. 5/6, pp. 921-932