High speed genetic algorithms in quantum logic synthesis: Low level parallelization vs. representation

Martin Lukac, Michitaka Kameyama, Michael Miller, Marek Perkowski

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

Abstract

This paper focuses on the high speed Evolutionary Algorithms (EA) for the synthesis of Quantum circuits. We present a comparative study in the Evolutionary Quantum Logic Synthesis (EQLS) using different circuits representation. In EQLS, circuits are synthesized in large number while the Evolutionary Algorithm searches for a potential solution. The speed of translating the genotype (encoded binary strings) to the phenotype (circuits) depends on how fast is the creation of the circuit functional representation and how fast this representation can be evaluated to determine its function. We present the comparison between an efficient representation of the synthesized quantum circuit as Quantum Multi-Valued Decision Diagram (QMDD) and a low level parallelized evaluation method using hardware accelerated matrix manipulation. We compare the circuit representation's computation speed as well as the used computational resources on various steps of the overall design of the circuit. As it is shown in the experiments, each approach has its advantages and limitations, and an appropriate choice of each of them yields better results for a subset of the Quantum Logic synthesis (QLS) problems.

Original languageEnglish
Pages (from-to)89-120
Number of pages32
JournalJournal of Multiple-Valued Logic and Soft Computing
Volume20
Issue number1-2
Publication statusPublished - 2012

Keywords

  • Evolutionary Quantum Logic Synthesis
  • Matrix Computation Acceleration
  • Parallel GA

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Logic

Fingerprint Dive into the research topics of 'High speed genetic algorithms in quantum logic synthesis: Low level parallelization vs. representation'. Together they form a unique fingerprint.

Cite this