Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.

SHOR P W

Art

J-GLOBAL ID：200902188041686732 Reference number：98A0039505

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.

量子化コンピュータ上の素因数分解と離散対数の多項式時間アルゴリズム

Publisher site Copy service {{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=98A0039505&COPY=1") }}
Access JDreamⅢ for advanced search and analysis. {{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=98A0039505&from=J-GLOBAL&jstjournalNo=D0944A") }}

Author (1)：
Material：
Volume： 26 Issue： 5 Page： 1484-1509 Publication year： Oct. 1997
JST Material Number： D0944A ISSN： 0097-5397 CODEN： SMJCAT Document type： Article
Article type：原著論文 Country of issue： United States (USA) Language： ENGLISH (EN)

,...

To see more with JDream III (charged). {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=98A0039505&from=J-GLOBAL&jstjournalNo=D0944A") }}

Theory of computation , Other computers

, , , ,

Return to Previous Page