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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.