Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Reversible modified reconstructability analysis of Boolean circuits and its quantum computation

Reversible modified reconstructability analysis of Boolean circuits and its quantum computation 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Kybernetes Emerald Publishing

Reversible modified reconstructability analysis of Boolean circuits and its quantum computation

Kybernetes , Volume 33 (5/6): 12 – Jun 1, 2004

Loading next page...
 
/lp/emerald-publishing/reversible-modified-reconstructability-analysis-of-boolean-circuits-90M5vxbzt1
Publisher
Emerald Publishing
Copyright
Copyright © 2004 Emerald Group Publishing Limited. All rights reserved.
ISSN
0368-492X
DOI
10.1108/03684920410533976
Publisher site
See Article on Publisher Site

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.

Journal

KybernetesEmerald Publishing

Published: Jun 1, 2004

Keywords: Cybernetics; Boolean functions; Logic

References