307
个编辑
更改
跳到导航
跳到搜索
第206行：
第206行： + 第211行：
第212行： − 量子计算机是一种计算机，其计算模型是基于量子力学的。丘奇-图灵理论适用于量子计算机，也就是说，任何可以由量子计算机解决的问题也可以由图灵机解决。然而，一些问题在理论上可以解决与一个更低的时间复杂性使用量子计算机而不是传统的计算机。目前，这纯粹是理论上的，因为没有人知道如何建造一台高效的量子计算机。+ 第219行：
第220行： − 量子复杂性理论已经发展到研究用量子计算机解决的问题的复杂性类。它用于后量子密码学，其中包括设计抗量子计算机攻击的密码协议。+
→Quantum computing
===Quantum computing===
===Quantum computing===
量子计算
A [[quantum computer]] is a computer whose model of computation is based on [[quantum mechanics]]. The [[Church–Turing thesis (complexity theory)|Church–Turing thesis]] applies to quantum computers; that is, every problem that can be solved by a quantum computer can also be solved by a Turing machine. However, some problems may theoretically be solved with a much lower [[time complexity]] using a quantum computer rather than a classical computer. This is, for the moment, purely theoretical, as no one knows how to build an efficient quantum computer.
A [[quantum computer]] is a computer whose model of computation is based on [[quantum mechanics]]. The [[Church–Turing thesis (complexity theory)|Church–Turing thesis]] applies to quantum computers; that is, every problem that can be solved by a quantum computer can also be solved by a Turing machine. However, some problems may theoretically be solved with a much lower [[time complexity]] using a quantum computer rather than a classical computer. This is, for the moment, purely theoretical, as no one knows how to build an efficient quantum computer.
A quantum computer is a computer whose model of computation is based on quantum mechanics. The Church–Turing thesis applies to quantum computers; that is, every problem that can be solved by a quantum computer can also be solved by a Turing machine. However, some problems may theoretically be solved with a much lower time complexity using a quantum computer rather than a classical computer. This is, for the moment, purely theoretical, as no one knows how to build an efficient quantum computer.
A quantum computer is a computer whose model of computation is based on quantum mechanics. The Church–Turing thesis applies to quantum computers; that is, every problem that can be solved by a quantum computer can also be solved by a Turing machine. However, some problems may theoretically be solved with a much lower time complexity using a quantum computer rather than a classical computer. This is, for the moment, purely theoretical, as no one knows how to build an efficient quantum computer.
'''<font color="#ff8000">量子计算机 quantum computer</font>'''是一种计算模型是基于'''<font color="#ff8000">量子力学 quantum mechanics</font>'''的计算机。'''<font color="#ff8000">丘奇-图灵理论 Church–Turing thesis</font>'''适用于量子计算机，也就是说，任何可以由量子计算机解决的问题也可以由图灵机解决。然而，有些问题理论上可以用量子计算机而不是传统计算机来解决，并且'''<font color="#ff8000">时间复杂度 time complexity</font>'''要低得多。由于没有人知道如何建造一台高效的量子计算机，目前这纯粹是理论上可行的。
Quantum complexity theory has been developed to study the complexity classes of problems solved using quantum computers. It is used in post-quantum cryptography, which consists of designing cryptographic protocols that are resistant to attacks by quantum computers.
Quantum complexity theory has been developed to study the complexity classes of problems solved using quantum computers. It is used in post-quantum cryptography, which consists of designing cryptographic protocols that are resistant to attacks by quantum computers.
'''<font color="#ff8000">量子复杂度理论 Quantum complexity theory</font>'''已经发展到研究用量子计算机解决的问题的'''<font color="#ff8000">复杂度类 complexity class</font>'''。它用于'''<font color="#ff8000">后量子密码学 post-quantum cryptography</font>'''，其中包括设计能抵御量子计算机攻击的'''<font color="#ff8000">安全协议 cryptographic protocol</font>'''。
==Problem complexity (lower bounds)==
==Problem complexity (lower bounds)==