Hidden subgroup problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hidden subgroup problem" in English language version.

refsWebsite

Global rank English rank

69^th place

59^th place

18^th place

17^th place

2^nd place

2^nd place

1semanticscholar.org

11^th place

8^th place

arxiv.org

Mark Ettinger; Peter Høyer (1999). "A quantum observable for the graph isomorphism problem". arXiv:quant-ph/9901029.
Oded Regev (2003). "Quantum computation and lattice problems". arXiv:cs/0304005.
Mark Ettinger; Peter Hoyer; Emanuel Knill (2004). "The quantum query complexity of the hidden subgroup problem is polynomial". Information Processing Letters. 91: 43–48. arXiv:quant-ph/0401083. Bibcode:2004quant.ph..1083E. doi:10.1016/j.ipl.2004.01.024. S2CID 5520617.
Kitaev, Alexei (November 20, 1995). "Quantum measurements and the Abelian Stabilizer Problem". arXiv:quant-ph/9511026.

doi.org

Mark Ettinger; Peter Hoyer; Emanuel Knill (2004). "The quantum query complexity of the hidden subgroup problem is polynomial". Information Processing Letters. 91: 43–48. arXiv:quant-ph/0401083. Bibcode:2004quant.ph..1083E. doi:10.1016/j.ipl.2004.01.024. S2CID 5520617.

harvard.edu

ui.adsabs.harvard.edu

Mark Ettinger; Peter Hoyer; Emanuel Knill (2004). "The quantum query complexity of the hidden subgroup problem is polynomial". Information Processing Letters. 91: 43–48. arXiv:quant-ph/0401083. Bibcode:2004quant.ph..1083E. doi:10.1016/j.ipl.2004.01.024. S2CID 5520617.

semanticscholar.org

api.semanticscholar.org

Mark Ettinger; Peter Hoyer; Emanuel Knill (2004). "The quantum query complexity of the hidden subgroup problem is polynomial". Information Processing Letters. 91: 43–48. arXiv:quant-ph/0401083. Bibcode:2004quant.ph..1083E. doi:10.1016/j.ipl.2004.01.024. S2CID 5520617.