Engineering Commons^™

Decomposition Of Reversible Logic Function Based On Cube-Reordering, Martin Lukac, Michitaka Kameyama, Marek Perkowski, Pawel Kerntopf

Electrical and Computer Engineering Faculty Publications and Presentations

We present a novel approach to the synthesis of incompletely specified reversible logic functions. The method is based on cube grouping; the first step of the synthesis method analyzes the logic function and generates groupings of same cubes in such a manner that multiple sub-functions are realized by a single Toffoli gate. This process also reorders the function in such a manner that not only groups of similarly defined cubes are joined together but also don’t care cubes. The proposed method is verified on standard benchmarks for both reversible and irreversible logic functions. The obtained results show that for functions …

Synthesis Of Reversible Synchronous Counters, Marek Perkowski, Mozammel H.A. Khan

Electrical and Computer Engineering Faculty Publications and Presentations

In this paper, we concentrate on design of synchronous counters directly from reversible gates.

Quantum Phase Estimation Using Multivalued Logic, Marek Perkowski, Vamsi Parasa

Electrical and Computer Engineering Faculty Publications and Presentations

We generalize the Quantum Phase Estimation algorithm to MVL logic. We show the quantum circuits for QPE using qudits. We derive the performance requirements of the QPE to achieve high probability of success. We show how this leads to logarithmic decrease in the number of qudits and exponential decrease in error probability of the QPE algorithm as the value of the radix d increases.

Improved Complexity Of Quantum Oracles For Ternary Grover Algorithm For Graph Coloring, Marek Perkowski, Yushi Wang

Electrical and Computer Engineering Faculty Publications and Presentations

The Graph Coloring Grover Algorithm has several applications in logic synthesis, scheduling, allocation, planning, robot motion, robot communication, resource allocation, conflict resolution, floor-planning, and many others.

It can serve as a “generic CSP solver” similar to a general SAT solver.

Synthesis Of Quantum Circuits In Linear Nearest Neighbor Model Using Positive Davio Lattices, Marek Perkowski, Martin Lukac, Dipal Shah, Michitaka Kameyama

Electrical and Computer Engineering Faculty Publications and Presentations

We present a logic synthesis method based on lattices that realize quantum arrays in One-Dimensional Ion Trap technology. This means that all gates are built from 2x2 quantum primitives that are located only on neighbor qubits in a onedimensional space (called also vector of qubits or Linear Nearest Neighbor (LNN) architecture). The Logic circuits designed by the proposed method are realized only with 3*3 Toffoli, Feynman and NOT quantum gates and the usage of the commonly used multi-input Toffoli gates is avoided. This realization method of quantum circuits is different from most of reversible circuits synthesis methods from the literature …