561
个编辑
更改
无编辑摘要
Quantum computing is the use of quantum phenomena such as superposition and entanglement to perform computation. Computers that perform quantum computations are known as quantum computers. Quantum computers are believed to be able to solve certain computational problems, such as integer factorization (which underlies RSA encryption), substantially faster than classical computers. The study of quantum computing is a subfield of quantum information science.
Quantum computing is the use of quantum phenomena such as superposition and entanglement to perform computation. Computers that perform quantum computations are known as quantum computers. Quantum computers are believed to be able to solve certain computational problems, such as integer factorization (which underlies RSA encryption), substantially faster than classical computers. The study of quantum computing is a subfield of quantum information science.
'''<font color="#ff8000"> 量子计算Quantum computing</font>'''是利用量子现象，如叠加和纠缠来执行计算。执行量子计算的计算机被称为量子计算机。量子计算机被认为能够解决某些计算问题，比如 RSA 加密的基础整数分解，比传统计算机快得多。'''<font color="#ff8000"> 量子计算</font>'''的研究是量子信息科学的一个分支。
'''<font color="#ff8000"> 量子计算Quantum computing</font>'''是利用量子现象，如'''<font color="#ff8000"> 叠加和纠缠Superposition and Entanglement</font>'''来执行计算。执行量子计算的计算机被称为量子计算机。量子计算机被认为能够解决某些计算问题，比如 RSA 加密的基础整数分解，比传统计算机快得多。'''<font color="#ff8000"> 量子计算</font>'''的研究是'''<font color="#ff8000"> 量子信息科学Quantum information science</font>'''的一个分支。
Quantum computing began in the early 1980s, when physicist Paul Benioff proposed a quantum mechanical model of the Turing machine. Richard Feynman and Yuri Manin later suggested that a quantum computer had the potential to simulate things that a classical computer could not. In 1994, Peter Shor developed a quantum algorithm for factoring integers that had the potential to decrypt RSA-encrypted communications. Despite ongoing experimental progress since the late 1990s, most researchers believe that "fault-tolerant quantum computing [is] still a rather distant dream." In recent years, investment into quantum computing research has increased in both the public and private sector. On 23 October 2019, Google AI, in partnership with the U.S. National Aeronautics and Space Administration (NASA), claimed to have performed a quantum computation that is infeasible on any classical computer.
Quantum computing began in the early 1980s, when physicist Paul Benioff proposed a quantum mechanical model of the Turing machine. Richard Feynman and Yuri Manin later suggested that a quantum computer had the potential to simulate things that a classical computer could not. In 1994, Peter Shor developed a quantum algorithm for factoring integers that had the potential to decrypt RSA-encrypted communications. Despite ongoing experimental progress since the late 1990s, most researchers believe that "fault-tolerant quantum computing [is] still a rather distant dream." In recent years, investment into quantum computing research has increased in both the public and private sector. On 23 October 2019, Google AI, in partnership with the U.S. National Aeronautics and Space Administration (NASA), claimed to have performed a quantum computation that is infeasible on any classical computer.
'''<font color="#ff8000"> 量子计算</font>'''始于20世纪80年代早期，当时物理学家保罗 · 贝尼奥夫提出了图灵机的量子力学模型。理查德 · 费曼和尤里 · 曼宁后来提出，量子计算机具有模拟传统计算机所不具备的潜力。1994年，Peter Shor 开发了一种量子算法，用于分解整数，这种算法有可能解密 rsa 加密的通信。尽管自20世纪90年代后期以来，实验取得了进展，但大多数研究人员认为，“容错量子计算机仍然是一个相当遥远的梦想。”近年来，量子计算研究的投资在公共和私营部门都有所增加。2019年10月23日，谷歌人工智能与美国宇航局合作，声称已经完成了在任何传统计算机上都不可能完成的量子计算。
'''<font color="#ff8000"> 量子计算</font>'''始于20世纪80年代早期，当时物理学家'''<font color="#ff8000"> 保罗 · 贝尼奥夫Paul Benioff</font>'''提出了图灵机的量子力学模型。理查德 · 费曼和尤里 · 曼宁后来提出，量子计算机具有模拟传统计算机所不具备的潜力。1994年，Peter Shor 开发了一种量子算法，用于分解整数，这种算法有可能解密 rsa 加密的通信。尽管自20世纪90年代后期以来，实验取得了进展，但大多数研究人员认为，“容错量子计算机仍然是一个相当遥远的梦想。”近年来，量子计算研究的投资在公共和私营部门都有所增加。2019年10月23日，谷歌人工智能与美国宇航局合作，声称已经完成了在任何传统计算机上都不可能完成的'''<font color="#ff8000"> 量子计算</font>'''。