Prime factorization algorithm based on parameter optimization of Ising model

This paper provides a new (second) way, which is completely different from Shor's algorithm, to show the optimistic potential of a D-Wave quantum computer for deciphering RSA and successfully factoring all integers within 10000. Our method significantly reduced the local field coefficient [Formula: see text] and coupling term coefficient [Formula: see text] by more than 33% and 26%, respectively, of those of Ising model, which can further improve the stability of qubit chains and improve the upper bound of integer factorization. In addition, our results obtained the best index (20-bit integer (1028171)) of quantum computing for deciphering RSA via the quantum computing software environment provided by D-Wave. Furthermore, Shor's algorithm requires approximately 40 qubits to factor the integer 1028171, which is far beyond the capacity of universal quantum computers. Thus, post quantum cryptography should further consider the potential of the D-Wave quantum computer for deciphering the RSA cryptosystem in future.

Medienart:

E-Artikel

Erscheinungsjahr:

2020

Erschienen:

2020

Enthalten in:

Zur Gesamtaufnahme - volume:10

Enthalten in:

Scientific reports - 10(2020), 1 vom: 28. Apr., Seite 7106

Sprache:

Englisch

Beteiligte Personen:

Wang, Baonan [VerfasserIn]
Hu, Feng [VerfasserIn]
Yao, Haonan [VerfasserIn]
Wang, Chao [VerfasserIn]

Links:

Volltext

Themen:

Journal Article

Anmerkungen:

Date Revised 28.04.2021

published: Electronic

Citation Status PubMed-not-MEDLINE

doi:

10.1038/s41598-020-62802-5

funding:

Förderinstitution / Projekttitel:

PPN (Katalog-ID):

NLM309298989