Art

J-GLOBAL ID：200902211023963984   Reference number：07A0433765

量子分散コンピューティング

Author (3)： TANI SEIICHIRO (NTT コミュニケーション科学基礎研) ,  TANI SEIICHIRO (JST-ERATO-SORST) ,  LE GALL Francois (JST-ERATO-SORST)
Material： 電子情報通信学会論文誌 A  (IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences (Japan Edition))
Volume： J90-A  Issue： 5  Page： 393-402  Publication year： May. 01, 2007 
JST Material Number： S0621A  ISSN： 0913-5707  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： *distributed processing ,...
Semi thesaurus term： distributed computing ,...

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

JST classification (2)： Theory of computation  (JB02000A) ,  Digital computer systems in general  (JC02010O)

Reference (44)：

• P. W. Shor,“Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Comput., vol.26, no.5, pp. 1484-1509, 1997.
• L. K. Grover,“A fast quantum mechanical algorithm for database search,” Proc. Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212-219, 1996.
• A. C.-C. Yao,“Quantum circuit complexity,” Proc. Thirty-Fourth Annual IEEE Symposium on Foundations of Computer Science, pp. 352-361, 1993.
• H. M. Buhrman, R. E. Cleve, and A. Wigderson,“Quantum vs. classical communication and computation,” Proc. Thirtieth Annual ACM Symposium on the Theory of Computing, pp. 63-68, 1998.
• R. Raz,“Exponential separation of quantum and classical communication complexity,” Proc. Thirty-First Annual ACM Symposium on Theory of Computing, pp. 358-367, 1999.

Terms in the title (2)： 量子 ,  分散コンピューティング