Share This Author
Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis
- W. Hung, Xiaoyu Song, Guowu Yang, Jin Yang, M. Perkowski
- Computer ScienceIEEE Transactions on Computer-Aided Design of…
- 1 September 2006
This paper constitutes the first successful experience of applying formal methods and satisfiability to quantum logic synthesis, thus synthesizing in principle arbitrary multi-output Boolean functions with quantum gate library.
Fast Heuristic Minimization of Exclusive-Sums-of-Products
Improvements concern three aspects of the procedure: computation of the starting ESOP cover; increase of the search space for solutions by applying a larger set of cube transformations; development of specialized datastructure for robust manipulation of ESOP covers.
Logic Synthesis of Reversible Wave Cascades
This paper introduces an algorithm to generate the cascade of reversible complex Maitra terms implementing incompletely specified Boolean functions, and preliminary estimation suggests that the method may be applicable to small and medium-sized benchmarks.
Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits
The synthesis method to RPGAs allows to realize arbitrary symmetric function in a completely regular structure of reversible gates with smaller “garbage” than the previously presented papers.
An algorithm for bi-decomposition of logic functions
- A. Mishchenko, B. Steinbach, M. Perkowski
- Computer ScienceProceedings of the 38th Design Automation…
- 22 June 2001
Experimental results over MCNC benchmarks show that this approach outperforms SIS and other BDD-based decomposition methods in terms of area and delay of the resulting circuits with comparable CPU time.
Quantum ternary parallel adder/subtractor with partially-look-ahead carry
Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams
- R. Drechsler, A. Sarabi, M. Theobald, B. Becker, M. Perkowski
- Computer Science31st Design Automation Conference
- 6 June 1994
An efficient package for construction of and operation on ordered Kronecker Functional Decision Diagrams (OKFDD) is presented and a 25% improve ment in size over OBDDs is observed.
Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions
Evaluation on benchmark functions is given and it proves the superiority of the program to those known from the literature on the basis of power and efficiency.
Evolving quantum circuits using genetic algorithm
A generic GA to evolve arbitrary quantum by using genetic algorithm as well as a specific encoding that reduces the time of calculating the resultant unitary matrices of chromosomes is proposed.
Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring
It is shown that ternary encoding leads to quantum circuits that have significantly less qud its and lower quantum costs and in case of serial realization of quantum computers, the ternaries algorithms and circuits are also faster.