Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Engineering
An Extended Approach For Generating Unitary Matrices For Quantum Circuits, Zhiqiang Li, Wei Zhang, Gaoman Zhang, Juan Dai, Jiajia Hu, Marek Perkowski, Xiaoyu Song
An Extended Approach For Generating Unitary Matrices For Quantum Circuits, Zhiqiang Li, Wei Zhang, Gaoman Zhang, Juan Dai, Jiajia Hu, Marek Perkowski, Xiaoyu Song
Electrical and Computer Engineering Faculty Publications and Presentations
In this paper, we do research on generating unitary matrices for quantum circuits automatically. We consider that quantum circuits are divided into six types, and the unitary operator expressions for each type are offered. Based on this, we propose an algorithm for computing the circuit unitary matrices in detail. Then, for quantum logic circuits composed of quantum logic gates, a faster method to compute unitary matrices of quantum circuits with truth table is introduced as a supplement. Finally, we apply the proposed algorithm to different reversible benchmark circuits based on NCT library (including NOT gate, Controlled-NOT gate, Toffoli gate) and …
Cost Minimization Approach To Synthesis Of Linear Reversible Circuits, Ben Schaeffer, Marek Perkowski
Cost Minimization Approach To Synthesis Of Linear Reversible Circuits, Ben Schaeffer, Marek Perkowski
Electrical and Computer Engineering Faculty Publications and Presentations
This paper presents a heuristic cost minimization approach to synthesizing linear reversible circuits. Two bidirectional linear reversible circuit synthesis methods are introduced, the Alternating Elimination with Cost Minimization method (AECM) and the Multiple CNOT Gate method (MCG). Algorithms, example syntheses, and extensions to these methods are presented. An MCG variant which incorporates line reordering is introduced. Tests comparing the new cost minimization methods with the best known method for large circuits are presented. Results show that of the three methods MCG had the lowest average CNOT gate counts for linear reversible circuits up to 24 lines, and that AECM had …
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants, David Rosenbaum, Marek Perkowski
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants, David Rosenbaum, Marek Perkowski
Electrical and Computer Engineering Faculty Publications and Presentations
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants (ESQUID) is a new algorithm for generating quantum arrays for the purpose of initializing a desired quantum superposition. The quantum arrays generated by this algorithm almost always use fewer gates than other algorithms and in the worst case use the same number of gates. These improvements are achieved by allowing certain parts of the quantum superposition that cannot be initialized directly by the algorithm to be initialized using special circuits. This allows more terms in the quantum superposition to be initialized at the same time which decreases the number of gates …
Realizing Ternary Quantum Switching Networks Without Ancilla Bits, Marek Perkowski, Guowu Yang, Xiaoyu Song, Jinzhao Wu
Realizing Ternary Quantum Switching Networks Without Ancilla Bits, Marek Perkowski, Guowu Yang, Xiaoyu Song, Jinzhao Wu
Electrical and Computer Engineering Faculty Publications and Presentations
This paper investigates the synthesis of quantum networks built to realize ternary switching circuits in the absence of ancilla bits. The results we established are twofold. The first shows that ternary Swap, ternary NOT and ternary Toffoli gates are universal for the realization of arbitrary n × n ternary quantum switching networks without ancilla bits. The second result proves that all n×n quantum ternary networks can be generated by NOT, Controlled-NOT, Multiply-Two and Toffoli gates. Our approach is constructive.
Fault Localization In Reversible Circuits Is Easier Than For Classical Circuits, Kavitha Ramasamy, Radhika Tagare, Edward Perkins, Marek Perkowski
Fault Localization In Reversible Circuits Is Easier Than For Classical Circuits, Kavitha Ramasamy, Radhika Tagare, Edward Perkins, Marek Perkowski
Electrical and Computer Engineering Faculty Publications and Presentations
There is recently an interest in test generation for reversible circuits, but nothing has been published about fault localization in such circuits. This paper deals with fault localization for binary reversible (permutative) circuits. We concentrate on functional test based fault localization, to detect and locate “stuck-at” faults in a reversible circuit by creating an adaptive tree. A striking property of reversible circuits is that they exhibit “symmetric” adaptive trees. This helps considerably by being able to generate only half of the tree, and the other half is created as the mirror image of the first half. Because each test covers …
Logic Synthesis For Regular Fabric Realized In Quantum Dot Cellular Automata, Marek Perkowski, Alan Mishchenko
Logic Synthesis For Regular Fabric Realized In Quantum Dot Cellular Automata, Marek Perkowski, Alan Mishchenko
Electrical and Computer Engineering Faculty Publications and Presentations
Quantum Dot Cellular Automata are one of the most prospective nano-technologies to build digital circuits. Because of the requirements of only 2 layer wiring and noise avoidance, realizing the circuit in a regular fabrics is even more important for this technology than for classical technologies. In this paper, we propose a regular layout geometry called 3x3 lattice. The main difference of this geometry compared to the known 2x2 lattices is that it allows the cofactors on a level to propagate to three rather than two nodes on the lower level. This gives additional freedom to synthesize compact functional representations. We …
Function-Driven Linearly Independent Expansions Of Boolean Functions And Their Application To Synthesis Of Reversible Circuits, Pawel Kerntopf, Marek Perkowski
Function-Driven Linearly Independent Expansions Of Boolean Functions And Their Application To Synthesis Of Reversible Circuits, Pawel Kerntopf, Marek Perkowski
Electrical and Computer Engineering Faculty Publications and Presentations
The paper presents a family of new expansions of Boolean functions called Function-driven Linearly Independent (fLI) expansions. On the basis of this expansion a new kind of a canonical representation of Boolean functions is constructed: Function-driven Linearly Independent Binary Decision Diagrams (fLIBDDs). They generalize both Function-driven Shannon Binary Decision Diagrams (fShBDDs) and Linearly Independent Binary Decision Diagram (LIBDDs). The diagrams introduced in the paper, can provide significantly smaller representations of Boolean functions than standard Ordered Binary Decision Diagrams (OBDDs), Ordered Functional Decision Diagrams (OFDDs) and Ordered (Pseudo-) Kronecker Functional Decision Diagrams (OKFDDs) and can be applied to synthesis of reversible …
Evolving Quantum Circuits And An Fpga-Based Quantum Computing Emulator, Goran Negovetic, Marek Perkowski, Martin Lukac, Andrzej Buller
Evolving Quantum Circuits And An Fpga-Based Quantum Computing Emulator, Goran Negovetic, Marek Perkowski, Martin Lukac, Andrzej Buller
Electrical and Computer Engineering Faculty Publications and Presentations
The goal of the PQLG group is to develop complete methodologies, software tools and circuits for quantum logic. Our interests are mainly in logic synthesis for quantum circuits and quantum system design [10]. Emulation of quantum circuits using standard reconfigurable FPGA technology and FPGA-based Evolvable Quantum Hardware, proposed here, are research areas not yet dealt with by other research groups. A parallel software simulator was presented in [13].