arXiv subjects

Moein Sarvaghad-Moghaddam

Publications and source records attributed to Moein Sarvaghad-Moghaddam.

10 recordsLinked to original sources

arXiv2025

A Scalable Synthesis Algorithm for Reversible Functions

Reversible computation is an emerging technology that has gained significant attention due to its critical role in quantum circuit synthesis and low-power design. This paper introduces a transformation-based method for exact synthesis of reversible circuits. The proposed approach utilizes a novel adaptation of the Quine-McCluskey algorithm to eliminate input-output discrepancies in the truth table, transforming the permutation matrix into an identity matrix. Furthermore, a novel search space reduction technique is presented which, combined with the primary method, enables the synthesis algorithm to handle high-input reversible functions. This approach combines the influence of multiple control qubits on a target qubit, evaluating their collective impact. This aggregation can decrease the control qubit count within quantum gates. Consequently, it proves beneficial for applications like surface code error correction architectures as well as current Noisy Intermediate-Scale Quantum (NISQ) hardwares. Experimental results demonstrate significant improvements over the state-of-the-art exact synthesis methods, achieving up to 99% improvements in terms of the number of levels of T-gates.

quant-ph↗

arXiv2019

Reversible Gates in Emerging Quantum-dot Cellular Automata Technology: An Innovative Approach to Design and Simulation

Power dissipation is known as the most notable limiting factor in all nano-electronic design techniques including Quantum-dot Cellular Automata (QCA). The familiar reversible computing approach is used as a reasonably reliable solution, mitigating power dissipation. This study presents, a comprehensive multi-objective method for designing R-Fs in emerging QCA technology. The results are investigated in both logical and layout levels, in detail. The results verify that the approach offered in this study has advantage over the most efficient approaches available in the literature by far. This comparison can be made on various parameters ranging from area, complexity (cell amount), delay (clocking zones), and to even logical levels including levels, Control inputs, the number of majority and NOT gates.

cs.ET↗

arXiv2019

Bidirectional Controlled Quantum Teleportation Using Eight-Qubit Quantum Channel in Noisy Environments

In this work, a novel protocol is proposed for bidirectional controlled quantum teleportation (BCQT) in which a quantum channel is used with the eight-qubit entangled state. Using the protocol, two users can teleport an arbitrary entangled state and a pure two-qubit state (QBS) to each other simultaneously under the permission of a third party in the role of controller. This protocol is based on the controlled-not operation, appropriate single-qubit (SIQ) UOs and SIQ measurements in the Z and X-basis. Reduction of the predictability of the controller's qubit (QB) by the eavesdropper and also, an increasing degree of freedom of controller for controlling one of the users or both are other features of this protocol. Then, the proposed protocol is investigated in two typical noisy channels include the amplitude-damping noise (ADN) and the phase-damping noise (PDN). And finally, analysis of the protocol shows that it only depends on the amplitude of the initial state and the decoherence noisy rate (DR).

quant-ph↗

arXiv2019

Efficient Controlled Bidirectional Quantum Secure Direct Communication using entanglement swapping in a network

In this paper, a novel controlled bidirectional quantum secure direct communication protocol (CBQSDC) is proposed. In this scheme, both users can transmit their secret messages directly and simultaneously under the permission of the controller. The proposed method use feature of entanglement swapping which is led to more efficiency (lowest number of quantum resources (EPR pairs)), security and the lowest number of security checking steps. Also, a generalization of the protocol is explained and a protocol of CBQSDC-based network is presented.

quant-ph↗

arXiv2018

A General protocol for Distributed Quantum Gates

Distributed quantum computation requires to apply quantum remote gates on separate nodes or subsystems of network. On the other hand, Toffoli gate is a universal and well-known quantum gate. It is frequently used in synthesis of quantum circuits. In this paper, a general protocol for implementing a remote n-qubit controlled-U gate is presented with minimum required resources. Then, the proposed method is applied for implementing a Toffoli gate in bipartite and tripartite systems. This method also is optimal when group of the qubits belong to one part, section or subsystem of network. Because it only use one entangled qubit for each group of the qubits in mentioned conditions.

quant-ph↗

arXiv2018

Bidirectional Quantum Controlled Teleportation by Using Five-qubit Entangled State as a Quantum Channel

In this paper, a novel protocol is proposed for implementing BQCT by using five-qubit en The proposed protocol depends on the Controlled-NOT operation, proper single-qubit unitary operations and single-qubit measurement in the Z-basis and X-basis. The results showed that the protocol is more efficient from the perspective such as lower shared qubits and, single qubit measurements compared to the previous work. Furthermore, the probability of obtaining Charlie's qubit by eavesdropper is reduced, and supervisor can control one of the users or every two users. Also, we present a new method for transmitting n and m-qubits entangled states between Alice and Bob using proposed protocol.tangled states as a quantum channel which in the same time, the communicated users can teleport each one-qubit state to each other under permission of controller.

