Shori algoritm (Estonian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Shori algoritm" in Estonian language version.

refsWebsite

Global rank Estonian rank

8doi.org

2^nd place

16^th place

6worldcat.org

5^th place

76^th place

3springer.com

274^th place

191^st place

1siam.org

low place

1quantum-journal.org

low place

1wikipedia.org

low place

1aps.org

1,503^rd place

566^th place

1projecteuclid.org

3,707^th place

low place

1wolfram.com

513^th place

942^nd place

1nature.com

234^th place

88^th place

aps.org (Global: 1,503^rd place; Estonian: 566^th place)

link.aps.org

Beckman, David; Chari, Amalavoyal N.; Devabhaktuni, Srikrishna; Preskill, John (1. august 1996). "Efficient networks for quantum factoring". Physical Review A (inglise). 54 (2): 1034–1063. DOI:10.1103/PhysRevA.54.1034. ISSN 1050-2947.

doi.org (Global: 2^nd place; Estonian: 16^th place)

Shor, Peter W. (10. oktoober 1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing (inglise). 26 (5): 1484–1509. DOI:10.1137/S0097539795293172. ISSN 0097-5397.
Gidney, Craig; Ekerå, Martin (15. aprill 2021). "How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits". Quantum (inglise). 5: 433. DOI:10.22331/q-2021-04-15-433. ISSN 2521-327X.
Cai, Jin-Yi (juuli 2024). "Shor's algorithm does not factor large integers in the presence of noise". Science China Information Sciences (inglise). 67 (7). DOI:10.1007/s11432-023-3961-3. ISSN 1674-733X.
Beckman, David; Chari, Amalavoyal N.; Devabhaktuni, Srikrishna; Preskill, John (1. august 1996). "Efficient networks for quantum factoring". Physical Review A (inglise). 54 (2): 1034–1063. DOI:10.1103/PhysRevA.54.1034. ISSN 1050-2947.
Harvey, David; van der Hoeven, Joris (1. märts 2021). "Integer multiplication in time $O(n\mathrm{log}\, n)$". Annals of Mathematics. 193 (2). DOI:10.4007/annals.2021.193.2.4. ISSN 0003-486X.
Roetteler, Martin; Naehrig, Michael; Svore, Krysta M.; Lauter, Kristin (2017), Takagi, Tsuyoshi; Peyrin, Thomas (toim-d), "Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms", Advances in Cryptology – ASIACRYPT 2017 (inglise), Cham: Springer International Publishing, kd 10625, lk 241–270, DOI:10.1007/978-3-319-70697-9_9, ISBN 978-3-319-70696-2, vaadatud 25. oktoobril 2024
Vandersypen, Lieven M. K.; Steffen, Matthias; Breyta, Gregory; Yannoni, Costantino S.; Sherwood, Mark H.; Chuang, Isaac L. (detsember 2001). "Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance". Nature (inglise). 414 (6866): 883–887. DOI:10.1038/414883a. ISSN 0028-0836.
Bernstein, Daniel J.; Heninger, Nadia; Lou, Paul; Valenta, Luke (2017), Lange, Tanja; Takagi, Tsuyoshi (toim-d), "Post-quantum RSA", Post-Quantum Cryptography (inglise), Cham: Springer International Publishing, kd 10346, lk 311–329, DOI:10.1007/978-3-319-59879-6_18, ISBN 978-3-319-59878-9, vaadatud 24. oktoobril 2024

nature.com (Global: 234^th place; Estonian: 88^th place)

Vandersypen, Lieven M. K.; Steffen, Matthias; Breyta, Gregory; Yannoni, Costantino S.; Sherwood, Mark H.; Chuang, Isaac L. (detsember 2001). "Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance". Nature (inglise). 414 (6866): 883–887. DOI:10.1038/414883a. ISSN 0028-0836.

projecteuclid.org (Global: 3,707^th place; Estonian: low place)

Harvey, David; van der Hoeven, Joris (1. märts 2021). "Integer multiplication in time $O(n\mathrm{log}\, n)$". Annals of Mathematics. 193 (2). DOI:10.4007/annals.2021.193.2.4. ISSN 0003-486X.

quantum-journal.org (Global: low place; Estonian: low place)

Gidney, Craig; Ekerå, Martin (15. aprill 2021). "How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits". Quantum (inglise). 5: 433. DOI:10.22331/q-2021-04-15-433. ISSN 2521-327X.

siam.org (Global: low place; Estonian: low place)

epubs.siam.org

Shor, Peter W. (10. oktoober 1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing (inglise). 26 (5): 1484–1509. DOI:10.1137/S0097539795293172. ISSN 0097-5397.

springer.com (Global: 274^th place; Estonian: 191^st place)

link.springer.com

Cai, Jin-Yi (juuli 2024). "Shor's algorithm does not factor large integers in the presence of noise". Science China Information Sciences (inglise). 67 (7). DOI:10.1007/s11432-023-3961-3. ISSN 1674-733X.
Roetteler, Martin; Naehrig, Michael; Svore, Krysta M.; Lauter, Kristin (2017), Takagi, Tsuyoshi; Peyrin, Thomas (toim-d), "Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms", Advances in Cryptology – ASIACRYPT 2017 (inglise), Cham: Springer International Publishing, kd 10625, lk 241–270, DOI:10.1007/978-3-319-70697-9_9, ISBN 978-3-319-70696-2, vaadatud 25. oktoobril 2024
Bernstein, Daniel J.; Heninger, Nadia; Lou, Paul; Valenta, Luke (2017), Lange, Tanja; Takagi, Tsuyoshi (toim-d), "Post-quantum RSA", Post-Quantum Cryptography (inglise), Cham: Springer International Publishing, kd 10346, lk 311–329, DOI:10.1007/978-3-319-59879-6_18, ISBN 978-3-319-59878-9, vaadatud 24. oktoobril 2024

wikipedia.org (Global: low place; Estonian: low place)

en.wikipedia.org

"Pseudo-polynomial time", Wikipedia (inglise), 4. detsember 2023, vaadatud 24. oktoobril 2024

wolfram.com (Global: 513^th place; Estonian: 942^nd place)

mathworld.wolfram.com

Weisstein, Eric W. "Number Field Sieve". mathworld.wolfram.com (inglise). Vaadatud 25. oktoobril 2024.

worldcat.org (Global: 5^th place; Estonian: 76^th place)

Shor, Peter W. (10. oktoober 1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing (inglise). 26 (5): 1484–1509. DOI:10.1137/S0097539795293172. ISSN 0097-5397.
Gidney, Craig; Ekerå, Martin (15. aprill 2021). "How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits". Quantum (inglise). 5: 433. DOI:10.22331/q-2021-04-15-433. ISSN 2521-327X.
Cai, Jin-Yi (juuli 2024). "Shor's algorithm does not factor large integers in the presence of noise". Science China Information Sciences (inglise). 67 (7). DOI:10.1007/s11432-023-3961-3. ISSN 1674-733X.
Beckman, David; Chari, Amalavoyal N.; Devabhaktuni, Srikrishna; Preskill, John (1. august 1996). "Efficient networks for quantum factoring". Physical Review A (inglise). 54 (2): 1034–1063. DOI:10.1103/PhysRevA.54.1034. ISSN 1050-2947.
Harvey, David; van der Hoeven, Joris (1. märts 2021). "Integer multiplication in time $O(n\mathrm{log}\, n)$". Annals of Mathematics. 193 (2). DOI:10.4007/annals.2021.193.2.4. ISSN 0003-486X.
Vandersypen, Lieven M. K.; Steffen, Matthias; Breyta, Gregory; Yannoni, Costantino S.; Sherwood, Mark H.; Chuang, Isaac L. (detsember 2001). "Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance". Nature (inglise). 414 (6866): 883–887. DOI:10.1038/414883a. ISSN 0028-0836.

Shori algoritm (Estonian Wikipedia)

aps.org (Global: 1,503rd place; Estonian: 566th place)

link.aps.org

doi.org (Global: 2nd place; Estonian: 16th place)

nature.com (Global: 234th place; Estonian: 88th place)

projecteuclid.org (Global: 3,707th place; Estonian: low place)

quantum-journal.org (Global: low place; Estonian: low place)

siam.org (Global: low place; Estonian: low place)

epubs.siam.org

springer.com (Global: 274th place; Estonian: 191st place)

link.springer.com

wikipedia.org (Global: low place; Estonian: low place)

en.wikipedia.org

wolfram.com (Global: 513th place; Estonian: 942nd place)

mathworld.wolfram.com

worldcat.org (Global: 5th place; Estonian: 76th place)

aps.org (Global: 1,503^rd place; Estonian: 566^th place)

doi.org (Global: 2^nd place; Estonian: 16^th place)

nature.com (Global: 234^th place; Estonian: 88^th place)

projecteuclid.org (Global: 3,707^th place; Estonian: low place)

springer.com (Global: 274^th place; Estonian: 191^st place)

wolfram.com (Global: 513^th place; Estonian: 942^nd place)

worldcat.org (Global: 5^th place; Estonian: 76^th place)