GFSOP-based ternary quantum logic synthesis
Mozammel H. A. Khan · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2010
Quantum technology is one of the most promising technologies for future computing systems, since quantum algorithms solve problems much more efficiently than classical algorithms. All quantum algorithms are made up of quantum logic circuits. A quantum logic circuit is made up of quantum gates (reversible in nature) and is designed using reversible logic synthesis methods. For a given Hilbert space, ternary quantum system requires 0.63 times qutrits than the corresponding number of qubits. Thus, the ternary quantum system provides a much more compact and efficient information encoding. Beside other technologies, ternary quantum logic system can be realized using photon polarization. These advantages of ternary quantum system open avenue for developing ternary quantum algorithms. Galois field sum of products (GFSOP) based synthesis of ternary quantum logic circuit is the most practical approach, since any ternary logic function with many inputs can be represented as GFSOP expression and the GFSOP expression can be implemented as cascade of ternary quantum gates. Here we discuss minimization of ternary logic function as GFSOP expression using quantuminspired evolutionary algorithm. We also discuss a method of realization of ternary GFSOP expression using ternary quantum gates. Experimental results are given to show the effectiveness of the ternary GFSOP minimization technique.