quant-ph↗

arXiv2018

A General Bidirectional Controlled/Uncontrolled Quantum Teleportation Protocol

In this paper, different from the other existing methods that only the special and limited numbers of qubits transmit between Alice and Bob, a general method is proposed to implement Bidirectional Quantum Controlled/uncontrolled Teleportation (BQCT/BQT) that Alice and Bob can transmit each type of arbitrary n and m-qubits to each other, simultaneously. This protocol is based on Controlled-NOT (CNOT) operation, appropriate single-qubit unitary operations and single-qubit measurement in the Z-basis and X-basis. Also, the quantum channel can be created by using Hadamard and CNOT operations. One of the advantages of this method is using the single-qubit measurements which are more efficient than two-qubit measurements.

quant-ph↗

arXiv2018

New Symmetric and Planar Designs of Reversible Full-Adders/Subtractors in Quantum-Dot Cellular Automata

Quantum-dot Cellular Automata (QCA) is one of the emerging nanotechnologies, promising alternative to CMOS technology due to faster speed, smaller size, lower power consumption, higher scale integration and higher switching frequency. Also, power dissipation is the main limitation of all the nano electronics design techniques including the QCA. Researchers have proposed the various mechanisms to limit this problem. Among them, reversible computing is considered as the reliable solution to lower the power dissipation. On the other hand, adders are fundamental circuits for most digital systems. In this paper, Innovation is divided to three sections. In the first section, a method for converting irreversible functions to a reversible one is presented. This method has advantages such as: converting of irreversible functions to reversible one directly and as optimal. So, in this method, sub-optimal methods of using of conventional reversible blocks such as Toffoli and Fredkin are not used, having of minimum number of garbage outputs and so on. Then, Using the method, two new symmetric and planar designs of reversible full-adders are presented. In the second section, a new symmetric, planar and fault tolerant five-input majority gate is proposed. Based on the designed gate, a reversible full-adder are presented. Also, for this gate, a fault-tolerant analysis is proposed. And in the third section, three new 8-bit reversible full-adder/subtractors are designed based on full-adders/subtractors proposed in the second section. The results are indicative of the outperformance of the proposed designs in comparison to the best available ones in terms of area, complexity, delay, reversible/irreversible layout, and also in logic level in terms of garbage outputs, control inputs, number of majority and NOT gates.

cs.ET↗

arXiv2017

Multi-objective design of quantum circuits using genetic programming

Quantum computing is a new way of data processing based on the concept of quantum mechanics. Quantum circuit design is a process of converting a quantum gate to a series of basic gates and is divided into two general categories based on the decomposition and composition. In the second group, using evolutionary algorithms and especially genetic algorithms, multiplication of matrix gates was used to achieve the final characteristic of quantum circuit. Genetic programming is a subfield of evolutionary computing in which computer programs evolve to solve studied problems. In past research that has been done in the field of quantum circuits design, only one cost metrics (usually quantum cost) has been investigated. In this paper for the first time, a multi-objective approach has been provided to design quantum circuits using genetic programming that considers the depth and the cost of nearest neighbor metrics in addition to quantum cost metric. Another innovation of this article is the use of two-step fitness function and taking into account the equivalence of global phase in quantum gates. The results show that the proposed method is able to find a good answer in a short time.

cs.ET↗

arXiv2016

A multi-objective synthesis methodology for majority/minority logic networks

New technologies such as Quantum-dot Cellular Automata (QCA), Single Electron Tunneling (SET), Tunneling Phase Logic (TPL) and all-spin logic (ASL) devices have been widely advocated in nanotechnology as a response to the physical limits associated with complementary metal oxide semiconductor (CMOS) technology in atomic scales. Some of their peculiar features are their smaller size, higher speed, higher switching frequency, lower power consumption, and higher scale integration. In these technologies, the majority (or minority) and inverter gates are employed for the production of the functions as this set of gates makes a universal set of Boolean primitives in these technologies. An important step in the generation of Boolean functions using the majority gate is reducing the number of involved gates. In this paper, a multi-objective synthesis methodology (with the objective priority of gate counts, gate levels and the number of inverter gates) is presented for finding the minimal number of possible majority gates in the synthesis of Boolean functions using the proposed Majority Specification Matrix (MSM) concept. Moreover, based on MSM, a synthesis flow is proposed for the synthesis of multi-output Boolean functions. To reveal the efficiency of the proposed method, it is compared with a meta-heuristic method, multi-objective Genetic Programing (GP). Besides, it is applied to synthesize MCNC benchmark circuits. The results are indicative of the outperformance of the proposed method in comparison to multi-objective GP method. Also, for the MCNC benchmark circuits, there is an average reduction of 10.5% in the number of levels as well as 16.8% and 33.5% in the number of majority and inverter gates, as compared to the best available method respectively.

cs.ET↗