Boosting Shor's Factoring Success with the Jacobi Symbol in Single-Run Order Finding against large integer numbers

- 326352
Trabalho completo (Oral)
Favoritar este trabalho
Como citar esse trabalho?
Resumo

Several works have already presented simulations of Shor's algorithm. However, the vast majority encounter limitations when applied to large integers. This is primarily because simulating the algorithm significantly demands classical hardware's memory and processing capabilities. Specifically, a substantial amount of memory is required to store the numerous states dictated by the algorithm. Shor's formulation suggests that the number of states is a power of two between N^2 and 2N^2. For instance, factoring a 2048-bit number, would require 2^4096 states. This is clearly beyond the capacity of contemporary classical computers.  This work presents a classical simulation reproducing Shor's integer-factoring algorithm capable of handling these capacity issues and generating noise-free quantum measurement outcomes. The built simulation algorithm retains the core quantum components from Shor's original work while optimizing classical post-measurement processing. This simulation enabled us to involve large integers, validate certain assumptions, and extract relevant information.

Compartilhe suas ideias ou dúvidas com os autores!

Sabia que o maior estímulo no desenvolvimento científico e cultural é a curiosidade? Deixe seus questionamentos ou sugestões para o autor!

Faça login para interagir

Tem uma dúvida ou sugestão? Compartilhe seu feedback com os autores!

Instituições
  • 1 Universidade Federal Fluminense (UFF)
  • 2 Universidade Federal do Rio de Janeiro
Eixo Temático
  • 27. SE-QPO
Palavras-chave
Number Theory
Cryptography
Quantum computing
Shor's Algorithm