2,617 research outputs found
Low Power Reversible Parallel Binary Adder/Subtractor
In recent years, Reversible Logic is becoming more and more prominent
technology having its applications in Low Power CMOS, Quantum Computing,
Nanotechnology, and Optical Computing. Reversibility plays an important role
when energy efficient computations are considered. In this paper, Reversible
eight-bit Parallel Binary Adder/Subtractor with Design I, Design II and Design
III are proposed. In all the three design approaches, the full Adder and
Subtractors are realized in a single unit as compared to only full Subtractor
in the existing design. The performance analysis is verified using number
reversible gates, Garbage input/outputs and Quantum Cost. It is observed that
Reversible eight-bit Parallel Binary Adder/Subtractor with Design III is
efficient compared to Design I, Design II and existing design.Comment: 12 pages,VLSICS Journa
Synthesis of Reversible Circuits from a Subset of Muthukrishnan-Stroud Quantum Realizable Multi-Valued Gates
We present a new type of quantum realizable reversible cascade. Next we present a new algorithm to synthesize arbitrary single-output ternary functions using these reversible cascades. The cascades use “Generalized Multi-Valued Gates” introduced here, which extend the concept of Generalized Ternary Gates introduced previously. While there were 216 GTGs, a total of 12 ternary gates of the new type are sufficient to realize arbitrary ternary functions. (The count can be further reduced to 5 gates, three 2-qubit and two 1-qubit). Such gates are realizable in quantum ion trap devices. For some functions, the algorithm requires fewer gates than results previously published [1, 5, 8, 14]. In addition, the algorithm also does conversion from arbitrary ternary logic to reversible logic at the cost of relatively small garbage. The algorithm is implemented here in ternary logic, but generalization to arbitrary radix is both straightforward and sees a reduction in growth of cost as the radix is increased
Constructing all qutrit controlled Clifford+T gates in Clifford+T
For a number of useful quantum circuits, qudit constructions have been found
which reduce resource requirements compared to the best known or best possible
qubit construction. However, many of the necessary qutrit gates in these
constructions have never been explicitly and efficiently constructed in a
fault-tolerant manner. We show how to exactly and unitarily construct any
qutrit multiple-controlled Clifford+T unitary using just Clifford+T gates and
without using ancillae. The T-count to do so is polynomial in the number of
controls , scaling as . With our results we can construct
ancilla-free Clifford+T implementations of multiple-controlled T gates as well
as all versions of the qutrit multiple-controlled Toffoli, while the analogous
results for qubits are impossible. As an application of our results, we provide
a procedure to implement any ternary classical reversible function on trits
as an ancilla-free qutrit unitary using T gates.Comment: 14 page
- …