秀爾演算法 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "秀爾演算法" in Chinese language version.

refsWebsite

Global rank Chinese rank

7doi.org

2^nd place

23^rd place

3arxiv.org

69^th place

254^th place

arxiv.org (Global: 69^th place; Chinese: 254^th place)

Shor 1999，第14頁. Shor, Peter W., Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM J.Sci.Statist.Comput., 1999, 41 (2): 303–332, doi:10.1137/S0036144598347011, arXiv:quant-ph/9508027v2 . Revised version of the original paper by Peter Shor ("28 pages, LaTeX. This is an expanded version of a paper that appeared in the Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov. 20--22, 1994. Minor revisions made January, 1996").
Markov, Igor L.; Saeedi, Mehdi, Constant-Optimized Quantum Circuits for Modular Multiplication and Exponentiation, 2015-04-02 [2025-04-12], doi:10.48550/arXiv.1202.6614
Markov, Igor L.; Saeedi, Mehdi, Faster Quantum Number Factoring via Circuit Synthesis, 2013-01-15 [2025-04-12], doi:10.48550/arXiv.1301.3210

doi.org (Global: 2^nd place; Chinese: 23^rd place)

Vandersypen, Lieven M. K.; Steffen, Matthias; Breyta, Gregory; Yannoni, Costantino S.; Sherwood, Mark H. & Chuang, Isaac L., Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance, Nature, 2001, 414 (6866): 883–887, doi:10.1038/414883a .
Braunstein, S. L.; Caves, C. M.; Jozsa, R.; Linden, N.; Popescu, S.; Schack, R., Separability of Very Noisy Mixed States and Implications for NMR Quantum Computing, Phys. Rev. Lett, 1999, 83 (5): 1054–1057, doi:10.1103/PhysRevLett.83.1054
Lu, Chao-Yang; Browne, Daniel E.; Yang, Tao & Pan, Jian-Wei, Demonstration of a Compiled Version of Shor's Quantum Factoring Algorithm Using Photonic Qubits, Physical Review Letters, 2007, 99 (25): 250504, doi:10.1103/PhysRevLett.99.250504
Lanyon, B. P.; Weinhold, T. J.; Langford, N. K.; Barbieri, M.; James, D. F. V.; Gilchrist, A. & White, A. G., Experimental Demonstration of a Compiled Version ofshor's algorithm with quantum Entanglement, Physical Review Letters, 2007, 99 (25): 250505, doi:10.1103/PhysRevLett.99.250505
Shor 1999，第14頁. Shor, Peter W., Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM J.Sci.Statist.Comput., 1999, 41 (2): 303–332, doi:10.1137/S0036144598347011, arXiv:quant-ph/9508027v2 . Revised version of the original paper by Peter Shor ("28 pages, LaTeX. This is an expanded version of a paper that appeared in the Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov. 20--22, 1994. Minor revisions made January, 1996").
Markov, Igor L.; Saeedi, Mehdi, Constant-Optimized Quantum Circuits for Modular Multiplication and Exponentiation, 2015-04-02 [2025-04-12], doi:10.48550/arXiv.1202.6614
Markov, Igor L.; Saeedi, Mehdi, Faster Quantum Number Factoring via Circuit Synthesis, 2013-01-15 [2025-04-12], doi:10.48550/arXiv.1301.3210

秀爾演算法 (Chinese Wikipedia)

arxiv.org (Global: 69th place; Chinese: 254th place)

doi.org (Global: 2nd place; Chinese: 23rd place)

arxiv.org (Global: 69^th place; Chinese: 254^th place)

doi.org (Global: 2^nd place; Chinese: 23^rd place)