Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Multiple-Valued Logic (ISMVL)

Synthesis Techniques for Ternary Quantum Logic

Sudhindu Bikash Mandal, Amlan Chakrabarti, Susmita Sur‐Kolay

Published May 1, 2011• 27 citations
Publisher

Abstract

Synthesis of ternary quantum circuits involves basic ternary gates and logic operations in the ternary quantum domain. Works that define ternary algebra and their applications for ternary quantum logic realization, are very few. In this paper, we express a ternary logic function in terms of projection operations including a new one. We demonstrate how to realize a few new multi-qutrit ternary gates in terms of generalized ternary gates and projection operations. We then employ our synthesis method to design ternary adder circuits which have better cost than that obtained by earlier method.

DOI
10.1109/ismvl.2011.55

Related papers

Quantum Ternary Circuit Synthesis Using Projection Operations

Sudhindu Bikash Mandal, Amlan Chakrabarti, Susmita Sur‐Kolay

Basic logic gates and their operations in ternary quantum domain are involved in the synthesis of ternary quantum circuits. Only a few works define ternary algebra for ternary quantum logic realization. In this paper, a ternary logic function is expressed in terms of projection operations including a new one. A method to realize new multi-qutrit ternary gates in terms of generalized ternary gates and projection operations is also presented. We also introduced ten simplification rules for reducing ancilla qutrits and gate levels. Our method yields lower gate cost and fewer gate levels and ancilla qutrits than that obtained by earlier methods for the ternary benchmark circuits. The $n$ qutrit ternary sum function is synthesized without any ancilla qutrit by our proposed methodology.

arXiv:1205.2390•May 9, 2012•5 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, 2016•10 citations

An efficient synthesis method for ternary reversible logic

Saikat Basu, Sudhindu Bikash Mandal, Amlan Chakrabarti +2 more

While the role of ternary reversible and quantum computation has been growing, synthesis methodologies for such logic, have been addressed in only a few works. A reversible ternary logic function can be expressed as minterms by using projection operators. In this paper, a novel realization of the projection operators using a minimum number of permutative ternary Muthukrishnan-Stroud (M-S) gates is presented. Next, an efficient method for logic simplification for ternary reversible logic is proposed. This method along with the new construction of projection operators yields significantly lower gate cost of approximately 31% less than that obtained by earlier methodologies, for the synthesis of ternary benchmark circuits.

IEEE International Symposium on Circuits and Systems proceedings•May 1, 2016•6 citations

A Review on Fundamentals of Ternary Reversible Logic Circuits

P. Mercy Nesa Rani, Phrangboklang Lyngton Thangkhiew

One of the main motivations for using ternary logic systems is the amount of information per circuit line is higher as compared to the corresponding binary logic representation, thereby leading to more compact circuit realizations. This is particularly attractive for quantum computing as qutrits are expensive resources and minimizing their number is one of the main objectives during synthesis. Therefore, ternary reversible logic synthesis has drawn significant attention among researchers. It deals with fundamental unit of information called qutrits that can exist in one of the three states |0>, |1> and |2>. Hence, the aim of this paper is to bridge the knowledge gap for the beginners in this domain than searching the entire space. Therefore, the present work discusses the basic concepts of ternary reversible logic and ternary reversible gates. The detailed discussion of the various ternary reversible logic synthesis will enable the beginners in this domain to understand the ternary reversible logic in a better way.

International Conference on Computational Performance Evaluation (ComPE)•Jul 1, 2020•9 citations

Synthesis of Ternary Grover's Algorithm

Sudhindu Bikash Mandal, Amlan Chakrabarti, Susmita Sur‐Kolay

Grover's search algorithm is one of the well-studied quantum computing algorithms, which plays a key role in many applications such as graph coloring, triangle finding, Boolean satisfiability. Although there are many works on circuit synthesis for Grover's algorithm in the binary quantum domain, only a few exist for the ternary version of the algorithm. In this paper, we first propose a new ternary superposition operator and utilize it to synthesize a ternary quantum logic circuit for Grover's algorithm. Our proposed circuits for a ternary oracle and the ternary Grover's diffusion operator require 4 and 6 gate levels respectively per iteration, and for the ternary oracle 1 ancilla qutrit. To the best of our knowledge, this is the first circuit for the Grover's diffusion operator using ternary gates. Finally, we use these two circuits to present a ternary quantum circuit for the vertex coloring problem. The oracle circuit for this problem has smaller gate count compared to existing solutions.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2014•11 citations

A Synthesis Method of Quantum Reversible Logic Circuit Based on Elementary Qutrit Quantum Logic Gates

Fuyou Fan, Guowu Yang, Gang Yang +1 more

