| 计算复杂性、量子计算及其哲学意义 |
| |
| 引用本文： | 吴国林,黄灵玉. 计算复杂性、量子计算及其哲学意义[J]. 自然辩证法研究, 2007, 23(1): 22-26 |
| |
| 作者姓名： | 吴国林 黄灵玉 |
| |
| 作者单位： | 华南理工大学政治与公共管理学院 广东广州510640 |
| |
| 基金项目： | 广东省哲学社会科学规划项目;教育部社科研究项目 |
| |
| 摘 要： | 量子计算机具有超越经典计算机的能力。量子计算具有并行性和整体性,某些量子算法具有加速性。量子计算揭示了:数学与物理学之间的紧密关系,量子力学的波函数具有实在性。量子计算具有克服计算复杂性的能力。
|
| 关 键 词： | 量子计算 量子算法 计算复杂性 |
| 文章编号： | 1000-8934（2007）01-0022-05 |
| 修稿时间： | 2006-09-04 |
Quantum Complexity, Quantum Computation And Its Philosophical Implications |
| |
| WU Guo-lin,HUANG Ling-yu. Quantum Complexity, Quantum Computation And Its Philosophical Implications[J]. Studies In Dialectics of Nature, 2007, 23(1): 22-26 |
| |
| Authors: | WU Guo-lin HUANG Ling-yu |
| |
| Affiliation: | School of Politics and Public Management, South China University of Technology, Guangzhou 510640, China |
| |
| Abstract: | Quantum computers have much more capacity than classical ones.Quantum computations are of parallelism and wholeness.Some quantum arithmetic can be of acceleration.Quantum computations bring us new philosophical implications such as the relationship between mathematics and physics,the reality of wave-function,and capacity of solving computation complexity. |
| |
| Keywords: | quantum computation quantum arithmetic computation complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
