Transcript Quantum

Synthesis and Test of Quantum Circuits
Dr. Marek Perkowski and Dr. Xiaoyu Song
http://web.cecs.pdx.edu/~mperkows/
Our research in the area of quantum
computing will develop computer aided
design tools for quantum circuits and
systems which will be similar in use to the
design automation tools for VLSI that are
used now in industry.
Portland Quantum Logic Group is the group of
international researchers from countries like USA,
Canada, Japan, Korea, Poland, Germany, The
Netherlands, Bangladesh, China, Russia, Jordan,
Estonia and Ukraine interested in technical aspects
of future quantum computers. The research issues
include:
• Synthesis of quantum and reversible circuits from
high level specifications
Cluster built by students to
investigate parallel
evolutionary algorithms for
quantum circuits synthesis
and simulation of quantum
circuits and algorithms
• Quantum Automata and their applications
• Testing quantum circuits
• Quantum Algorithms for NP-hard problems,
especially CAD problems.
• Quantum Image Processing and Transforms.
This research area includes Logic and System
design of VLSI circuits, Field Programmable
Gate Array circuits and Quantum Computers.
Particular recent projects include synthesis
and test of quantum circuits, reversible logic,
quantum algorithms, Quantum Computational
Intelligence, Evolutionary, Quantum-Inspired
and Biologically-Motivated Algorithms for
circuit design, and Multiple-Valued logic. Past
funding came from NSF (three times), US Air
Force Office of Scientific Research, Sharp
Microelectronics and others. Good
programming skills and certain liking of
mathematics are expected from students who
want to work in this area.
Quantum Braitenberg Automata
Robots use concepts from quantum
computing to solve problems and
present emotional behaviors
Selected Publications
S. Lee, S.J. Lee, T. Kim, J-S Lee, J. Biamonte, M. Perkowski,
"The Cost of Quantum Gate Primitives," Journal of Multi-valued
Logic and Soft Computing, 2005.
J. Biamonte, M. Perkowski, "Automated Test Pattern Generation
for Quantum Circuits," McNair Research Journal, Vol. 1, Issue 1,
2005.
A. N. Al-Rabadi, M. Perkowski, "New Families of Reversible
Expansions and their Regular Lattice Circuits," Journal of
Multiple-Valued Logic and Soft Computing (MVLSC), U.S.A.,
Volume 11, Number 3-4, 2005.
G. Yang, X. Song, M. Perkowski, J. Wu, "Realizing ternary
quantum switching networks without ancilla bits," Journal of
Physics A. Mathematical and General, 2005.
W. Hung, X. Song, G. Yang, M. Perkowski, "Optimal Synthesis of
multiple output boolean functions using a set of quantum gates by
symbolic reachability analysis," IEEE Transactions on ComputerAided Design, 2006
G. Yang, W. Hung, X. Song, M. Perkowski, "Majority-Based
Reversible Logic Gates," Theoretical Computer Science C.
334(1-3), pp. 259-274, ISSN 0304-3975, April 15, 2005.
X. Song, G, Yang, M. Perkowski, "Algebraic Characteristics of
Reversible Gates,'' Accepted to Theory of Computing Systems
(Mathematical Systems Theory, Springer Verlag. First published
on Online Test, ISSN 1432-4350, 2005.
M. Khan, M. Perkowski, M. Khan, P. Kerntopf, "Ternary GFSOP
Minimization using Kronecker Decision Diagrams and Their
Synthesis with Quantum Cascades," MVL Journal Special Issue,
ISSN 1542-3980.
P. Kerntopf, M. Perkowski, M. H. A. Khan. "Universality of ternary
reversible gates," Accepted to special issue of International
Journal on Multiple-Valued Logic and Soft Computing, Svetlana
Yanushkevich, editor, ISSN 1542-3980.
A. Al-Rabadi, L. Casperson, M. Perkowski, "Multiple-valued
quantum logic," Quantum Computers and Computing, Vol. 3,
Number 1.
W. Hung, X. Song, M. Perkowski, "Reachability Analysis for
reversible minimization," Proceedings of DAC 2004, June 2004,
San Diego, California.
M. Lukac, M. Perkowski, H. Goi, M. Pivtoraiko, C. H. Yu, K.
Chung, H. Jee, B-G Kim, Y-D Kim, "Evolutionary Approach to
Quantum and Reversible Circuits Synthesis," Artificial Intelligence
Review Journal, Special Issue on Artificial Intelligence in Logic
Design, S. Yanushkevich guest editor, ISSN 0269-2821, 2003.