IEEE Ukraine Conference on Electrical and Computer Engineering (UKRCON)

Ternary reversible/quantum latches

Zhengbing Hu, Ivan Yuriychuk, V. G. Deı̆buk

Published May 1, 2017• 0 citations

Abstract

Ternary reversible latches on the basis of one- and two-qutrit permutative Muthukrishnan-Stroud (MS) gates were synthesized for the first time. Such gates can be physically implemented on the basis of liquid ion-trap quantum technology. The use of adaptive genetic algorithm allowed designing the circuits of latches that are optimal with respect to quantum cost, number of gates, and delay time. Comparisons of synthesized circuits with known results of other authors were carried out.

DOI: 10.1109/ukrcon.2017.8100380

Related papers

Genetic Synthesis of New Reversible/Quantum Ternary Comparator

V. G. Deı̆buk, Andrij V. Biloshytskyi

Methods of quantum/reversible logic synthesis are based on the use of the binary nature of quantum computing. However, multiple-valued logic is a promising choice for future quantum computer technology due to a number of advantages over binary circuits. In this paper we have developed a synthesis of ternary reversible circuits based on Muthukrishnan-Stroud gates using a genetic algorithm. The method of coding chromosome is presented, and well-grounded choice of algorithm parameters allowed obtaining better circuit schemes of one- and n-qutrit ternary comparators compared with other methods. These parameters are quantum cost of received reversible devices, delay time and number of constant input (ancilla) lines. Proposed implementation of the genetic algorithm has led to reducing of the device delay time and the number of ancilla qutrits to 1 and 2n-1 for one- and n-qutrits full comparators, respectively. For designing of n-qutrit comparator we have introduced a complementary device which compares output functions of 1-qutrit comparators.

Advances in Electrical and Computer EngineeringJan 1, 201512 citations

New design of reversible/quantum devices for ternary arithmetic

Zhengbing Hu, V. G. Deı̆buk

Multiple-valued logic is a promising choice for future computer technologies, which provides a set of advantages comparing to binary circuits. We have developed an adaptive genetic algorithm for ternary reversible circuits using Muthukrishnan-Stroud gates. The method for chromosomes coding, as well as a reasonable choice of algorithm parameters, allowed obtaining circuits for ternary arithmetic devices, which are better than other known methods in terms of quantum cost, delay time and amount of input ancillary and output garbage qutrits. Based on our realization of ternary parallel full-adder we synthesized reversible ternary parallel adder/subtractor, which has better parameters over the previously reported devices.

IEEE International Conference on Data Stream Mining & Processing (DSMP)Aug 1, 20162 citations

Optimized design of the universal ternary gates for quantum/reversible computing

V. G. Deı̆buk, Iryna Turchenko, Vladyslav Shults

Multiple-valued logic is a promising choice for future computer technologies, which provides a set of advantages comparing to binary circuits. In this paper, we have developed a genetic algorithm-based synthesis of ternary reversible circuits using Muthukrishnan-Stroud gates. The method for chromosomes coding, as well as a reasonable choice of algorithm parameters, allowed obtaining circuits for ternary Toffoli and modified Fredkin gates, which are better than other published methods in terms of quantum cost, delay times and amount of input ancillary and output garbage qutrits.

IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)Sep 1, 20153 citations

Design of a Ternary Reversible/Quantum Adder using Genetic Algorithm

V. G. Deı̆buk, Andrij V. Biloshytskyi

Typical methods of quantum/reversible synthesis are based on using the binary character of quantum computing.However, multi-valued logic is a promising choice for future computer technologies, given a set of advantages when comparing to binary circuits.In this work, we have developed a genetic algorithm-based synthesis of ternary reversible circuits using Muthukrishnan-Stroud gates.The method for chromosomes coding that we present, as well as a judicious choice of algorithm parameters, allowed obtaining circuits for half-adder and full adder which are better than other published methods in terms of cost, delay times and amount of input ancillary bits.A structure of the circuits is analyzed in details, based on their decomposition.

International Journal of Information Technology and Computer ScienceAug 8, 201522 citations

Genetic Algorithm based synthesis of ternary Reversible/Quantum circuit

Rashida Khanoma, Tahseen Kamalb, Mozammel H. A. Khan

Reversible/quantum circuits are believed to be one of the future computer technologies. In this paper, a genetic algorithm (GA) based synthesis of ternary reversible/quantum circuits using Muthukrishnan-Stroud gates is presented. The circuit generated by GA may contain redundant gates. We have used post GA reduction to eliminate these redundant gates. We have experimented with ternary half-adder circuit. The proposed GA converges for many combinations of crossover and mutation.

International Conference on Computer and Information Technology (ICCIT)Dec 1, 200812 citations

Synthesis of Reversible Circuits from a Subset of Muthukrishnan-Stroud Quantum Realizable Multi-Valued Gates

Marek A. Perkowski, Nicholas Denler, Bruce Yen +1 more

We present a new type of quantum realizable reversible cascade. Next we present a new algorithm to synthesize arbitrary single-output ternary functions using these reversible cascades. The cascades use “Generalized Multi-Valued Gates” introduced here, which extend the concept of Generalized Ternary Gates introduced previously. While there were 216 GTGs, a total of 12 ternary gates of the new type are sufficient to realize arbitrary ternary functions. (The count can be further reduced to 5 gates, three 2-qubit and two 1-qubit). Such gates are realizable in quantum ion trap devices. For some functions, the algorithm requires fewer gates than results previously published [1, 5, 8, 14]. In addition, the algorithm also does conversion from arbitrary ternary logic to reversible logic at the cost of relatively small garbage. The algorithm is implemented here in ternary logic, but generalization to arbitrary radix is both straightforward and sees a reduction in growth of cost as the radix is increased.

Jan 1, 200426 citations