On the Various Ways of Quantum Implementation of the Modular Exponentiation Function for Shor's Factorization
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F24%3A10254151" target="_blank" >RIV/61989100:27740/24:10254151 - isvavai.cz</a>
Výsledek na webu
<a href="https://link.springer.com/article/10.1007/s10773-023-05532-4" target="_blank" >https://link.springer.com/article/10.1007/s10773-023-05532-4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10773-023-05532-4" target="_blank" >10.1007/s10773-023-05532-4</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
On the Various Ways of Quantum Implementation of the Modular Exponentiation Function for Shor's Factorization
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
On the Various Ways of Quantum Implementation of the Modular Exponentiation Function for Shor's Factorization
Popis výsledku anglicky
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.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
—
Ostatní
Rok uplatnění
2024
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
International Journal of Theoretical Physics
ISSN
0020-7748
e-ISSN
1572-9575
Svazek periodika
63
Číslo periodika v rámci svazku
1
Stát vydavatele periodika
US - Spojené státy americké
Počet stran výsledku
12
Strana od-do
—
Kód UT WoS článku
001138342300001
EID výsledku v databázi Scopus
2-s2.0-85181961243