Work

Fast versions of Shor's quantum factoring algorithm

Year: 1998

Type: preprint

Abstract: We present fast and highly parallelized versions of Shor's algorithm. With a sizable quantum computer it would then be possible to factor numbers with millions of digits. The main algorithm presented here uses FFT-based fast integer multiplication. The quick reader can just read the introduction and the ``Results'' section.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.quant-ph/9806084

Author: Zalka, Christof

Institution: Los Alamos National Laboratory

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Japan Society for the Promotion of Science

Award: Security Analysis of Post-quantum Public Key Cryptography by Utilizing Quantum Algorithms

OpenAlex ID: W2593569272

Cites: 5

Cited by: 72

Related to: 10