三值可逆逻辑的新型综合算法.docVIP

 A Novel Algorithm for Ternary Reversible Logic Synthesis# 5 10 15  Abstract: Reversible logic circuits is a wide rang of applications in the field of quantum computing. Although binary reversible logic circuits research a variety of synthesis algorithms have been proposed,only the validity of limited. Recently, many studies have shown that multi-valued logic for quantum computing has many advantages for the development of quantum computer. Multi-valued logic can reduce the size of the circuit,the elementary gates selectivity for more strong, provided the theoretical basis for synthesis algorithm. In this article, a synthesis algorithm for ternary reversible circuits in the absence of ancilla bits based on group theory is studied. The algorithm can synthesize any ternary reversible circuit with N inputs and N outputs using ternary X gates and TKCX gates. Meanwhile, The ternary X gates and Ternary 1-controlled X gate gates are universal for Quantum permutative circuits is demonstrate. Keywords: Synthesis of reversible circuit; group theory; ternary reversible logic function; synthesis algorithm 20 0 Introduction Quantum computation combines ideas coming from computer science and physics. In quantum computing, the algorithms are commonly described using the quantum circuit model[1]. Quantum permutative circuits (Quantum Reversible circuits) are a subclass of Quantum circuits 25 30 whose efficient realization is important to realize Grover and other quantum algorithms. In 1995, Barenco et al. showed that all one-bit quantum gates and the CNOT gates are universal in binary quantum logic[2].There many researchers related to synthesis with binary reversible gates[3-9]. Now, some researcher found that there are many advantages to expand quantum gates and circuits from binary-valued quantum systems to multi-valued systems, where the three-value quantum system is the simplest multi-valued systems. Ternary quantum bits are called qutrits[10]. Qutrits have three basi