Two-Qubit Quantum Gates to Reduce the Quantum Cost of Reversible Circuit
|
|
- Cassandra French
- 6 years ago
- Views:
Transcription
1 11 41st IEEE International Symposium on Multiple-Valued Logic Two-Qubit Quantum Gates to Reduce the Quantum Cost of Reversible Circuit Md. Mazder Rahman, Anindita Banerjee, Gerhard W. Dueck, and Anirban Pathak Faculty of Computer Science, University of New Brunswick, Canada Department of Physics and Material Science Engineering, Jaypee Institute of Information Technology, Noida, INDIA Abstract This paper presents a quantum gate library that consists of all possible two-qubit quantum gates which do not produce entangled states. The quantum cost of each two-qubit gate in the proposed library is one. Therefore, these gates can be used to reduce the quantum costs of reversible circuits. Experimental results show a significant reduction of quantum cost in benchmark circuits. The resulting circuits could be further optimized with existing tools, such as quantum template matching. Index Terms Revesible Logic, Logic Synthesis, Quantum Cost, Gate Library, Quantum Circuit. I. INTRODUCTION Scientists have gained interest in doing research on reversible logic for the last few years due to its potentially lossless energy property. Landauer s principle [1] states that logic computations that are not reversible, necessarily generate heat kt log for every bit of information that is lost, where k is Boltzmanns constant and T the temperature. For room temperature the amount of dissipating heat is small (i.e., Joule), but not negligible. Therefore, research on reversible logic plays a significant role in quantum computing, optical computing, nanotechnology, and low-power CMOS design for the development of much more powerful computers and computations. Different synthesis methods have been proposed, such as a transformation based algorithm [], [3], translating ESOP expression into Toffoli circuits [4] and others. Since synthesis of reversible circuits differs significantly from synthesis using traditional irreversible gates, new methods have been developed. Optimal results can only be obtained for small circuits. A transformation based algorithm [] gives near-optimal results for 3-input circuits as well as good results for larger problems without searching extensively. However, heuristic synthesis approaches often result in suboptimal circuits. Once a circuits has been obtained, further optimization techniques can be applied. Since there are different cost considerations such as garbage lines, gate count, and quantum cost, methods for specific cost reductions may be developed. Optimization approaches such as template matching [5], [6] focus on the reduction of the gate count or quantum cost of a Toffoli network. They are search methods that look for gate sequences that can be replaced by alternative cascades with lower cost. Synthesis of reversible circuits using a basic two-qubit quantum gates library has been proposed in [7] each gate has unit cost. It has been shown, that two -qubit elementary quantum gates that act on the same two qubit lines can be merged into a new quantum gate of cost one. It is also further referred to as a double gate of unit cost [8]. Similar work has been done by investigating the quantum blocks with lowest cost in quantum circuits [9], however the number of all possible low cost quantum blocks has not been enumerated in his work. In this paper, we proposed a new two-qubit quantum gates library in which each gate can be realized by the two-qubit function of unit cost. The cost of 1-qubit and -qubit quantum gate is one [1] and therefore, a valid sequence of 1-qubit and -qubit elementary quantum gates which are acting on the same qubit lines do not increase the quantum cost, and the resulting cost is still one. Since quantum circuits are inherently reversible, every reversible circuit can be decomposed into a quantum circuit [1]. We decompose reversible circuits with multiple control Toffoli (MCT) gates into quantum circuits and then find a sequence of quantum gates in the circuits that can form a valid two-qubit gate using moving rules. In this work, we have only considered the quantum implementation cost of reversible circuits rather than other cost metrics. However, the decomposition increases the number of extra garbage lines which can also increase the implementation costs of reversible circuits. The remaining part of this paper is organized as follows. Section II gives the background of reversible logic theory. Section III describes the details of the algorithm to build the library of all possible two-qubit quantum gates. Decomposition of reversible circuits into quantum circuits and optimization of quantum cost of reversible circuits are shown in Section IV and V respectively. We show the experimental result for benchmarks functions in Section VI. Finally, Section VII concludes the paper. II. BACKGROUND A logic function is said to be reversible if there is a oneto-one and onto mapping between input vectors and output vectors. Table I shows the truth table of a 3 3 reversible function. Reversible functions can be realized by reversible circuits as the cascades of reversible gates without allowing feedback and fan-out into the gates. Reversible gates such as Toffoli [11], Peres [1] and Fredkin [13] are conventionally used to synthesize reversible circuits. However, Toffoli based synthesis of X/11 $6. 11 IEEE DOI 1.119/ISMVL
2 xyz x o y o z o Table I TRUTH TABLE OF A 3 3 REVERSIBLE FUNCTION. reversible circuits is prevalent. A generalized multiplecontrol Toffoli gate is defined as T OF n (C, T ) based on number of control lines n, which maps each pattern (x i1, x i,..., x ik ) to (x i1, x i,..., x j 1, x j x i1 x i... x j 1 x j+1... x ik, x j+1,..., x ik ), where C = {x i1, x i,..., x ik }, T = {x j } and C T = φ. C is referred to as the control set and T is referred to as the target. T OF and T OF 1 are referred to as NOT and CNOT respectively. According to the transformation based algorithm proposed in [5] the circuit in Figure realizes the reversible function whose truth table is shown in Table I. Figure 1. (a) Generalized Toffoli gate and (b) T OF. Figure. Reversible circuit that realizes the function shown in Table I. In synthesizing reversible circuits, one key concern is to obtain circuits with low quantum costs. The quantum cost of a circuit is defined by the total number of elementary quantum gates needed to realize the given function. It is stated that every elementary quantum gate requires a single operation of unit cost [1]. The quantum gate library includes the primitive gates NOT, CNOT, Controlled-V and Controlled-V + each has a unit cost. It has been shown, that Toffoli gates can be realized by a sequence of elementary quantum gates [1]. For example, the circuit shown in Figure is expanded to the sequence of elementary quantum gates as shown in Figure 3. The quantum cost (the number of elementary gates) of the circuit 16. However, we will show that this cost can be reduced with our proposed methods. Figure 3. Quantum circuit The logic operations of quantum circuits and the classical circuits are different. The basic information in quantum computing is represented as a qubit that is analogous to a line in classical logic circuits. An arbitrary qubit can be described as ( ) α ψ = α + β 1 = β where α and β are complex numbers which satisfy: α + β = 1. Similarly a generalized two qubit state can be described as a ψ = a + b 1 + c 1 + d 1 = b c. d This state is separable as tensor product of two states if and only if ad = bc (1) otherwise the state is entangled. This condition can be visualized easily if we consider the tensor product of two single qubit states denoted by α + β 1 and α + β 1. The product state is ( α β ) ( α β ) = αα αβ βα ββ that satisfies the condition of separability as αα ββ = αβ βα. The condition (1) is important for the present work as we restrict our two qubit gate library to include only those gates which do not produce an entangled output state. Consequently after construction of every new gate, by multiplication of two existing valid gates, we check whether the output states of the newly obtained gate is entangled or not (i.e. whether they violate the condition (1) or not). If condition (1) is violated for a gate for any allowed input states, then the gate is not valid and will not be added to the library. Moreover, the elementary quantum gates are represented by their unitary matrices [7] that may include complex elements. For example, the unitary matrix of two-qubit controlled V gate is represented as 1 1 M v = (1+i) (1 i) (1 i) (1+i) which will not produce an entangled state in output for any valid input state. Two two-qubit gates acting on the same two 87
3 qubit lines can be represented by two matrices A and B. These matrices can be multiplied to yield a new operation C = B A, which represents a two-qubit gate. This leads to the following definition. Definition 1: A two-qubit function can be defined as the mapping of f(x, y) (p, q), where x, y, p, q {, 1, V, V 1 } and, 1, V and V 1 are individual state vector in quantum computation. V and V 1 are defined by as follows (1 + i) ( V = 1 i ) (1 + i) ( V 1 = 1i ). III. BUILDING THE GATE LIBRARY It has been shown in [14], that any pair of the quantum gates (CNOT, controlled-v, and controlled-v + ) can be realized with unit cost as long as they operate on the same two qubits. An example is shown in Table 4. In this case, these gates can be merged into a new two-qubit gate (also called double gate) and the cost of resulting gate can be considered as one. Figure 4. Merging of two two-qubit gates results new gate of unit cost In addition, for optimal synthesis of reversible functions using quantum gates, there are four different signals:, 1, V, and V 1. The intermediate signals V and V 1 can not be applied to the control of the two-qubit gate, because the resulting output vector generates an entangled state that can not be separated into two individual qubit states [7]. Note, this restriction only applies to reversible circuits not quantum circuits. However, the resulting matrix of double gates is unitary and applying all possible inputs to the double gates in Figure 4 results four output vectors which can be considered as the output strings of, 1V, 1V 1 and 1. In contrast, applying V to both qubits in the double gate results in an entangled state (as the following matrix multiplication shows) because according to the condition (1) the resulting vector can not be separated into two different qubits states: 1 (1+i) 6 4 i (1+i) 1 1 (1 i) (1 i) i i.5.5.5i = 4.5i.5.5i.75.5i Reversible circuits map binary inputs to binary outputs, and the number of inputs and outputs are same. While we are using two-qubit quantum gates for realizing reversible circuits, there are only four combinations of binary inputs out of 16 possible inputs (internally, there are four possible values) to be applied to the two-qubit quantum gates. Therefore, it is necessary and sufficient that any sequence of 1-qubit and -qubit quantum gates maps at least four inputs (It will also be referred to as good outputs in the subsequent sections) into outputs that are not entangled. We use this restriction to define a valid twoqubit quantum gate for realizing reversible circuits. Observation 1: Any sequence of single qubit and two-qubit elementary quantum gates that are acting on the same two qubits in a circuit can be formed as a new two-qubit quantum gate. If the resulting gate produces at least four two-qubit state vectors, not including entangle state vectors, then the resulting gate is said to be a valid two-qubit quantum gate realizable by the two-qubit operation of unit cost. Building the two-qubit quantum gate library, we consider four different input signals, 1, V, and V 1 where the control inputs are only binary values. There are 16 possible combinations of state vectors can be found in regarding the single qubit NOT gate. For simplicity, we define all possible input vectors as the set of input strings I = {, 1, V, V 1, 1, 11, 1V, 1V 1, V, V 1, V V, V V 1, V 1, V 1 1, V 1 V, V 1 V 1 }. In this section, we enumerate the possible two-qubit quantum gates as well as build a two-qubit quantum gate library GL that includes all two-quit gates with no entanglement. There are 8 possible primitive quantum gates each with a distinct matrix. The set of elementary quantum gates is Q = {V (a, b), V (b, a), V + (a, b), V + (b, a), T (a, b), T (b, a), T (b), T (a)} where the first and second parameter of the two-qubit gates are the control and target respectively. According to Observation 1, we propose new two-qubit quantum gates that are formed by cascading one-qubit and two-qubit primitive quantum gates. The resulting gate is is added to GL, if it satisfies the following three constrains: 1) the resulting gate matrix is not the identity matrix, that is, the function of resulting gate is not the identity; ) the resulting gate matrix is not in GL; 3) applying all 16 possible inputs to the resulting gate results in at least four good outputs as stated in Observation 1. Since the intermediate signals V and V 1 are not applied to the gate control lines, which results in entangled state vectors. A. Algorithm Input: Input vectors for all possible two-qubit states for four input signals. Matrices for all 8 primitive quantum gates. Output: Gate library that contains the matrices of new two-qubit gates that are analogous to the new two-qubit quantum gates of unit cost. Good output vectors for all new gates. BEGIN: 1) GL = φ ) foreach i {1,,, m} 3) GL = GL QG M i 88
4 4) end 5) n = m 6) foreach j {1,,, n} 7)..foreach k {1,, m} 8)... R M = QG M k GLM j 9)...if(R M I) // check Identity 1)...if(R M / n GL M n ) //check match 11)... O v = φ 1)...foreach p {1,,, l} 13)... V o = R M IV P // apply input vectors 14)... if(v o l IV l ) 15)... O v = O v V o 16)...end if 17)...end 18)...if (NE(O v ) 4) // good outputs? 19)... n = n + 1 )... GL = GL R M // gate library update 1)...end if )...end if 3)...end if 4)..end 5) end END. In the above algorithm, lines through to 4 initialize the gate library GL with the matrices QG M for all m primitive gates QG m. The number of elements in GL is denoted by n that is updated in line 18 when a new gate is found. R M represents an arbitrary matrix can be the matrix of a new possible gate (g j )(QG k ) with the cascading of the gate g j in GL and k th primitive gate QG k. QG M k and GLM j in line 8 denote k th quantum primitive gate matrix and j th gate matrix in the library GL. The subsequent lines 9 and 1 check whether R M is the identity matrix or is matched with a matrix in the gate library. That is, if a match is found, then there is an equivalent gate in GL. The iteration in lines 1 to 17 are the analogy of applying all 16 possible inputs to the new gate and check whether the output vector is an entangled state or not. If the resulting gate produces a subset of possible input sets as outputs then the resulting gate is a new two-qubit quantum gate and the new gate matrix stored in the gate library (line ). There are 783 possible two-qubit quantum gates including the 8 elementary quantum gates. A partial result of two-qubit gates in computed library is shown in Table II. The following is one if the gates, which consists of a cascade of 6 elementary quantum gates. T Q = T (b)v + (b, a)t (a, b)v (b, a)t (b)t (b, a) The corresponding matrix is.5 +.5i.5.5i M g =.5 +.5i.5.5i.5i i. 1 Table II PARTIAL GATE LIBRARY. The following two-qubit gates T Q 1 and T Q are equivalent since their corresponding matrices are identical (shown as M Q1Q ). T Q 1 = T (a)t (a, b)v (b, a) T Q = T (a)t (a, b)v + (b, a)t (b, a) i.5 +.5i7 M Q1 Q = i.5.5i IV. DECOMPOSITION OF REVERSIBLE CIRCUITS INTO QUANTUM CIRCUITS Reversible circuits can be decomposed into quantum circuits since each reversible gate has its quantum implementation. In this paper we only consider the quantum implementation of MCT (multiple control Toffoli) gates. Different rules for decomposing MCT gates into quantum circuits have been proposed in [1]. The decomposition depends on the number 89
5 of control lines m of the MCT gate in question and the number of lines n in the reversible circuits. In addition, at least one working line is needed to decompose a T OF m gate into a quantum circuit, when n 3 and m = n 1. The quantum costs of reversible circuits vary with the number of available working lines. In general, more working lines will result in decompositions with less cost. We have here only considered the linear decomposition of T OF n gates in n-bit networks for decomposing any arbitrary reversible circuit with Multiple Control Toffoli gates into quantum circuit. Pairing Toffoli gates may result in fewer elementary quantum gates [15]. According to Lemma 6.1 in [1], the classical reversible primitive T OF gate has an implementation of quantum costs five, shown in Figure 5. Since the right most controlled-v gate can move anywhere in the circuit, different arrangements of quantum implementations of T OF are possible. Figure 5. Quantum realization of T OF. Figure 8. lines. Decomposition of T OF 5 into MCT circuit with two working If the circuit that is to be decomposed contains a T OF n, then one ancilla line must be added (since at least one working line is required for the decomposition). This should be determined before the decomposition starts, because it will make an extra working line available, and thus, potentially reduce the cost of other decompositions. Example 1: Consider the function Mod5 (taken from RevLib [16]). Its MCT realization is shown in Figure 9 and its decomposition into elementary quantum gates is shown in Figure 1. If a reversible circuit with n lines, where n 5, contains a T OF m gate where 3 n/, then T OF m can be decomposed as a network of 4(m ) T OF gates as shown in Figure 6. Figure 9. Reversible circuit Mod5. Figure 6. Decomposition of T OF 4 into MCT circuit. Moreover, if a reversible circuit with n lines, where n 5, contains a T OF m gate, where m n 3, then the T OF m gate can be decomposed into a network consisting of two T OF gates and two T OF m 1 gates as shown in Figure 7. Therefore, 5 elementary quantum gates are required to decompose T OF 4 with one working line. Figure 7. line. Decomposition of T OF 5 into MCT circuit with one working There are 4 elementary quantum gates required for decomposing T OF 4 with two working lines, as shown in Figure 8. Figure 1. Quantum circuit after decomposing the reversible circuit Mod5. V. QUANTUM COST REDUCTION OF REVERSIBLE CIRCUITS USING GENERALIZED TWO-QUBIT GATES In this section, we show how the new two-quit gates can be used to reduce the quantum cost of reversible circuits. The basic idea is to use the moving rule to create long sequences of two qubit gates that operate on the same two qubit lines. These gates can them be merged into a single one, reducing the cost. The moving rule states that two adjacent gates G 1 and G can be interchanged if the target of G 1 does not intersect with the control lines of G and vice-versa []. We illustrate this in the following example. Example : Consider the function Mod5. The implementation shown in Figure 1 has quantum cost 16. We can reorder the gates as shown in Figure 11. Gates 1 and form a -qubit quantum gate that can be realized by a two-qubit gate in the 9
6 proposed library. Similarly gates 9 and 14 form another twoqubit gate as well as gates 13 and 15 form a further one. The cost of the circuit is reduced by 4. That is, the total quantum cost of the resulting circuit is 1. It should be noted, that applying the moving rule to the first potential pair of gates, may result in sub-optimal quantum cost reductions. When a gate is moved towards another gate to form a longer sequence of two-qubit gates it may prevent other gates from moving in the other direction to form another sequence of two qubit gates. When several moves are possible, one may result in a better cost reduction. In our implementation the first move is taken without investigating alternative moves. new gates that were not already in the gate library. In other words the 783 gates produced are closed and complete under the allowed (valid) operations. Figure 1. Analysis of costs reduction. Figure 11. Quantum circuit with 1 two-qubit quantum gates. VI. EXPERIMENTAL RESULTS A program that builds the gate library with all possible twoqubit quantum gates has been written using MATLAB. The results shows that a new gate can be formed by cascading a maximum of 8 primitive quantum gates, and there are 783 twoqubit gates that produce distinct outputs with the constraints mentioned in Section III. We used RevKit-1. [17] tools for reversible circuit design to implement the decomposition algorithm. We used reversible circuits with MCT gates reported in RevLib [16] to verify the power of our algorithm. After the decomposition, the moving rule was used to optimize the quantum costs of reversible circuits. The results are shown in Table III. Columns 3 and 5 represents the number of lines in original circuits and extra working line needed to decompose the circuit into quantum circuit respectively. Column 4 shows the number of elementary quantum gates required for the quantum implementation of reversible circuits. Last column indicates the reduction of quantum costs in percentage for Benchmark functions reported in RevLib. The bar chart in Figure 1 shows that the costs reductions are from 1-1% for about 5% of the benchmarks in our experiment. Further, the line graph shows the distribution of the cost reductions (see Figure 13). In the best case, for benchmark ex-1 166, a cost reduction of 37.5% was achieved. VII. CONCLUSION We proposed a two-qubit quantum gate library that plays a significant role in reducing quantum costs of reversible circuits. Experimental result show that reductions in quantum cost of more than % has been observed in more than half of the circuits from RevLib. While building the gate library all possible cascades of elementary quantum gates have been considered even cascades with more than 8 gates. However, no cascades produced valid Figure 13. Analysis of costs reduction. REFERENCES [1] R. Landauer, Irreversibility and heat generation in the computing process, IBM J. Res., vol. 5, pp , [] D. M. Miller, D. Maslov, and G. W. Dueck, A transformation based algorithm for reversible logic synthesis, in Design Automation Conference, June 3. [3] K. Iwama, Y. Kambayashi, and S. Yamashita, Transformation rules for designing CNOT-based quantum circuits, in Design Automation Conference, New Orleans, Louisiana, USA, June [4] A. Mishchenko and M. Perkowski, Logic synthesis of reversible wave cascades, in International Workshop on Logic Synthesis, June. [5] D. Maslov, G. W. Dueck, and D. M. Miller, Toffoli network synthesis with templates, Transactions on Computer Aided Design, vol. 4, no. 6, pp , 5. [6] D. Maslov, C. Young, G. W. Dueck, and D. M. Miller, Quantum circuit simplification using templates, in DATE - Design, Automation and Test in Europe, 5, pp [7] W. Hung, X. Song, G. Yang, J. Yang, and M. Perkowski, Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis, Transactions on Computer Aided Design, vol. 5, no. 9, pp , 6. [8] D. Große, R. Wille, G. W. Dueck, and R. Drechsler, Exact synthesis of elementary quantum gate circuits for reversible functions with don t cares, in International Symposium on Multiple Valued Logic, 8, pp [9] M. Lukac, Quantum logic synthesis and inductive machine learning, Ph.D. dissertation, Portland State University, 9. [1] A. Barenco, C. H. Bennett, R. Cleve, D. DiVinchenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, Elementary gates for quantum computation, The American Physical Society, vol. 5, pp ,
7 Benchmark Gates Lines QC(before) WL QC(after) Cost Red. (%) ex mod5-v fredkin alu-v alu-v alu-v alu-v gt mod5d gt miller miller rd3-v decod4-v decod4-v decod4-v decod4-v alu-v alu-v alu-v fredkin mod5d sym rd sys6-v gt mod5-v decod4-v rd3-v rd hwb mod5-v mod5-v rd decod4-enable gt decod4-v gt aj-e aj-e gt11-v decod4-v decod4-v mod5-v mod5-v ham toffoli double gt mod7-v mini-alu mod mod gt13-v one-two-three-v one-two-three-v add gt add alu-v c add mod7-v mod7-v mod5mils mod5mils add rd one-two-three-v alu-v decod4-enable one-two-three-v alu-v rd mod5adder mod5d gt4-v c gt1-v hw 6 test gt1-v ham gt4-v alu-v gt1-v gt gt4-v one-two-three-v gt1-v cnt mod gt4-v gt mod gt4-v gt1-v add add add hwb toffoli double peres graycode graycode toffoli toffoli peres Table III QUANTUM COST REDUCTION USING TWO-QUBIT QUANTUM GATE. [11] T. Toffoli, Reversible computing, Tech memo MIT/LCS/TM-151, MIT Lab for Comp. Sci, 198. [1] A. Peres, Reversible logic and quantum computers, Phys. Rev. A, vol. 3, no. 6, pp , Dec [13] E. Fredkin and T. Toffoli, Conservative logic, International Journal of Theoretical Physics, vol. 1, pp , 198. [14] A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVinchenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Elementary gates for quantum computation, The American Physical Society, vol. 5, pp , [15] N. O. Scott and G. W. Dueck, Pairwise decomposition of Toffoli gates in a quantum circuit, in Proceedings of the 18th ACM Great Lakes symposium on VLSI, 8, pp [16] R. Wille, D. Große, L. Teuber, G. W. Dueck, and R. Drechsler, RevLib: An online resource for reversible functions and reversible circuits, in Workshop on Reversible Computation, July 1, RevLib is available at [17] M. Soeken, S. Frehse, R. Wille, and R. Drechsler, RevKit: a toolkit for reversible circuit design, in Proceedings of the International Symposium on Multiple-Valued Logic, 8, RevKit is available at 9
Synthesis of Fredkin-Toffoli Reversible Networks
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL.???, NO.???,??? 2004 1 Synthesis of Fredkin-Toffoli Reversible Networks Dmitri Maslov, Gerhard W. Dueck, Member, IEEE, and D. Michael
More informationReversible Logic Synthesis with Output Permutation
Please note: Methods introduced in this paper are availabe at www.revkit.org. Reversible Logic Synthesis with Output Permutation Robert Wille 1 Daniel Große 1 Gerhard W. Dueck 2 Rolf Drechsler 1 1 Institute
More informationReversible Function Synthesis with Minimum Garbage Outputs
Reversible Function Synthesis with Minimum Garbage Outputs Gerhard W. Dueck and Dmitri Maslov Faculty of Computer Science University of New Brunswick Fredericton, N.B. E3B 5A3 CANADA Abstract Reversible
More informationTemplates for Positive and Negative Control Toffoli Networks
Templates for Positive and Negative Control Toffoli Networks Md Zamilur Rahman and Jacqueline E. Rice Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB, Canada {mdzamilur.rahman,j.rice}@uleth.ca
More informationSynthesizing Reversible Circuits for Irreversible Functions
Synthesizing Reversible Circuits for Irreversible Functions D. Michael Miller 1 Robert Wille 2 Gerhard W. Dueck 3 1 Department of Computer Science, University of Victoria, Canada 2 Group for Computer Architecture
More informationQuantified Synthesis of Reversible Logic
Quantified Synthesis of Reversible Logic Robert Wille 1 Hoang M. Le 1 Gerhard W. Dueck 2 Daniel Große 1 1 Group for Computer Architecture (Prof. Dr. Rolf Drechsler) University of Bremen, 28359 Bremen,
More informationOptimized Reversible Programmable Logic Array (PLA)
Journal of Advances in Computer Research Quarterly ISSN: 28-6148 Sari Branch, Islamic Azad University, Sari, I.R.Iran (Vol. 4, No. 1, February 213), Pages: 81-88 www.jacr.iausari.ac.ir Optimized Reversible
More informationA Shared-cube Approach to ESOP-based Synthesis of Reversible Logic
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 16, April 24, xx-xx A Shared-cube Approach to ESOP-based Synthesis of Reversible Logic N. M. Nayeem and J. E. Rice Abstract: Reversible logic is being
More informationIntegrated Synthesis of Linear Nearest Neighbor Ancilla-Free MCT Circuits
Integrated Synthesis of Linear Nearest Neighbor Ancilla-Free MCT Circuits Md Mazder Rahman 1, Gerhard W. Dueck 1, Anupam Chattopadhyay 2 and Robert Wille 3 1 Faculty of Computer Science, University of
More informationAn Algorithm for Minimization of Quantum Cost
Appl. Math. Inf. Sci. 6, No. 1, 157-165 (2012) 157 Applied Mathematics & Information Sciences An International Journal An Algorithm for Minimization of Quantum Cost Anindita Banerjee and Anirban Pathak
More informationCHAPTER 2 AN ALGORITHM FOR OPTIMIZATION OF QUANTUM COST. 2.1 Introduction
CHAPTER 2 AN ALGORITHM FOR OPTIMIZATION OF QUANTUM COST Quantum cost is already introduced in Subsection 1.3.3. It is an important measure of quality of reversible and quantum circuits. This cost metric
More informationSynthesis of Quantum Circuit for FULL ADDER Using KHAN Gate
Synthesis of Quantum Circuit for FULL ADDER Using KHAN Gate Madhumita Mazumder West Bengal University of Technology, West Bengal ABSTRACT Reversible and Quantum logic circuits have more advantages than
More informationTechnology Mapping of Reversible Circuits to Clifford+T Quantum Circuits
echnology Mapping of Reversible Circuits to Clifford+ Quantum Circuits Nabila Abdessaied Matthew Amy Mathias Soeken Rolf Drechsler Cyber-Physical Systems, DFKI Gmb, Bremen, Germany Department of Computer
More informationFPGA-Based Circuit Model Emulation of Quantum Algorithms
FPGA-Based Circuit Model Emulation of Quantum Algorithms Mahdi Aminian, Mehdi Saeedi, Morteza Saheb Zamani, Mehdi Sedighi Quantum Design Automation Lab Computer Engineering Department, Amirkabir niversity
More informationExploiting Reversibility in the Complete Simulation of Reversible Circuits
Exploiting Reversibility in the Complete Simulation of Reversible Circuits Robert Wille Simon Stelter Rolf Drechsler Institute of Computer Science, University of Bremen, 28359 Bremen, Germany Cyber-Physical
More informationExact SAT-based Toffoli Network Synthesis
Eact SAT-based Toffoli Network Synthesis ABSTRACT Daniel Große Institute of Computer Science University of Bremen 28359 Bremen, Germany grosse@informatik.unibremen.de Gerhard W. Dueck Faculty of Computer
More informationAnalysis of Multiplier Circuit Using Reversible Logic
IJIRST International Journal for Innovative Research in Science & Technology Volume 1 Issue 6 November 2014 ISSN (online): 2349-6010 Analysis of Multiplier Circuit Using Reversible Logic Vijay K Panchal
More informationGroup Theory Based Synthesis of Binary Reversible Circuits
Group Theory Based Synthesis of Binary Reversible Circuits Guowu Yang 1,XiaoyuSong 2, William N.N. Hung 2,FeiXie 1, and Marek A. Perkowski 2 1 Dept. of Computer Science, Portland State University, Portland,
More informationENERGY loss is an important consideration in digital design.
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 23, NO. 11, NOVEMBER 2004 1497 Reversible Cascades With Minimal Garbage Dmitri Maslov Gerhard W. Dueck, Member, IEEE
More informationComputer Science & Engineering Dept, West Bengal University of Technology 2 Information Technology Dept, Manipal University
Quantum Realization Full Adder-Subtractor Circuit Design Using Islam gate Madhumita Mazumder 1, Indranil Guha Roy 2 1, Computer Science & Engineering Dept, West Bengal University of Technology 2 Information
More informationImproved ESOP-based Synthesis of Reversible Logic
Improved ESOP-based Synthesis of Reversible Logic N. M. Nayeem Dept. of Math & Computer Science University of Lethbridge Lethbridge, AB, Canada noor.nayeem@uleth.ca J. E. Rice Dept. of Math & Computer
More informationQuantum Cost efficient Reversible Multiplier
Quantum Cost efficient Reversible Multiplier Mandeep Kaur, Chakshu Goel Abstract Increasing demand for reducing power dissipation in digital multipliers has led to new mode of computation for multiplier
More informationA Novel Design for carry skip adder using purity preserving reversible logic gates
A Novel Design for carry skip adder using purity preserving reversible logic gates Abstract: The reversible logic is a most popular and emerging field in low power consideration. It will be having many
More informationDirect Design of Reversible Combinational and Sequential Circuits Using PSDRM Expressions
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Print): 2320-9356 Volume 3 Issue 11 ǁ November. 2015 ǁ PP.59-67 Direct Design of Reversible Combinational
More informationDesign and Implementation of REA for Single Precision Floating Point Multiplier Using Reversible Logic
Design and Implementation of REA for Single Precision Floating Point Multiplier Using Reversible Logic MadivalappaTalakal 1, G.Jyothi 2, K.N.Muralidhara 3, M.Z.Kurian 4 PG Student [VLSI & ES], Dept. of
More informationISSN Vol.03, Issue.03, June-2015, Pages:
ISSN 2322-0929 Vol.03, Issue.03, June-2015, Pages:0271-0276 www.ijvdcs.org Design of Low Power Arithmetic and Logic Unit using Reversible Logic Gates LAKSHMIKANTHA MN 1, ANURADHA MG 2 1 Dept of ECE (VLSI
More informationExtended Superposed Quantum State Initialization Using Disjoint Prime Implicants
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants David Rosenbaum, Marek Perkowski Portland State University, Department of Computer Science Portland State University, Department
More informationOn The Complexity of Quantum Circuit Manipulation
On The Complexity of Quantum Circuit Manipulation Vincent Liew 1 Introduction The stabilizer class of circuits, introduced by Daniel Gottesman, consists of quantum circuits in which every gate is a controlled-not
More informationSynthesis of Reversible Circuits for Large Reversible Functions
Portland State University PDXScholar Electrical and Computer Engineering Faculty Publications and Presentations Electrical and Computer Engineering 12-2010 Synthesis of Reversible Circuits for Large Reversible
More informationDesign and Optimization of Reversible BCD Adder/Subtractor Circuit for Quantum and Nanotechnology Based Systems
World pplied Sciences Journal 4 (6): 787-792, 2008 ISSN 1818-4952 IDOSI Publications, 2008 Design and Optimization of Reversible CD dder/subtractor Circuit for Quantum and Nanotechnology ased Systems 1
More informationEquivalence Checking of Reversible Circuits
Please note: Methods introduced in this paper are availabe at wwwrevkitorg Equivalence Checking of Reversible Circuits Robert Wille Daniel Große D Michael Miller 2 Rolf Drechsler Institute of Computer
More informationFPGA IMPLEMENTATION OF BASIC ADDER CIRCUITS USING REVERSIBLE LOGIC GATES
FPGA IMPLEMENTATION OF BASIC ADDER CIRCUITS USING REVERSIBLE LOGIC GATES B.Ravichandra 1, R. Kumar Aswamy 2 1,2 Assistant Professor, Dept of ECE, VITS College of Engineering, Visakhapatnam (India) ABSTRACT
More informationTechnology Mapping and Optimization for Reversible and Quantum Circuits
Technology Mapping and Optimization for Reversible and Quantum Circuits by Zahra Sasanian B.Sc., University of Tehran, 2006 M.Sc., Amirkabir University of Technology, 2008 A Dissertation Submitted in Partial
More informationOptimized design of BCD adder and Carry skip BCD adder using reversible logic gates
Optimized design of BCD adder and Carry skip BCD adder using reversible logic gates H R Bhagyalakshmi E&C Department BMS College of Engineering, Bangalore, Karnataka, India M K Venkatesha E&C Department
More informationOPTIMIZED MULTIPLIER USING REVERSIBLE MULTI- CONTROL INPUT TOFFOLI GATES
OPTIMIZED MULTIPLIER USING REVERSILE MULTI- CONTROL INPUT TOFFOLI GTES H R hagyalakshmi 1 and M K Venkatesha 2 1 Department of Electronics and Communication Engineering, M S College of Engineering, Visvesvaraya
More informationDesign of an Online Testable Ternary Circuit from the Truth Table
Design of an Online Testable Ternary Circuit from the Truth Table N. M. Nayeem and J. E. Rice Dept. of Math & Computer Science University of Lethbridge, Lethbridge, Canada {noor.nayeem,j.rice}@uleth.ca
More informationA Novel Reversible Gate and its Applications
International Journal of Engineering and Technology Volume 2 No. 7, July, 22 Novel Reversible Gate and its pplications N.Srinivasa Rao, P.Satyanarayana 2 Department of Telecommunication Engineering, MS
More informationDesign of a Compact Reversible Random Access Memory
Design of a Compact Reversible Random Access Memory Farah Sharmin, Md. Masbaul Alam Polash, Md. Shamsujjoha, Lafifa Jamal, Hafiz Md. Hasan Babu Dept. of Computer Science & Engineering, University of Dhaka,
More informationDepartment of ECE, Vignan Institute of Technology & Management,Berhampur(Odisha), India
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Efficient Design Of 4-Bit Binary Adder Using Reversible Logic Gates Abinash Kumar Pala *, Jagamohan Das * Department of ECE, Vignan
More informationTransistor Implementation of Reversible Comparator Circuit Using Low Power Technique
Transistor Implementation of Reversible Comparator Circuit Using Low Power Technique Madhina Basha, V.N.Lakshmana Kumar Department of ECE, MVGR COLLEGE OF ENGINEERING Visakhapatnam, A.P, INDIA Abstract:
More informationDesign of a compact reversible binary coded decimal adder circuit
Journal of Systems Architecture 52 (2006) 272 282 www.elsevier.com/locate/sysarc Design of a compact reversible binary coded decimal adder circuit Hafiz Md. Hasan Babu *, Ahsan Raja Chowdhury Department
More informationarxiv: v1 [quant-ph] 20 Jul 2009
An analysis of reversible multiplier circuits Anindita Banerjee and Anirban Pathak March 9, 2018 Jaypee Institute of Information Technology University, Noida, India arxiv:0907.3357v1 [quant-ph] 20 Jul
More informationSYNTHESIS AND TESTING OF REVERSIBLE TOFFOLI CIRCUITS. NOOR MUHAMMED NAYEEM Bachelor of Science, University of Dhaka, 2008
SYNTHESIS AND TESTING OF REVERSIBLE TOFFOLI CIRCUITS NOOR MUHAMMED NAYEEM Bachelor of Science, University of Dhaka, 28 A Thesis Submitted to the School of Graduate Studies of the University of Lethbridge
More informationDesign and Implementation of Combinational Circuits using Reversible Gates
Design and Implementation of Combinational Circuits using Reversible Gates 1 Ms. Ashwini Gaikwad 2 Ms. Shweta Patil 1M.Tech Student,Departmentof Electronics Engineering, Walchand College of Engg., Sangli
More informationRealization of 2:4 reversible decoder and its applications
Realization of 2:4 reversible decoder and its applications Neeta Pandey n66pandey@rediffmail.com Nalin Dadhich dadhich.nalin@gmail.com Mohd. Zubair Talha zubair.talha2010@gmail.com Abstract In this paper
More informationAn Optimized BCD Adder Using Reversible Logic Gates
Vol.2, Issue.6, Nov-Dec. 2012 pp-4527-4531 ISSN: 2249-6645 An Optimized BCD Adder Using Reversible Logic Gates K.Rajesh 1, D A Tatajee 2 1, 2 Department of ECE, A I E T, Visakhapatnam, India, ABSTRACT:
More informationDesign of Reversible Code Converters Using Verilog HDL
Design of Reversible Code Converters Using Verilog HDL Vinay Kumar Gollapalli M. Tech (VLSI Design), K Koteshwarrao, M. Tech Assistant Professor, SSGN Srinivas, M. Tech Associate Professor & HoD, ABSTRACT:
More informationOptimized Nanometric Fault Tolerant Reversible BCD Adder
Research Journal of pplied Sciences, Engineering and Technology 4(9): 167-172, 212 ISSN: 24-7467 Maxwell Scientific Organizational, 212 Submitted: October 31, 211 ccepted: December 9, 211 Published: May
More informationDESIGN AND ANALYSIS OF A FULL ADDER USING VARIOUS REVERSIBLE GATES
DESIGN AND ANALYSIS OF A FULL ADDER USING VARIOUS REVERSIBLE GATES Sudhir Dakey Faculty,Department of E.C.E., MVSR Engineering College Abstract The goal of VLSI has remained unchanged since many years
More informationOptimization of reversible sequential circuits
WWW.JOURNALOFCOMPUTING.ORG 208 Optimization of reversible sequential circuits Abu Sadat Md. Sayem, Masashi Ueda Abstract In recent year s reversible logic has been considered as an important issue for
More informationDesign and Implementation of Nanometric Fault Tolerant Reversible BCD Adder
ustralian Journal of asic and pplied Sciences, 5(10): 896-901, 2011 ISSN 1991-8178 Design and Implementation of Nanometric Fault Tolerant Reversible D dder Majid Haghparast omputer Engineering Department,
More informationHigh Speed Time Efficient Reversible ALU Based Logic Gate Structure on Vertex Family
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 11, Issue 04 (April 2015), PP.72-77 High Speed Time Efficient Reversible ALU Based
More informationA New Approach for Designing of 3 to 8 Decoder and It s Applications Using Verilog HDL
A New Approach for Designing of 3 to 8 Decoder and It s Applications Using Verilog HDL P.Anirudh Goud PG-Scholar (VLSI Design) Department of ECE, Krishna Murthy Institute of Technology & Engineering, Edulabad,
More informationLiterature Review on Multiplier Accumulation Unit by Using Hybrid Adder
Literature Review on Multiplier Accumulation Unit by Using Hybrid Adder Amiya Prakash M.E. Scholar, Department of (ECE) NITTTR Chandigarh, Punjab Dr. Kanika Sharma Assistant Prof. Department of (ECE) NITTTR
More informationInternational Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS)
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationDesign of Digital Adder Using Reversible Logic
RESEARCH ARTICLE Design of Digital Adder Using Reversible Logic OPEN ACCESS Gowthami P*, RVS Satyanarayana ** * (Research scholar, Department of ECE, S V University College of Engineering, Tirupati, AP,
More informationDownloaded from
Proceedings of The Intl. Conf. on Information, Engineering, Management and Security 2014 [ICIEMS 2014] 309 Implementation of Novel Reversible Multiplier Architecture Using Reversible 4*4 TSG Gate T. SaiBaba
More informationDesign of Reversible Sequential Circuit Using Reversible Logic Synthesis
International Journal of VLSI design & ommunication Systems (VLSIS) Vol.2, No.4, December 20 Design of Reversible Sequential ircuit Using Reversible Logic Synthesis Md. elayet li, Md. Mosharof Hossin and
More informationOn Universality of Ternary Reversible Logic Gates
On Universality of Ternary Reversible Logic Gates Pawel Kerntopf*, Marek A. Perkowski**, Mozammel H. A. Khan*** *Institute of Computer Science, Department of Electronics and Information Technology, Warsaw
More informationLNN Reversible Circuit Realization Using Fast Harmony Search Based Heuristic 1
LNN Reversible Circuit Realization Using Fast Harmony Search Based Heuristic 1 Mohammad AlFailakawi a*, Imtiaz Ahmad a, & Suha Hamdan a a Computer Engineering Department, College of Computing Sciences
More informationDesign of Reversible Synchronous Sequential Circuits
Design of Reversible Synchronous Sequential Circuits Sonawane Parag Narayan 1, Hatkar Arvind Pandurang 2 1 E&TC,SVIT Chincholi 2 E&TC,SVIT Chincholi Abstract In early 70`s one computer requires one whole
More informationFULL ADDER/ SUBTRACTOR USING REVERSIBLE LOGIC
Volume 120 No. 6 2018, 437-446 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ FULL ADDER/ SUBTRACTOR USING REVERSIBLE LOGIC Dr. B. Balaji 1, M.Aditya 2,Dr.Erigela
More informationarxiv:quant-ph/ v1 24 Jul 2006
Techniques for the Synthesis of Reversible Toffoli Networks arxiv:quant-ph/0607166v1 24 Jul 2006 D. Maslov D. M. Miller G. W. Dueck Dept. of Combinatorics and Optimization Dept. of Computer Science Faculty
More informationDatabase Manipulation Operations on Quantum Systems
Quant Inf Rev, No, 9-7 (203) 9 Quantum Information Review An International Journal http://dxdoiorg/02785/qir/0002 Database Manipulation Operations on Quantum Systems Ahmed Younes Department of Mathematics
More informationarxiv: v2 [quant-ph] 27 Dec 2010
Reversible circuit synthesis using a cycle-based approach arxiv:1004.4320v2 [quant-ph] 27 Dec 2010 Mehdi Saeedi, Morteza Saheb Zamani, Mehdi Sedighi, Zahra Sasanian Quantum Design Automation Lab Department
More informationDesign of Reversible Logic based Basic Combinational Circuits
Communications on Applied Electronics (CAE) ISSN : 2394-4714 Foundation of Computer Science FCS, New York, USA Volume 5 No.9, September 2016 www.caeaccess.org Design of Reversible Logic based Basic Combinational
More informationLow Power and High Speed BCD Adder using Reversible Gates
Low Power and High Speed BCD Adder using Reversible Gates Pradeep S R PraveenKumar Prathibha S R Abstract Reversible logic is one of the emerging technologies having promising applications in quantum computing.
More informationA Systematic Algorithm for Quantum Boolean Circuits Construction
A Systematic Algorithm for Quantum Boolean Circuits Construction I.M. Tsai and S.Y. Kuo arxiv:quant-ph/0104037v2 19 Apr 2001 Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan.
More informationUSING AUTOCORRELATION COEFFICIENT-BASED COST FUNCTIONS IN ESOP-BASED TOFFOLOI GATE CASCADE GENERATION
USING AUTOCORRELATION COEFFICIENT-BASED COST FUNCTIONS IN ESOP-BASED TOFFOLOI GATE CASCADE GENERATION J. E. Rice University of Lethbridge Department of Mathematics & Computer Science Lethbridge, Alberta,
More informationVariable Reordering for Reversible Wave Cascades - PRELIMINARY VERSION
Variable Reordering for Reversible Wave Cascades - PRELIMINARY VERSION Dimitrios Voudouris, Marinos Sampson and George Papakonstantinou National Technical University of Athens, Greece. Abstract In this
More informationDESIGN OF A COMPACT REVERSIBLE READ- ONLY-MEMORY WITH MOS TRANSISTORS
DESIGN OF A COMPACT REVERSIBLE READ- ONLY-MEMORY WITH MOS TRANSISTORS Sadia Nowrin, Papiya Nazneen and Lafifa Jamal Department of Computer Science and Engineering, University of Dhaka, Bangladesh ABSTRACT
More informationA Novel Synthesis Algorithm for Reversible Circuits
A Novel Synthesis Algorithm for Reversible Circuits Mehdi Saeedi, Mehdi Sedighi*, Morteza Saheb Zamani Email: {msaeedi, msedighi, szamani}@ aut.ac.ir Quantum Design Automation Lab, Computer Engineering
More informationFPGA IMPLEMENTATION OF 4-BIT AND 8-BIT SQUARE CIRCUIT USING REVERSIBLE LOGIC
FPGA IMPLEMENTATION OF 4-BIT AND 8-BIT SQUARE CIRCUIT USING REVERSIBLE LOGIC Shwetha. S Patil 1, Mahesh Patil 2, Venkateshappa 3 Assistant Professor 1,PG Student 2, Professor 3 1,2,3 Dept. of ECE, 1 MVJ
More informationAn Efficient Reversible Design of BCD Adder
An Efficient Reversible Design of BCD Adder T.S.R.Krishna Prasad 1, Y.Satyadev 2 1 Associate Professor in Gudlavalleru Engineering College Department of ECE, e-mail: ad2prasad@gmail.com 2 Student of Gudlavalleru
More informationPERFORMANCE ANALYSIS OF CLA CIRCUITS USING SAL AND REVERSIBLE LOGIC GATES FOR ULTRA LOW POWER APPLICATIONS
PERFORMANCE ANALYSIS OF CLA CIRCUITS USING SAL AND REVERSIBLE LOGIC GATES FOR ULTRA LOW POWER APPLICATIONS K. Prasanna Kumari 1, Mrs. N. Suneetha 2 1 PG student, VLSI, Dept of ECE, Sir C R Reddy College
More informationOn the Analysis of Reversible Booth s Multiplier
2015 28th International Conference 2015 on 28th VLSI International Design and Conference 2015 14th International VLSI Design Conference on Embedded Systems On the Analysis of Reversible Booth s Multiplier
More informationImplementation of Reversible ALU using Kogge-Stone Adder
Implementation of Reversible ALU using Kogge-Stone Adder Syed.Zaheeruddin, Ch.Sandeep Abstract: Reversible circuits are one promising direction with applications in the field of low-power design or quantum
More informationOn the Difficulty of Inserting Trojans in Reversible Computing Architectures
On the Difficulty of Inserting Trojans in Reversible Computing Architectures Xiaotong Cui, Samah Saeed, Alwin Zulehner, Robert Wille, Rolf Drechsler, Kaijie Wu, Ramesh Karri, Chongqing University, China
More informationLogic Synthesis for Quantum State Generation
Logic Synthesis for Quantum State Generation Philipp Niemann Department of Computer Science, University of Bremen, D-8359 Bremen, Germany Email: pniemann@csuni-bremende Rhitam Datta Indian Institute of
More informationarxiv:quant-ph/ v1 27 Sep 2005
Realizing Ternary Quantum Switching Networks without Ancilla Bits arxiv:quant-ph/0509192v1 27 Sep 2005 Guowu Yang, Xiaoyu Song and Marek Perkowski Department of Electrical & Computer Engineering, Portland
More informationDesign of Reversible Comparators with Priority Encoding Using Verilog HDL
Design of Reversible Comparators with Priority Encoding Using Verilog HDL B.Chaitanya Latha M.Tech (VLSI SD), Alfa College of Engineering and Technology. V.Praveen Kumar, M.Tech (DSP) Associate Professor,
More informationDESIGN OF PARITY PRESERVING LOGIC BASED FAULT TOLERANT REVERSIBLE ARITHMETIC LOGIC UNIT
International Journal of VLSI design & Communication Systems (VLSICS) Vol.4, No.3, June 2013 DESIGN OF PARITY PRESERVING LOGIC BASED FAULT TOLERANT REVERSIBLE ARITHMETIC LOGIC UNIT Rakshith Saligram 1
More informationImplementation of Optimized Reversible Sequential and Combinational Circuits for VLSI Applications
V. G. Santhi Swaroop et al Int. Journal of Engineering Research and Applications RESEARCH ARTICLE OPEN ACCESS Implementation of Optimized Reversible Sequential and Combinational Circuits for VLSI Applications
More informationENERGY EFFICIENT DESIGN OF REVERSIBLE POS AND SOP USING URG
ENERGY EFFICIENT DESIGN OF REVERSIBLE POS AND SOP USING URG Mr.M.Saravanan Associate Professor, Department of EIE Sree Vidyanikethan Engineering College, Tirupati. mgksaran@yahoo.com Dr.K.Suresh Manic
More informationA Novel Design of Reversible Universal Shift Register
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 3, March 2014,
More informationDesign and Implementation of Carry Adders Using Adiabatic and Reversible Logic Gates
Design and Implementation of Carry Adders Using Adiabatic and Reversible Logic Gates B.BharathKumar 1, ShaikAsra Tabassum 2 1 Research Scholar, Dept of ECE, Lords Institute of Engineering & Technology,
More informationarxiv: v1 [quant-ph] 12 Aug 2013
On quantum circuits employing roots of the Pauli matrices Mathias Soeen, 1 D. Michael Miller, and Rolf Drechsler 1 1 Institute of Computer Science, niversity of Bremen, Germany Department of Computer Science,
More informationPower Optimization using Reversible Gates for Booth s Multiplier
International Journal for Modern Trends in Science and Technology Volume: 02, Issue No: 11, November 2016 ISSN: 2455-3778 http://www.ijmtst.com Power Optimization using Reversible Gates for Booth s Multiplier
More informationAn FPGA Implementation of Energy Efficient Code Converters Using Reversible Logic Gates
An FPGA Implementation of Energy Efficient Code Converters Using Reversible Logic Gates Rakesh Kumar Jha 1, Arjun singh yadav 2 Assistant Professor, Dept. of ECE, Corporate Institute of Science & Technology,
More informationQuantum Cost Optimization for Reversible Carry Skip BCD Adder
International Journal of Science and Technology Volume 1 No. 10, October, 2012 Quantum Cost Optimization for Reversible Carry Skip BCD Adder Md. Selim Al Mamun, Indrani Mandal, Uzzal Kumar Prodhan Department
More informationReversible Circuit Synthesis of Symmetric Functions Using a Simple Regular Structure
Reversible Circuit Synthesis of Symmetric Functions Using a Simple Regular Structure Arighna Deb 1, Debesh K. Das 1, Hafizur Rahaman 2, Bhargab B. Bhattacharya 3, Robert Wille 4, Rolf Drechsler 4 1 Computer
More informationReversible Circuit Using Reversible Gate
Reversible Circuit Using Reversible Gate 1Pooja Rawat, 2Vishal Ramola, 1M.Tech. Student (final year), 2Assist. Prof. 1-2VLSI Design Department 1-2Faculty of Technology, University Campus, Uttarakhand Technical
More informationTechnical Report: Considerations for Determining a Classification Scheme for Reversible Boolean Functions
Technical Report: Considerations for Determining a Classification Scheme for Reversible Boolean Functions 1 Introduction TR-CSJR2-2007 J. E. Rice University of Lethbridge j.rice@uleth.ca For many years
More informationMajority-Based Reversible Logic Gate
Maority-Based Reversible Logic Gate Guowu Yang, William N. N. Hung *, Xiaoyu Song and Mare Perowsi Portland State University, Portland, Oregon, USA ABSTRAT Reversible logic plays an important role in application
More informationDesign of 16 Bit Adder Subtractor with PFAG and TG Gates Using Verilog HDL
International Journal of Engineering Science and Generic Research (IJESAR) Available Online at www.ijesar.in Journal Index In ICI World of Journals - ICV 2016 68.35 Volume 4; Issue 5; September-October;
More informationPower Minimization of Full Adder Using Reversible Logic
I J C T A, 9(4), 2016, pp. 13-18 International Science Press Power Minimization of Full Adder Using Reversible Logic S. Anandhi 1, M. Janaki Rani 2, K. Manivannan 3 ABSTRACT Adders are normally used for
More informationDesign of Efficient Adder Circuits Using PROPOSED PARITY PRESERVING GATE (PPPG)
Design of Efficient Adder Circuits Using PROPOSED PARITY PRESERVING GATE (PPPG) Krishna Murthy M 1, Gayatri G 2, Manoj Kumar R 3 1 Department of ECE, MVGRCE, Vizianagaram, Andhra Pradesh krishnamurthy_madaka@yahoo.co.in
More informationA More Effective Realization Of BCD Adder By Using A New Reversible Logic BBCDC
International Journal of Computational Engineering Research Vol, 04 Issue, 2 A More Effective Realization Of BCD Adder By Using A New Reversible Logic BBCDC Shefali Mamataj 1,Biswajit Das 2,Anurima Rahaman
More informationCircuit for Revisable Quantum Multiplier Implementation of Adders with Reversible Logic 1 KONDADASULA VEDA NAGA SAI SRI, 2 M.
ISSN (O): 2349-7084 International Journal of Computer Engineering In Research Trends Available online at: www.ijcert.org Circuit for Revisable Quantum Multiplier Implementation of Adders with Reversible
More informationDesign of Universal Shift Register Using Reversible Logic
International Journal of Engineering and Technology Volume 2 No. 9, September, 2012 Design of Universal Shift Register Using Reversible Logic 1 Md. Selim Al Mamun, 2 Indrani Mandal, 3 Md. Hasanuzzaman
More information