グローバーのアルゴリズム (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "グローバーのアルゴリズム" in Japanese language version.

refsWebsite

Global rank Japanese rank

580^th place

1,954^th place

low place

low place

1yp.to

low place

low place

459^th place

1,980^th place

69^th place

227^th place

18^th place

107^th place

2^nd place

6^th place

arxiv.org

Viamontes G.F.; Markov I.L.; Hayes J.P. (2005), “Is Quantum Search Practical?”, Computing in Science and Engineering 7 (3): 62–70, arXiv:quant-ph/0405001, Bibcode: 2005CSE.....7c..62V, doi:10.1109/mcse.2005.53

berkeley.edu

cs.berkeley.edu

Bennett C.H., Bernstein E., Brassard G., Vazirani U., The strengths and weaknesses of quantum computation. w:SIAM Journal on Computing 26(5): 1510-1523 (1997). Shows the optimality of Grover's algorithm.

doi.org

Viamontes G.F.; Markov I.L.; Hayes J.P. (2005), “Is Quantum Search Practical?”, Computing in Science and Engineering 7 (3): 62–70, arXiv:quant-ph/0405001, Bibcode: 2005CSE.....7c..62V, doi:10.1109/mcse.2005.53

harvard.edu

ui.adsabs.harvard.edu

Viamontes G.F.; Markov I.L.; Hayes J.P. (2005), “Is Quantum Search Practical?”, Computing in Science and Engineering 7 (3): 62–70, arXiv:quant-ph/0405001, Bibcode: 2005CSE.....7c..62V, doi:10.1109/mcse.2005.53

umich.edu

web.eecs.umich.edu

Viamontes G.F.; Markov I.L.; Hayes J.P. (2005), “Is Quantum Search Practical?”, Computing in Science and Engineering 7 (3): 62–70, arXiv:quant-ph/0405001, Bibcode: 2005CSE.....7c..62V, doi:10.1109/mcse.2005.53

wikipedia.org

en.wikipedia.org

Bennett C.H., Bernstein E., Brassard G., Vazirani U., The strengths and weaknesses of quantum computation. w:SIAM Journal on Computing 26(5): 1510-1523 (1997). Shows the optimality of Grover's algorithm.

yp.to

cr.yp.to

Daniel J. Bernstein (2010-03-03). Grover vs. McEliece.