Because ternary computer has more superiority than other d-ary number systems, we focus on the investigation of ternary elementary quantum gates and the synthesis algorithm of ternary quantum logic circuits. Above all, Pauli operators and their matrices on qutrit are introduced. Then eight qutrit operators are selected as elementary operators and eight qutrit quantum logic gates are defined. Permutation groups are introduced to characterize the quantum gates and quantum logic circuits. Some important qutrit quantum logic gates are defined also, such as QNOT, QKCXi, EQKCXi, QSwap, QCNOT and EQCNOT. Based on these elementary gates, we prove two very important theorems: (1) all qutrit quantum reversible logic circuit can be generated by Xi gate and QKCXi gate; (2) all qutrit quantum reversible logic circuits can be generated by Xi gate and QCNOT gate. The two theorems indicate that any complicated qutrit quantum reversible circuit can be constructed by the simplest ternary quantum gate. This will greatly simplify the implementation difficulty of quantum circuit. Subsequently, we propose a synthesis algorithm for qutrit quantum reversible logic circuit, which is verified through simulation experiment by the computer program we have designed.

Journal of Circuits Systems and Computers•Jul 2, 2015•14 citations
Synthesis of ternary quantum circuits involves basic ternary gates and logic operations in the ternary quantum domain. Works that define ternary algebra and their applications for ternary quantum logic realization, are very few. In this paper, we express a ternary logic function in terms of projection operations including a new one. We demonstrate how to realize a few new multi-qutrit ternary gates in terms of generalized ternary gates and projection operations. We then employ our synthesis method to design ternary adder circuits which have better cost than that obtained by earlier method.
Basic logic gates and their operations in ternary quantum domain are involved in the synthesis of ternary quantum circuits. Only a few works define ternary algebra for ternary quantum logic realization. In this paper, a ternary logic function is expressed in terms of projection operations including a new one. A method to realize new multi-qutrit ternary gates in terms of generalized ternary gates and projection operations is also presented. We also introduced ten simplification rules for reducing ancilla qutrits and gate levels. Our method yields lower gate cost and fewer gate levels and ancilla qutrits than that obtained by earlier methods for the ternary benchmark circuits. The nnn qutrit ternary sum function is synthesized without any ancilla qutrit by our proposed methodology.
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.
While the role of ternary reversible and quantum computation has been growing, synthesis methodologies for such logic, have been addressed in only a few works. A reversible ternary logic function can be expressed as minterms by using projection operators. In this paper, a novel realization of the projection operators using a minimum number of permutative ternary Muthukrishnan-Stroud (M-S) gates is presented. Next, an efficient method for logic simplification for ternary reversible logic is proposed. This method along with the new construction of projection operators yields significantly lower gate cost of approximately 31% less than that obtained by earlier methodologies, for the synthesis of ternary benchmark circuits.
One of the main motivations for using ternary logic systems is the amount of information per circuit line is higher as compared to the corresponding binary logic representation, thereby leading to more compact circuit realizations. This is particularly attractive for quantum computing as qutrits are expensive resources and minimizing their number is one of the main objectives during synthesis. Therefore, ternary reversible logic synthesis has drawn significant attention among researchers. It deals with fundamental unit of information called qutrits that can exist in one of the three states |0>, |1> and |2>. Hence, the aim of this paper is to bridge the knowledge gap for the beginners in this domain than searching the entire space. Therefore, the present work discusses the basic concepts of ternary reversible logic and ternary reversible gates. The detailed discussion of the various ternary reversible logic synthesis will enable the beginners in this domain to understand the ternary reversible logic in a better way.
Grover's search algorithm is one of the well-studied quantum computing algorithms, which plays a key role in many applications such as graph coloring, triangle finding, Boolean satisfiability. Although there are many works on circuit synthesis for Grover's algorithm in the binary quantum domain, only a few exist for the ternary version of the algorithm. In this paper, we first propose a new ternary superposition operator and utilize it to synthesize a ternary quantum logic circuit for Grover's algorithm. Our proposed circuits for a ternary oracle and the ternary Grover's diffusion operator require 4 and 6 gate levels respectively per iteration, and for the ternary oracle 1 ancilla qutrit. To the best of our knowledge, this is the first circuit for the Grover's diffusion operator using ternary gates. Finally, we use these two circuits to present a ternary quantum circuit for the vertex coloring problem. The oracle circuit for this problem has smaller gate count compared to existing solutions.
Because ternary computer has more superiority than other d-ary number systems, we focus on the investigation of ternary elementary quantum gates and the synthesis algorithm of ternary quantum logic circuits. Above all, Pauli operators and their matrices on qutrit are introduced. Then eight qutrit operators are selected as elementary operators and eight qutrit quantum logic gates are defined. Permutation groups are introduced to characterize the quantum gates and quantum logic circuits. Some important qutrit quantum logic gates are defined also, such as QNOT, QKCXi, EQKCXi, QSwap, QCNOT and EQCNOT. Based on these elementary gates, we prove two very important theorems: (1) all qutrit quantum reversible logic circuit can be generated by Xi gate and QKCXi gate; (2) all qutrit quantum reversible logic circuits can be generated by Xi gate and QCNOT gate. The two theorems indicate that any complicated qutrit quantum reversible circuit can be constructed by the simplest ternary quantum gate. This will greatly simplify the implementation difficulty of quantum circuit. Subsequently, we propose a synthesis algorithm for qutrit quantum reversible logic circuit, which is verified through simulation experiment by the computer program we have designed.