✦ LIBER ✦

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

✍ Scribed by Shor, Peter W.

Book ID: 118016130
Publisher: Society for Industrial and Applied Mathematics
Year: 1999
Tongue: English
Weight: 430 KB
Volume: 41
Category: Article
ISSN: 0036-1445
DOI: 10.1137/s0036144598347011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial time algorithm for finding

A polynomial time algorithm for finding the prime factors of cartesian-product graphs

✍ Joan Feigenbaum; John Hershberger; Alejandro A. Schäffer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 772 KB

A VLSI chip for the winograd/Prime facto

A VLSI chip for the winograd/Prime factor algorithm to compute the discrete Fourier transform

✍ Owens, R.; Ja'Ja', J. 📂 Article 📅 1986 🏛 IEEE ⚖ 969 KB

Input and output index mappings for a pr

Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform

✍ Byeong G Lee 📂 Article 📅 1989 🏛 IEEE ⚖ 712 KB

Nearly Logarithmic-Time Parallel Algorit

Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2b ASCEND Computations on a SIMD Hypercube

✍ D. Nassimi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 979 KB

[IEEE Comput. Soc. Press 35th Annual Sym

[IEEE Comput. Soc. Press 35th Annual Symposium on Foundations of Computer Science - Santa Fe, NM, USA (20-22 Nov. 1994)] Proceedings 35th Annual Symposium on Foundations of Computer Science - Algorithms for quantum computation: discrete logarithms and factoring

✍ Shor, P.W. 📂 Article 📅 1994 🏛 IEEE Comput. Soc. Press ⚖ 945 KB

Framework for discrete-time quantum walk

Framework for discrete-time quantum walks and a symmetric walk on a binary tree

✍ Dimcovic, Zlatko; Rockwell, Daniel; Milligan, Ian; Burton, Robert; Nguyen, Thinh 📂 Article 📅 2011 🏛 The American Physical Society 🌐 English ⚖ 472 KB