{"title":"Circuit level implementation of the Reduced Quantum Genetic Algorithm using Qiskit","authors":"Sebastian Mihai Ardelean, M. Udrescu","doi":"10.1109/SACI55618.2022.9919519","DOIUrl":null,"url":null,"abstract":"Genetic Algorithm (GA) are common probabilistic optimization methods inspired by the process of natural selection. Quantum computers promise substantial speedups over conventional machines, and libraries allow the emulation of circuits on a quantum computer in different highly configurable noise models and even run on quantum computers. Therefore, we need to analyze this class of heuristic methods in the quantum context. We propose a circuit level implementation of the Reduced Quantum Genetic Algorithm (RQGA) using Python and Qiskit. Our main goal is to analyze the circuit complexity from the perspectives of the number of qubits required and the number of quantum gates used. To achieve our goal, we instantiate the framework for solving the knapsack problem, examine the results in a simulated environment, and analyze the circuit's complexity.","PeriodicalId":105691,"journal":{"name":"2022 IEEE 16th International Symposium on Applied Computational Intelligence and Informatics (SACI)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 16th International Symposium on Applied Computational Intelligence and Informatics (SACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SACI55618.2022.9919519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Genetic Algorithm (GA) are common probabilistic optimization methods inspired by the process of natural selection. Quantum computers promise substantial speedups over conventional machines, and libraries allow the emulation of circuits on a quantum computer in different highly configurable noise models and even run on quantum computers. Therefore, we need to analyze this class of heuristic methods in the quantum context. We propose a circuit level implementation of the Reduced Quantum Genetic Algorithm (RQGA) using Python and Qiskit. Our main goal is to analyze the circuit complexity from the perspectives of the number of qubits required and the number of quantum gates used. To achieve our goal, we instantiate the framework for solving the knapsack problem, examine the results in a simulated environment, and analyze the circuit's complexity.