561
个编辑
更改
跳到导航
跳到搜索
第967行：
第967行： − + 第981行：
第981行： − +
→Computability theory可计算性理论
Any [[computational problem]] solvable by a classical computer is also solvable by a quantum computer.<ref>Nielsen, p. 29</ref> Intuitively, this is because it is believed that all physical phenomena, including the operation of classical computers, can be described using [[quantum mechanics]], which underlies the operation of quantum computers.
Any [[computational problem]] solvable by a classical computer is also solvable by a quantum computer.<ref>Nielsen, p. 29</ref> Intuitively, this is because it is believed that all physical phenomena, including the operation of classical computers, can be described using [[quantum mechanics]], which underlies the operation of quantum computers.
经典计算机可以解决的任何[[计算问题]]也可以由量子计算机解决。直觉上，这是因为人们相信，所有物理现象，包括经典计算机的操作，都可以用[[量子力学]来描述，这是量子计算机操作的基础。
经典计算机可以解决的任何[[计算问题]]也可以由量子计算机解决。<ref>Nielsen, p. 29</ref>直觉上，这是因为人们相信，所有物理现象，包括经典计算机的操作，都可以用[[量子力学]]来描述，这是量子计算机操作的基础。
Category:Models of computation
Category:Models of computation
Conversely, any problem solvable by a quantum computer is also solvable by a classical computer; or more formally, any quantum computer can be simulated by a [[Turing machine]]<!-- add mention about [[Quantum Virtual Machines]] which can simulate quantum computer on classical one -->. In other words, quantum computers provide no additional power over classical computers in terms of [[computability]]. This means that quantum computers cannot solve [[undecidable problem]]s like the [[halting problem]] and the existence of quantum computers does not disprove the [[Church–Turing thesis]].<ref>Nielsen, p. 126</ref>
Conversely, any problem solvable by a quantum computer is also solvable by a classical computer; or more formally, any quantum computer can be simulated by a [[Turing machine]]<!-- add mention about [[Quantum Virtual Machines]] which can simulate quantum computer on classical one -->. In other words, quantum computers provide no additional power over classical computers in terms of [[computability]]. This means that quantum computers cannot solve [[undecidable problem]]s like the [[halting problem]] and the existence of quantum computers does not disprove the [[Church–Turing thesis]].<ref>Nielsen, p. 126</ref>
相反，量子计算机可以解决的任何问题也可以用经典计算机来解决；或者更正式地说，任何量子计算机都可以用[[图灵机器]]<来模拟！--增加关于[[量子虚拟机]]的介绍，它可以在经典的量子计算机-->上模拟量子计算机。换句话说，量子计算机在[[可计算性]]方面没有比经典计算机更强大的能力。这意味着量子计算机不能解决[[不可判定的问题]]像[[停止问题]]一样，量子计算机的存在并不能反驳[[丘奇-图灵论点]]。
相反，量子计算机可以解决的任何问题也可以用经典计算机来解决；或者更正式地说，任何量子计算机都可以用[[图灵机]]<来模拟！--增加关于[[量子虚拟机]]的介绍，它可以在经典的量子计算机-->上模拟量子计算机。换句话说，量子计算机在[[可计算性]]方面没有比经典计算机更强大的能力。这意味着量子计算机不能解决[[不可判定的问题]]像[[停止问题]]一样，量子计算机的存在并不能反驳[[丘奇-图灵论点]]。
Category:Information theory
Category:Information theory