Algorytm Deutscha-Jozsy (Polish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Algorytm Deutscha-Jozsy" in Polish language version.

refsWebsite

Global rank Polish rank

2^nd place

6^th place

18^th place

140^th place

69^th place

224^th place

1^st place

5,567^th place

low place

low place

207^th place

1,169^th place

arxiv.org

R. Cleve, A. Ekert, C. Macchiavello, M. Mosca. Quantum algorithms revisited. „Proceedings of the Royal Society of London A”. 454, s. 339–354, 1998. DOI: 10.1098/rspa.1998.0164. arXiv:quant-ph/9708016. Bibcode: 1998RSPSA.454..339C.
A fast quantum mechanical algorithm for database search, [w:] Lov K.L.K. Grover Lov K.L.K., Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 1996, s. 212–219, DOI: 10.1145/237814.237866, ISBN 0-89791-785-5, arXiv:quant-ph/9605043 .

David Deutsch and Richard Jozsa. Rapid solutions of problems by quantum computation. „Proceedings of the Royal Society of London A”. 439, s. 553, 1992. DOI: 10.1098/rspa.1992.0167. Bibcode: 1992RSPSA.439..553D.
R. Cleve, A. Ekert, C. Macchiavello, M. Mosca. Quantum algorithms revisited. „Proceedings of the Royal Society of London A”. 454, s. 339–354, 1998. DOI: 10.1098/rspa.1998.0164. arXiv:quant-ph/9708016. Bibcode: 1998RSPSA.454..339C.
David Deutsch. The Church-Turing principle and the universal quantum computer. „Proceedings of the Royal Society of London A”. 400, s. 97, 1985. DOI: 10.1098/rspa.1985.0070. Bibcode: 1985RSPSA.400...97D.
Algorithms for quantum computation: discrete logarithms and factoring. W: Peter W. Shor: Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. 1994, s. 124–134. DOI: 10.1109/SFCS.1994.365700.

A fast quantum mechanical algorithm for database search, [w:] Lov K.L.K. Grover Lov K.L.K., Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 1996, s. 212–219, DOI: 10.1145/237814.237866, ISBN 0-89791-785-5, arXiv:quant-ph/9605043 .

Certainty from Uncertainty. fortunecity.com. [zarchiwizowane z tego adresu (2001-11-24)]..

David Deutsch and Richard Jozsa. Rapid solutions of problems by quantum computation. „Proceedings of the Royal Society of London A”. 439, s. 553, 1992. DOI: 10.1098/rspa.1992.0167. Bibcode: 1992RSPSA.439..553D.
R. Cleve, A. Ekert, C. Macchiavello, M. Mosca. Quantum algorithms revisited. „Proceedings of the Royal Society of London A”. 454, s. 339–354, 1998. DOI: 10.1098/rspa.1998.0164. arXiv:quant-ph/9708016. Bibcode: 1998RSPSA.454..339C.
David Deutsch. The Church-Turing principle and the universal quantum computer. „Proceedings of the Royal Society of London A”. 400, s. 97, 1985. DOI: 10.1098/rspa.1985.0070. Bibcode: 1985RSPSA.400...97D.

Algorithms for quantum computation: discrete logarithms and factoring. W: Peter W. Shor: Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. 1994, s. 124–134. DOI: 10.1109/SFCS.1994.365700.

Certainty from Uncertainty. fortunecity.com. [zarchiwizowane z tego adresu (2001-11-24)]..