Sign In

Login

Password

Forgot Password ? Sign Up

نظریه پیچیدگی کوانتومی (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "نظریه پیچیدگی کوانتومی" in Persian language version.

refsWebsite
Global rank Persian rank
2doi.org
2nd place
2nd place
1google.com.au
2,205th place
607th place
1worldcat.org
5th place
12th place

doi.org

  • Aaronson, Scott (2010-06-05). BQP and the polynomial hierarchy. New York, NY, USA: ACM. doi:10.1145/1806689.1806711.
  • Shor, Peter W. (1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). 26 (5): 1484–1509. doi:10.1137/s0097539795293172. ISSN 0097-5397.

google.com.au

books.google.com.au

  • Bernhardt, C. (2019). Quantum Computing for Everyone. The MIT Press. MIT Press. p. 166-168. ISBN 978-0-262-03925-3. Retrieved 2023-01-14.

worldcat.org

  • Shor, Peter W. (1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). 26 (5): 1484–1509. doi:10.1137/s0097539795293172. ISSN 0097-5397.