Breaking RSA Security With A Low Noise D-Wave 2000Q Quantum Annealer: Computational Times, Limitations And Prospects

05/05/2020
by   Riccardo Mengoni, et al.
0

The RSA cryptosystem could be easily broken with large scale general purpose quantum computers running Shor's factorization algorithm. Being such devices still in their infancy, a quantum annealing approach to integer factorization has recently gained attention. In this work, we analyzed the most promising strategies for RSA hacking via quantum annealing with an extensive study of the low noise D-Wave 2000Q computational times, current hardware limitations and challenges for future developments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2021

Single-Qubit Fidelity Assessment of Quantum Annealing Hardware

As a wide variety of quantum computing platforms become available, metho...
research
10/24/2022

Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer

Factorization Machine (FM) is the most commonly used model to build a re...
research
01/22/2019

Pegasus: The second connectivity graph for large-scale quantum annealing hardware

Pegasus is a graph which offers substantially increased connectivity bet...
research
04/30/2023

Efficient MILP Decomposition in Quantum Computing for ReLU Network Robustness

Emerging quantum computing technologies, such as Noisy Intermediate-Scal...
research
04/05/2017

Nonnegative/binary matrix factorization with a D-Wave quantum annealer

D-Wave quantum annealers represent a novel computational architecture an...
research
10/05/2021

Lossy compression of statistical data using quantum annealer

We present a new lossy compression algorithm for statistical floating-po...
research
05/09/2023

A Scalable Evaluation of Integer Factorization Performance on IBM Quantum Simulator

With the development of quantum technologies, the performance of quantum...

Please sign up or login with your details

Forgot password? Click here to reset