International Conference on Green Computing and Internet of Things (ICGCIoT)

Low cost realization of square and square multiplication operations using toffoli gates

Jitesh Kumar Meena, Chotu Lal, Hitesh Gupta, Sushil Chandra Jain

Published Oct 1, 2015• 1 citation

Abstract

Binary number system is the most basic building block of the multi-valued logic system. We realize the quantum quaternary logic using basic quantum quaternary logic gates. In this paper, we developed a square-multiplier unit with the help of square operation. We developed also a cost evaluation technique of the square and square-multiplication operations using the normal expressions.

DOI: 10.1109/icgciot.2015.7380667

Related papers

Some Basic Ternary Operations Using Toffoli Gates Along with the Cost of Implementation

Ayan Kumar Biswas, Shuvro Chowdhury, Md. Mahmud Muntakim Khan +2 more

We realize square operation for quantum ternary logic using basic quantum ternary gates. With the aid of this square operation, we develop a square-multiplier unit. We further develop a cost measurement technique of the square operation and square multiplication operation through general expressions.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)May 1, 20115 citations

Low-cost realization of toffoli gate for the low-cost synthesis of quantum ternary logic functions

Md. Mehedi Hasan

Reversible quantum computer system is one of the best choices for future computer systems. Multiple-valued logic especially ternary logic is a good candidate for the realization of reversible quantum computer. An efficient logic synthesis mechanism is essential for the low-cost realization. Toffoli gate is an important gate for quantum logic synthesis. It is the basic element for the Galois Field Sum of Product (GFSOP) expression based logic synthesis mechanism. So, for low-cost realization of any ternary logic function, a low-cost implementation of Toffoli gate is very necessary. This paper shows a low-cost, practically realizable, and efficient realization of 3-qutrit ternary Toffoli gate by using ion-trap realizable Muthukrishnan-Stroud gate. This realization is more efficient and less costly than other realizations.

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

Quantum Realization of Quaternary Feynman and Toffoli Gates

Mozammel H. A. Khan

Multiple-valued logic functions having many input variables can be easily expressed as Galois field sum of products (GFSOP) expression and can be realized using cascade of multiple-valued Feynman and Toffoli gates (Khan et al., 2005). Conventional binary functions can be expressed very easily as quaternary functions by grouping 2-bits together. These quaternary functions can be expressed as quaternary Galois field sum of products expression and can be implemented as cascade of quaternary Feynman and Toffoli gates. These gates are macro-level gates and need to be realized using technology based primitive gates. In this paper, we show the realization of quaternary Feynman and Toffoli gates on the top of theoretically liquid ion-trap realizable 1-qudit and 2-qudit Muthukrishnan-Stroud gates (Muthukrishnan, 2000).

International Conference on Electrical and Computer Engineering (ICECE)Dec 1, 200619 citations

A Synthesis Method for Quaternary Quantum Logic Circuits

Sudhindu Bikash, Mandal Amlan, Chakrabarti Susmita Sur-kolay

Synthesis of quaternary quantum circuits involves basic quaternary gates and logic operations in the quaternary quantum domain. In this paper, we propose new projection operations and quaternary logic gates for synthesizing quaternary logic functions. We also demonstrate the realization of the proposed gates using basic quantum quaternary operations. We then employ our synthesis method to design of quaternary adder and some benchmark circuits. Our results in terms of circuit cost, are better than the existing works.

Aug 17, 201610 citations

Design and optimization of the multi-valued quantum adder

Jing-wen Ai, Ting-yan Zhang, Shih-Wen Lu +2 more

Abstract Multi-valued quantum logic circuits possess the ability to store and process more intricate information than binary quantum logic circuits. A key component within numerous intricate computational circuits is the multi-valued quantum adder circuit. The primary objective of this paper is to propose a multi-valued quantum full adder and an optimal replacement of two multi-valued Toffoli gate cascades which can effectively reduce the quantum cost of the circuit. Constructed from multi-valued 1-qudit and 2-qudit M-S gates, this adder circuit is designed by effectively setting the control conditions of multi-valued quantum Toffoli gates. For a quaternary quantum adder based on this M-S gate architecture, the number of QC, 1-qudit gates, and 2-qudit gates are 48.6%, 46.2%, and 54.2%, respectively, of the previous design. Additionally, NCI and NGO are consistent with prior adder. It shows the potential applications of complex quantum reversible logic circuits.

Physica ScriptaMar 19, 20254 citations

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

Mozammel H. A. Khan

Quaternary logic is very suitable for encoded realization of binary logic functions by grouping 2-bits together into quaternary digits. This sort of quaternary encoded reversible realization of binary logic function requires half times input/output lines than the original binary reversible realization. Quaternary decoder, multiplexer, and demultiplexer are very important building blocks of quaternary digital systems. In this paper, we show reversible realization of these circuits using quaternary reversible gates like quaternary shift gates (QSG), quaternary controlled shift gates (QCSG), and quaternary Toffoli gates (QTG). We also show the realization of multi-digit QCSG and QTG using QSG and QCSG, which are realizable using liquid ion-trap quantum technology and other reversible technologies.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)May 1, 200820 citations