iSOMA swarm intelligence algorithm in synthesis of quantum computing circuits

Zelinka, Ivan; Kojecký, Lumír; Lampart, Marek; Windsor, Leah C.; Plucar, Jan

doi:10.1016/j.asoc.2023.110350

Cited by 6 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Zelinka et al used SOMA [81] for the design of quantum computing circuits for future quantum computers.…”

Section: Soma Philosophymentioning

confidence: 99%

Survey of Recent Applications of the Chaotic Lozi Map

Lozi

2023

Algorithms

View full text Add to dashboard Cite

Since its original publication in 1978, Lozi’s chaotic map has been thoroughly explored and continues to be. Hundreds of publications have analyzed its particular structure and applied its properties in many fields (e.g., improvement of physical devices, electrical components such as memristors, cryptography, optimization, evolutionary algorithms, synchronization, control, secure communications, AI with swarm intelligence, chimeras, solitary states, etc.) through algorithms such as the COLM algorithm (Chaotic Optimization algorithm based on Lozi Map), Particle Swarm Optimization (PSO), and Differential Evolution (DE). In this article, we present a survey based on dozens of articles on the use of this map in algorithms aimed at real applications or applications exploring new directions of dynamical systems such as chimeras and solitary states.

show abstract

“…Recently, Zelinka et al used SOMA [81] for the design of quantum computing circuits for future quantum computers.…”

Section: Soma Philosophymentioning

confidence: 99%

Survey of Recent Applications of the Chaotic Lozi Map

Lozi

2023

Algorithms

View full text Add to dashboard Cite

show abstract

On the Various Ways of Quantum Implementation of the Modular Exponentiation Function for Shor’s Factorization

Tomčala

2024

Int J Theor Phys

View full text Add to dashboard Cite

The content of this paper is a detailed analysis of possible ways how to quantum implement a key part of Shor’s factorization algorithm, the modular exponentiation function. This implementation is a bottleneck for performing quantum factorization with polynomial complexity, which would make it possible to factorize really large numbers in a reasonable amount of time. In this paper, not only the general theory is presented, but also the results of successful factorizations of the numbers 247 and 143 using Shor’s algorithm from a quantum computer simulator. An interesting fact is that no ancillary qubits were needed in these factorizations. Based on the content of the paper, the conclusion also suggests possible future work on the development of this modular exponentiation function implementation.

show abstract