期刊文献+

计算的极限

The limits of computation
原文传递
导出
摘要 计算深刻地影响着人们的日常生活和生产活动,也推动了诸多其他科学领域的发展和变革.本文从几个不同的方面探讨计算的能力和极限.从计算的模型和丘奇图灵论题,到P和NP问题的深远影响及量子计算对传统计算的冲击,我们深入讨论了对计算极限的理解. The powerful idea of computation has accompanied the development of human civilization, has deeply changed the way we live and work, and has accelerated the advancement of many areas of sciences. In this article, we explore the power and limits of computation from several different perspectives. We will discuss topics from the models of computation and Church-Turing thesis, to the impact of the P versus NP problem and quantum computing on our understanding of the limits of computation. More concretely, we will explore the computability and the halting problem, the efficiency problem of computation, the P versus NP problem. We then move on to the discussion of quantum computation, quantum algorithm for factoring and its implications, quantum simulation and the relation between quantum and classical computations.
出处 《科学通报》 EI CAS CSCD 北大核心 2016年第4期404-408,共5页 Chinese Science Bulletin
关键词 图灵机 丘奇图灵论题 量子计算 大数分解 量子模拟 Turing machine, Church-Turing thesis, quantum computing, integer factorization, quantum simulation
  • 相关文献

参考文献10

  • 1Turing A.On computable numbers,with an application to the Entscheidungs problem.London Math Soc,Ser 2,1936,42:230-265.
  • 2Cook S.The complexity of theorem-proving procedures.In:Harrison M A,Banerji R B,Ullman J D,eds.Proceedings of the 3rd ACM Symposium on Theory of Computing,1971.151-158.
  • 3Levin L.Universal search problems(in Russian).Probl Inf Transm,1973,9:115-116.
  • 4Arora S,Barak B.Computational Complexity:A Modern Approach.Cambridge:Cambridge University Press,2009.
  • 5Feynman R.Simulating physics with computers.Int J Theor Phys,1982,21:467-488.
  • 6Nielsen M,Chuang I.Quantum Computation and Quantum Information.Cambridge:Cambridge University Press,2000.
  • 7Lloyd S.Universal quantum simulator.Science,1996,273:1073-1078.
  • 8Shor P.Polynomial-time algorithm for prime factorization and discrete logarithms on a quantum computer.SIAM J Comput,1997,26:1484-1509.
  • 9Harrow A,Hassidim A,Lloyd S.Quantum algorithm for linear systems of equations.Phys Rev Lett,2009,103:150502.
  • 10Aaronson S,Arkhipov A.The computational complexity of linear optics.In:Fortnow L,Vadhan S P,eds.Proceedings of the 43rd Annual ACM Symposium on Theory of Computing,2011.333-342.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部