IEEE Journal on Emerging and Selected Topics in Circuits and Systems

Aspects of Reversible and Quantum Computing in a -Valued Domain

Claudio Moraga

Published Mar 1, 2016• 4 citations

Abstract

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.

DOI: 10.1109/jetcas.2016.2528658

Related papers

On Some Basic Aspects of Ternary Reversible and Quantum Computing

Claudio Moraga

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.

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

The Fredkin gate in reversible and quantum environments

Claudio Moraga, Fatima Zohra Hadjam

Reversible Computing circuits are characterized by low power consumption and their proximity to circuits for quantum computing. The Fredkin gate was one of the earliest proposed controlled reversible circuits, which however, was soon superseded by the Toffoli gate, the NOT, and CNOT gates, which constituting a flexible functionally complete set could also realize the Fredkin gate as a building block. In quantum computing circuits, the Fredkin gate (under the name controlled SWAP) plays an important role regarding the superposition of states. The present paper studies extensions of the Fredkin gate in terms of mixed polarity in the reversible domain and an application in quantum computing.

Facta universitatis - series Electronics and EnergeticsJan 1, 20234 citations

Multiple-Valued Logic Operations in Quantum Computing

Hafiz Md. Hasan Babu

Multi-Valued quantum computing is a challenging field for researchers. Two-valued quantum computing is not so old, but multi-valued quantum computing is a new topic to discuss. Designing with multiple-valued logic has obtained a lot of attention in the previous three decades. Multiple-valued logic emerged as a separate study in the early 1920s, thanks to a Polish philosopher named Lukasiewicz, his goal was to add a third value to the binary system. The Lukasiewicz system is the result of this investigation. This chapter explores the quantum world with multiple-valued logic systems. All operations will be covered that learned before in the binary quantum logic system. The basic operations of quantum computing in the ternary logic system will be implemented. In the two-valued quantum computing, several quantum fundamental gates for reversible logic are learned which include - the Pauli gate, Pauli-X gate, Hadamard gate, Toffoli gate, Fredkin gate, Deutsch gate, and Swap gate.

CRC Press eBooksAug 29, 20230 citations

Quantum p-Valued Toffoli and Deutsch Gates with Conjunctive or Disjunctive Mixed Polarity Control

Claudio Moraga

In this paper the models of reversible Toffoli and quantum Deutsch gates are extended to the p-valued domain. Their structural parameters are determined and their behavior is proven. Both conjunctive and disjunctive control strategies with positive and mixed polarities are introduced for the first time in a p-valued domain. The design is based on elementary Muthukrishnan-Stroud quantum gates, hence the realizability of the extended gates in the context of ion traps should be possible.

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

Photonic reversible computing: a proposal for a Toffoli gate using QND for polarization-based qubits and their applications

Samy C. Policarpo

Reversible photonic computing is a promising research field that seeks to develop computers that can perform calculations without loss of information by means of the controlled manipulation of light. Reversibility is an important property of a computational system, as it allows the system to be restored to its initial state after the calculation. This can be useful for applications such as cryptography, security, and image processing. This work presents a theoretical optical apparatus (cS) for polarization qubits based on quantum nondemolition measurements (QND) which through analytical and comparable calculations, presented an efficiency greater than 90% that is capable of performing the Toffoli gate function. The proposed optical system is configurable, based on prior configuration and combination, and reversible AND, NAND, Toffoli, CNOT, Peres, Fredkin, HNG, and ALG gates can be obtained, as well as any other reversible gate based on C n+1 -NOT gates. The cS system can be configured to function as a sequential binary comparator and the same can be used as a Bell state generator.

Jan 1, 20230 citations

Many-valued Logics in Classical and Quantum Gates

Carlos Lungarzo

The research on many valued interpretation in quantum computing [1,3] is rather recent and the theory is not fully developed yet. The main advantage of this approach seems to be the complexity gain when a computation is based upon general quantum digits (usually called qudits) if compared with time spent by the same algorithm, when running in a equivalent system built up by means of qubits (binary digits). If this assumption is sound, then temporal complexity of algorithms could be significantly simplified. The use of many-valued semantics in classical logic doesn't convey any precise idea of its physical application, as it happens in the framework of quantum gates. However, we propose an analysis motivated by the known use of finite-many-valued semantic in non-quantum logics. We shall produce a propositional representation for classical gates. We make explicit the usually implicit relationship between classical and quantum logics, extend in a natural way the many-valued semantics, as used in axiomatic systems of classical logical, to the quantum case (by using Toffoli gate and algebraic properties), define many-valued digits (qu-d-its) and reversible gates based upon them, and extend the functional completeness (“universality”) of some gates to the new situation. We conjecture the possibility of enhancing the performance of quantum algorithms, when running in a many-valued quantum system.

Logic Journal of IGPLJan 1, 20051 citation