Sign In

Login

Password

Forgot Password ? Sign Up

BQP (Polish Wikipedia)

Analysis of information sources in references of the Wikipedia article "BQP" in Polish language version.

Last modified:

Ref.Un. Ref.Website
Global rank Polish rank
3112doi.org
2nd place
5th place
127arxiv.org
49th place
224th place

arxiv.org (Global: 49th place; Polish: 224th place)

  • Peter W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, „SIAM Journal on Computing”, 26 (5), 1997, s. 1484–1509, DOI: 10.1137/S0097539795293172, arXiv:quant-ph/9508027 (ang.).
  • Lance Fortnow, John Rogers, Complexity Limitations on Quantum Computation, „Journal of Computer and System Sciences”, 59 (2), 1999, s. 240–252, DOI: 10.1006/jcss.1999.1651, arXiv:cs/9811023 (ang.).
  • John Watrous, Quantum Computational Complexity, „Encyclopedia of Complexity and Systems Science”, 2009, s. 7174–7201, DOI: 10.1007/978-0-387-30440-3_428, arXiv:0804.3401 (ang.).
  • Yaoyun Shi, Both Toffoli and Controlled-NOT need little help to do universal quantum computation, „Quantum Information and Computation”, 3 (1), 2003, s. 84–92, DOI: 10.26421/qic3.1-7, arXiv:quant-ph/0205115 (ang.).
  • Scott Aaronson, Quantum computing, postselection, and probabilistic polynomial-time, „Proceedings of the Royal Society A”, 461 (2063), 2005, s. 3473–3482, DOI: 10.1098/rspa.2005.1546, arXiv:quant-ph/0412187 (ang.).
  • Scott Aaronson, BQP and the Polynomial Hierarchy, „Proceedings of the 42nd ACM Symposium on Theory of Computing”, 2010, s. 141–150, DOI: 10.1145/1806689.1806711, arXiv:0910.4698 (ang.).
  • Lov K. Grover, A fast quantum mechanical algorithm for database search, „Proceedings of the 28th Annual ACM Symposium on Theory of Computing”, 1996, s. 212–219, DOI: 10.1145/237814.237866, arXiv:quant-ph/9605043 (ang.).

doi.org (Global: 2nd place; Polish: 5th place)

  • Ethan Bernstein, Umesh Vazirani, Quantum Complexity Theory, „SIAM Journal on Computing”, 26 (5), 1997, s. 1411–1473, DOI: 10.1137/S0097539796300921 (ang.).
  • Peter W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, „SIAM Journal on Computing”, 26 (5), 1997, s. 1484–1509, DOI: 10.1137/S0097539795293172, arXiv:quant-ph/9508027 (ang.).
  • Lance Fortnow, John Rogers, Complexity Limitations on Quantum Computation, „Journal of Computer and System Sciences”, 59 (2), 1999, s. 240–252, DOI: 10.1006/jcss.1999.1651, arXiv:cs/9811023 (ang.).
  • John Watrous, Quantum Computational Complexity, „Encyclopedia of Complexity and Systems Science”, 2009, s. 7174–7201, DOI: 10.1007/978-0-387-30440-3_428, arXiv:0804.3401 (ang.).
  • Yaoyun Shi, Both Toffoli and Controlled-NOT need little help to do universal quantum computation, „Quantum Information and Computation”, 3 (1), 2003, s. 84–92, DOI: 10.26421/qic3.1-7, arXiv:quant-ph/0205115 (ang.).
  • Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang, Quantum Computability, „SIAM Journal on Computing”, 26 (5), 1997, s. 1524–1540, DOI: 10.1137/S0097539795293639 (ang.).
  • Scott Aaronson, Quantum computing, postselection, and probabilistic polynomial-time, „Proceedings of the Royal Society A”, 461 (2063), 2005, s. 3473–3482, DOI: 10.1098/rspa.2005.1546, arXiv:quant-ph/0412187 (ang.).
  • Scott Aaronson, BQP and the Polynomial Hierarchy, „Proceedings of the 42nd ACM Symposium on Theory of Computing”, 2010, s. 141–150, DOI: 10.1145/1806689.1806711, arXiv:0910.4698 (ang.).
  • Ran Raz, Avishay Tal, Oracle Separation of BQP and PH, „Journal of the ACM”, 69 (4), 2022, s. 1–21, DOI: 10.1145/3530258 (ang.).
  • Lov K. Grover, A fast quantum mechanical algorithm for database search, „Proceedings of the 28th Annual ACM Symposium on Theory of Computing”, 1996, s. 212–219, DOI: 10.1145/237814.237866, arXiv:quant-ph/9605043 (ang.).
  • Dominik Janzing, Paweł Wocjan, A Simple PromiseBQP-complete Matrix Problem, „Theory of Computing”, 3 (4), 2007, s. 61–79, DOI: 10.4086/toc.2007.v003a004 (ang.).
  • Scott Aaronson, The Limits of Quantum Computers, „Scientific American”, 298 (3), 2008, s. 62–69, DOI: 10.1038/scientificamerican0308-62 (ang.).