Szczegóły publikacji
Opis bibliograficzny
Implementation and analysis of Regev’s quantum factorization algorithm / Przemysław Pawlitko, Natalia Moćko, Marcin NIEMIEC, Piotr CHOŁDA // Quantum Information & Computation ; ISSN 1533-7146 . — 2026 — vol. 26 iss. 1, s. 230–252. — Bibliogr. s. 251–252, Abstr. — Publikacja dostępna online od: 2026-06-04
Autorzy (4)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 168448 |
|---|---|
| Data dodania do BaDAP | 2026-06-29 |
| Tekst źródłowy | URL |
| DOI | 10.2478/qic-2026-0012 |
| Rok publikacji | 2026 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Quantum Information & Computation |
Abstract
Quantum computing represents a significant advancement in computational capabilities. Of particular concern is its impact on asymmetric cryptography through, notably, Shor's algorithm and the more recently developed Regev's algorithm for factoring composite numbers. We present our implementation of the latter with the aim of exposing experimental phenomena. Our analysis encompasses both quantum simulation results and classical component examples, with particular emphasis on comparative cases between Regev's and Shor's algorithms. Our experimental results reveal that Regev's algorithm outperforms Shor's algorithm for certain composite numbers in practice. However, we observed significant performance variations across different input values. Despite Regev's algorithm's theoretical asymptotic advantage in effectiveness, our implementation exhibited longer execution times than Shor's algorithm for small-integer factorization in both quantum and classical components. These findings offer insights into the practical challenges and perfor.
