IEEE International Symposium on Multiple-Valued Logic (ISMVL)

On Some Basic Aspects of Ternary Reversible and Quantum Computing

Claudio Moraga

Published May 1, 2014• 14 citations

Abstract

This paper addresses basic aspects of reversible and quantum computing in the context of ternary systems. Ternary extensions of the Pauli matrices are presented and interactions with the Vilenkin-Chrestenson matrix are disclosed. The realization of extended ternary Toffoli gates under the Barenco et al. type of structure is shown not to be possible without ancillary lines, meanwhile a Sasanian-Wang-Perkowski type of structure leads to a five elementary gates realization. The presence of entanglement in ternary quantum computing is addressed and illustrated with an example.

DOI: 10.1109/ismvl.2014.39

Related papers

Aspects of Reversible and Quantum Computing in a -Valued Domain

Claudio Moraga

This paper presents basic aspects of non-binary reversible and quantum computing in a p-valued environment, since there are no physical reasons for quantum computing to be necessarily binary. A “quantum technology” is not yet available, but different alternatives at the level of laboratory experiments are promising. A theoretical background is needed to face the challenge of designing circuits for quantum computing. Pauli matrices are introduced in the p-valued domain and their properties are explained. The Vilenkin-Chrestenson matrix is shown to produce superposition of states. Entanglement of quantum states in the p-valued environment is introduced and its measurement effect is illustrated. It is shown that in the p-valued domain, the binary Toffoli gate may be given different generalizations with different functionalities. An ancillary-free realization of a new generalized p-valued Toffoli gate based on Muthukrishnan-Stroud elementary gates is presented, its functionality is extended to two kinds of control, and a proof of its performance is given.

IEEE Journal on Emerging and Selected Topics in Circuits and SystemsMar 1, 20164 citations

Ternary Toffoli-type Reversible Gates: Control Alternatives and Quantum Models

Claudio Moraga

Toffoli-type reversible gates are analyzed. Peres-type ternary gates are introduced for the first time. Conjunctive, disjunctive, majority, XOR types and hybrid control strategies are disclosed. Barenco-type of quantum models for these cases are developed.

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

Design of New Quantum/Reversible Ternary Subtractor Circuits

Asma Taheri Monfared, Majid Haghparast

Ternary quantum circuits play a significant role in future quantum computing technology because they have many advantages over binary quantum circuits. Subtraction is considered as being one of the key arithmetic operations; hence, subtractors are very essential for the construction of various computational units of quantum computers and other complex computational systems. In this paper, we have proposed the realization of a quantum reversible ternary half-subtractor circuit using a generalized ternary gate, a ternary Toffoli gate, and a ternary C2NOT gate. Based on the realization of the ternary half-subtractor, we proposed the realization of a ternary full-subtractor.

Journal of Circuits Systems and ComputersOct 13, 201523 citations

Novel Realization of Some Ternary Circuits for Quantum Computing

Asif I. Khan, N. Nusrat, S.M. Khan +1 more

We present novel realization of ternary Toffoli gate and modified Fredkin gate for quantum computing using generalized ternary gate (GTG) which are truly realizable quantum gates. Our realization of ternary Toffoli gate is more efficient than the previous results and we are the first to realize the modified Fredkin gate using GTGs

IEEE Region 10 Conference (TENCON)Nov 1, 20061 citation

Synthesis of ternary non-reversible logic circuits

Xiaoyu Li, Guowu Yang, Desheng Zheng

Reversible quantum circuits are a necessary subclass of quantum computation and its realization is required for any quantum computer to be universal. This paper investigates how to synthesis of arbitrary ternary non-reversible logic circuits by adding inputs with constant value and garbage outputs. Group theory has been also used to solve the synthesis of reversible logic circuits. Our algorithm uses the SNT (ternary Swap gate, ternary NOT gate, ternary Toffoli gate) library, by reducing the ternary non-reversible logic circuit synthesis problem to group theory representation. The main result shows the relationship of ternary non-reversible logic circuits and the reversible circuits. The realization approach is constructive and can be further used to develop software for synthesis of arbitrary d-level circuits. This result is significantly different from the binary non-reversible logic circuits.

IEEE Congress on Evolutionary Computation (CEC)Jul 1, 20101 citation

Design of reversible ternary adder/subtractor and encoder/priority encoder circuits

Kaustav Ghosh, Md. Misbahul Haque, Sanjay Chakraborty

Ternary quantum logic plays a very important role for building high speed and efficient futuristic computers. It has several advantages over classical computing and binary quantum circuits. In this paper, the realization of basic ternary circuits for adder/subtractor, encoder and priority encoder are proposed and designed. These circuits are very essential for the construction of various computational units of quantum computers and other complex computational systems. Design of reversible circuits can be improved by reducing the quantum circuit cost. This paper uses some elementary components and typical ternary gates (generalized ternary gate, M-S gate etc.) to perform arithmetic addition, subtraction and encoding operations. Finally, it evaluates the optimum cost for each circuit.

Apr 1, 20167 citations