iSOMA swarm intelligence algorithm in synthesis of quantum computing circuits
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F23%3A10252703" target="_blank" >RIV/61989100:27240/23:10252703 - isvavai.cz</a>
Nalezeny alternativní kódy
RIV/61989100:27740/23:10252703
Výsledek na webu
<a href="https://www.sciencedirect.com/science/article/pii/S156849462300368X" target="_blank" >https://www.sciencedirect.com/science/article/pii/S156849462300368X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.asoc.2023.110350" target="_blank" >10.1016/j.asoc.2023.110350</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
iSOMA swarm intelligence algorithm in synthesis of quantum computing circuits
Popis výsledku v původním jazyce
In the present paper, we demonstrate the possibilities of designing quantum computing circuits using a specific swarm intelligence algorithm - iSOMA in the form of three experiments. All simulations are based on a simple sample of a quantum computing circuit from the Qiskit environment, which was used as a comparison circuit with the results of the three experiments already mentioned. In the first experiment, we try to find an arbitrary functional solution using iSOMA with minimal constraints on this circuit's design. It can be said that in this experiment, iSOMA showed the highest degree of "creativity". In the second experiment, we focused on whether iSOMA can be used to find a circuit identical to the one designed by a human or equivalent with the positions of the measurement gates fixed. In the last experiment, we highlight iSOMA's ability to avoid unnecessary qubit usage by adding redundant qubits to a possible circuit and fixing the measurement gates to the last two qubits in the scheme. In all three experiments, we see that iSOMA can find efficient functional and often astonishing solutions - the proposed method applied to a classical circuit founded a new one preserving required properties while saving one ancilla (redundant, useless, non-used)1 qubit. All computations are implemented in the IBM Qiskit2 environment. Although these are relatively simple experiments, the results show that evolutionary algorithms can successfully design more complex quantum circuits. (C) 2023 The Authors
Název v anglickém jazyce
iSOMA swarm intelligence algorithm in synthesis of quantum computing circuits
Popis výsledku anglicky
In the present paper, we demonstrate the possibilities of designing quantum computing circuits using a specific swarm intelligence algorithm - iSOMA in the form of three experiments. All simulations are based on a simple sample of a quantum computing circuit from the Qiskit environment, which was used as a comparison circuit with the results of the three experiments already mentioned. In the first experiment, we try to find an arbitrary functional solution using iSOMA with minimal constraints on this circuit's design. It can be said that in this experiment, iSOMA showed the highest degree of "creativity". In the second experiment, we focused on whether iSOMA can be used to find a circuit identical to the one designed by a human or equivalent with the positions of the measurement gates fixed. In the last experiment, we highlight iSOMA's ability to avoid unnecessary qubit usage by adding redundant qubits to a possible circuit and fixing the measurement gates to the last two qubits in the scheme. In all three experiments, we see that iSOMA can find efficient functional and often astonishing solutions - the proposed method applied to a classical circuit founded a new one preserving required properties while saving one ancilla (redundant, useless, non-used)1 qubit. All computations are implemented in the IBM Qiskit2 environment. Although these are relatively simple experiments, the results show that evolutionary algorithms can successfully design more complex quantum circuits. (C) 2023 The Authors
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10200 - Computer and information sciences
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2023
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Applied Soft Computing
ISSN
1568-4946
e-ISSN
—
Svazek periodika
142
Číslo periodika v rámci svazku
July
Stát vydavatele periodika
US - Spojené státy americké
Počet stran výsledku
12
Strana od-do
—
Kód UT WoS článku
001053207300001
EID výsledku v databázi Scopus
2-s2.0-85158874300