Quantum computing represents a substantial threat to contemporary cryptographic systems, primarily due to the vulnerabilities introduced by quantum algorithms such as Shor’s algorithm, Deutsch’s algorithm, and Grover’s algorithm. In this study, advanced quantum computing frameworks, including Curl, PennyLane, and Qiskit, were selected to model these algorithms and to facilitate a comprehensive comparative analysis. A generalization scheme for quantum computing and its limitations are discussed. The pseudo-codes of the principal algorithms and their implications for cryptography are presented in detail. An empirical evaluation of time and memory consumption demonstrates that the Qiskit library exhibits superior performance in the implementation of the three aforementioned algorithms, requiring fewer lines of code, reduced execution time, and lower memory usage. This work offers insights into the efficiency of quantum computing algorithms and frameworks and highlights the broader impact of advances in quantum computing on traditional cryptographic paradigms.
Babenko et al. (Mon,) studied this question.