Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Novel Quantum Algorithms To Minimize Switching Functions Based On Graph Partitions, Peng Gao, Marek A. Perkowski, Yiwei Li, Xiaoyu Song
Novel Quantum Algorithms To Minimize Switching Functions Based On Graph Partitions, Peng Gao, Marek A. Perkowski, Yiwei Li, Xiaoyu Song
Electrical and Computer Engineering Faculty Publications and Presentations
After Google reported its realization of quantum supremacy, Solving the classical problems with quantum computing is becoming a valuable research topic. Switching function minimization is an important problem in Electronic Design Automation (EDA) and logic synthesis, most of the solutions are based on heuristic algorithms with a classical computer, it is a good practice to solve this problem with a quantum processer. In this paper, we introduce a new hybrid classic quantum algorithm using Grover’s algorithm and symmetric functions to minimize small Disjoint Sum of Product (DSOP) and Sum of Product (SOP) for Boolean switching functions. Our method is based …
Effectiveness Assessment Of The Search-Based Statistical Structural Testing, Yang Shi, Xiaoyu Song, Marek A. Perkowski, Fu Li
Effectiveness Assessment Of The Search-Based Statistical Structural Testing, Yang Shi, Xiaoyu Song, Marek A. Perkowski, Fu Li
Electrical and Computer Engineering Faculty Publications and Presentations
Search-based statistical structural testing (SBSST) is a promising technique that uses automated search to construct input distributions for statistical structural testing. It has been proved that a simple search algorithm, for example, the hill-climber is able to optimize an input distribution. However, due to the noisy fitness estimation of the minimum triggering probability among all cover elements (Tri-Low-Bound), the existing approach does not show a satisfactory efficiency. Constructing input distributions to satisfy the Tri-Low-Bound criterion requires an extensive computation time. Tri-Low-Bound is considered a strong criterion, and it is demonstrated to sustain a high fault-detecting ability. This article tries to …
Quantum Grover's Oracles With Symmetry Boolean Functions, Peng Gao
Quantum Grover's Oracles With Symmetry Boolean Functions, Peng Gao
Dissertations and Theses
Quantum computing has become an important research field of computer science and engineering. Among many quantum algorithms, Grover's algorithm is one of the most famous ones. Designing an effective quantum oracle poses a challenging conundrum in circuit and system-level design for practical application realization of Grover's algorithm.
In this dissertation, we present a new method to build quantum oracles for Grover's algorithm to solve graph theory problems. We explore generalized Boolean symmetric functions with lattice diagrams to develop a low quantum cost and area efficient quantum oracle. We study two graph theory problems: cycle detection of undirected graphs and generalized …