Evolutionary approach to quantum symbolic logic synthesis

Martin Lukac, Marek Perkowski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In this paper we present an evolutionary approach to the quantum symbolic logic synthesis that was introduced in [1]. We use a Genetic Algorithm to synthesize quantum circuits from examples, allowing to synthesize functions that are both completely and incompletely specified. The symbolic synthesis is implemented in the GA so as to verify our approach. The Occam Razor principle, fundamental to inductive learning as well as to logic synthesis, is satisfied in this approach by seeking circuits of reduced complexity. The GA is tested on a set of benchmark functions representing single output quantum circuits as well as multiple entangled-qubit state generators.

Original languageEnglish
Title of host publication2008 IEEE Congress on Evolutionary Computation, CEC 2008
Pages3374-3380
Number of pages7
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 IEEE Congress on Evolutionary Computation, CEC 2008 - Hong Kong, China
Duration: Jun 1 2008Jun 6 2008

Other

Other2008 IEEE Congress on Evolutionary Computation, CEC 2008
CountryChina
CityHong Kong
Period6/1/086/6/08

Fingerprint

Logic Synthesis
Quantum Circuits
Inductive Learning
Networks (circuits)
Qubit
Genetic Algorithm
Generator
Synthesis
Benchmark
Verify
Output
Genetic algorithms
Gas

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Lukac, M., & Perkowski, M. (2008). Evolutionary approach to quantum symbolic logic synthesis. In 2008 IEEE Congress on Evolutionary Computation, CEC 2008 (pp. 3374-3380). [4631254] https://doi.org/10.1109/CEC.2008.4631254

Evolutionary approach to quantum symbolic logic synthesis. / Lukac, Martin; Perkowski, Marek.

2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. p. 3374-3380 4631254.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lukac, M & Perkowski, M 2008, Evolutionary approach to quantum symbolic logic synthesis. in 2008 IEEE Congress on Evolutionary Computation, CEC 2008., 4631254, pp. 3374-3380, 2008 IEEE Congress on Evolutionary Computation, CEC 2008, Hong Kong, China, 6/1/08. https://doi.org/10.1109/CEC.2008.4631254
Lukac M, Perkowski M. Evolutionary approach to quantum symbolic logic synthesis. In 2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. p. 3374-3380. 4631254 https://doi.org/10.1109/CEC.2008.4631254
Lukac, Martin ; Perkowski, Marek. / Evolutionary approach to quantum symbolic logic synthesis. 2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. pp. 3374-3380
@inproceedings{e7da11dc88304f98a29df45385e21ef7,
title = "Evolutionary approach to quantum symbolic logic synthesis",
abstract = "In this paper we present an evolutionary approach to the quantum symbolic logic synthesis that was introduced in [1]. We use a Genetic Algorithm to synthesize quantum circuits from examples, allowing to synthesize functions that are both completely and incompletely specified. The symbolic synthesis is implemented in the GA so as to verify our approach. The Occam Razor principle, fundamental to inductive learning as well as to logic synthesis, is satisfied in this approach by seeking circuits of reduced complexity. The GA is tested on a set of benchmark functions representing single output quantum circuits as well as multiple entangled-qubit state generators.",
author = "Martin Lukac and Marek Perkowski",
year = "2008",
doi = "10.1109/CEC.2008.4631254",
language = "English",
isbn = "9781424418237",
pages = "3374--3380",
booktitle = "2008 IEEE Congress on Evolutionary Computation, CEC 2008",

}

TY - GEN

T1 - Evolutionary approach to quantum symbolic logic synthesis

AU - Lukac, Martin

AU - Perkowski, Marek

PY - 2008

Y1 - 2008

N2 - In this paper we present an evolutionary approach to the quantum symbolic logic synthesis that was introduced in [1]. We use a Genetic Algorithm to synthesize quantum circuits from examples, allowing to synthesize functions that are both completely and incompletely specified. The symbolic synthesis is implemented in the GA so as to verify our approach. The Occam Razor principle, fundamental to inductive learning as well as to logic synthesis, is satisfied in this approach by seeking circuits of reduced complexity. The GA is tested on a set of benchmark functions representing single output quantum circuits as well as multiple entangled-qubit state generators.

AB - In this paper we present an evolutionary approach to the quantum symbolic logic synthesis that was introduced in [1]. We use a Genetic Algorithm to synthesize quantum circuits from examples, allowing to synthesize functions that are both completely and incompletely specified. The symbolic synthesis is implemented in the GA so as to verify our approach. The Occam Razor principle, fundamental to inductive learning as well as to logic synthesis, is satisfied in this approach by seeking circuits of reduced complexity. The GA is tested on a set of benchmark functions representing single output quantum circuits as well as multiple entangled-qubit state generators.

UR - http://www.scopus.com/inward/record.url?scp=55849099287&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=55849099287&partnerID=8YFLogxK

U2 - 10.1109/CEC.2008.4631254

DO - 10.1109/CEC.2008.4631254

M3 - Conference contribution

SN - 9781424418237

SP - 3374

EP - 3380

BT - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

ER -