Craig Gidney, Martin Ekerå: How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. In: Quantum. Band5, 23. Mai 2019, S.433, Tabellen 1 und 2, doi:10.22331/q-2021-04-15-433, arxiv:1905.09749 (englisch).
Peter W. Shor: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. In: SIAM Journal on Computing. 26/1997, S. 1484–1509, arxiv:quant-ph/9508027
doi.org
Craig Gidney, Martin Ekerå: How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. In: Quantum. Band5, 23. Mai 2019, S.433, Tabellen 1 und 2, doi:10.22331/q-2021-04-15-433, arxiv:1905.09749 (englisch).
Lieven Vandersypen, Matthias Steffen, Gregory Breyta, Costantino S. Yannoni, Mark H. Sherwood und Isaac L. Chuang: Experimental realization of an order-finding algorithm with an NMR quantum computer. In: Nature. 414/2001, S. 883–887, doi:10.1038/414883a
