561
个编辑
更改
跳到导航
跳到搜索
第404行：
第404行： − #在可能的答案集合中没有可搜索的结构，+ + + + + − For problems with all these properties, the running time of Grover's algorithm on a quantum computer will scale as the square root of the number of inputs (or elements in the database), as opposed to the linear scaling of classical algorithms. A general class of problems to which Grover's algorithm can be applied is Boolean satisfiability problem. In this instance, the database through which the algorithm is iterating is that of all possible answers. An example (and possible) application of this is a password cracker that attempts to guess the password or secret key for an encrypted file or system. Symmetric ciphers such as Triple DES and AES are particularly vulnerable to this kind of attack. This application of quantum computing is a major interest of government agencies. − 对于具有所有这些特性的问题，Grover 算法在量子计算机上的运行时间将作为输入数量(或数据库中的元素)的平方根，而不是经典算法的线性缩放。的算法可以应用到的一类问题是布尔可满足性问题问题。在这个例子中，算法迭代的数据库是所有可能的答案的数据库。这方面的一个示例(和可能的)应用程序是密码破解器，它试图猜测加密文件或系统的密码或密钥。对称密码如三重 DES 和 AES 特别容易受到这种攻击。量子计算的这种应用是政府机构的主要兴趣所在。 − + + − 由于化学和纳米技术依赖于对量子系统的理解，而这样的系统是不可能以有效的经典方式进行模拟的，许多人相信量子模拟将是量子计算最重要的应用之一。量子模拟也可以用来模拟原子和粒子在非正常条件下的行为，比如对撞机内部的反应。+
→Quantum search 量子搜索
#There is no searchable structure in the collection of possible answers,
#There is no searchable structure in the collection of possible answers,
在可能的答案集合中没有可搜索的结构，
#The number of possible answers to check is the same as the number of inputs to the algorithm, and
#The number of possible answers to check is the same as the number of inputs to the algorithm, and
要检查的可能答案的数量与算法的输入数量相同，并且
For problems with all these properties, the running time of Grover's algorithm on a quantum computer will scale as the square root of the number of inputs (or elements in the database), as opposed to the linear scaling of classical algorithms. A general class of problems to which Grover's algorithm can be applied is Boolean satisfiability problem. In this instance, the database through which the algorithm is iterating is that of all possible answers. An example (and possible) application of this is a password cracker that attempts to guess the password or secret key for an encrypted file or system. Symmetric ciphers such as Triple DES and AES are particularly vulnerable to this kind of attack. This application of quantum computing is a major interest of government agencies.
对于具有所有这些性质的问题，Grover算法在量子计算机上的运行时间将按输入（或数据库中元素）数量的平方根来缩放，而不是经典算法的线性缩放。Grover算法可以应用的一类问题是布尔可满足性问题。在此例中，算法迭代使用的数据库是所有可能答案的数据库。这方面的一个例子（也是可能的）是一个密码破解程序，它试图猜测加密文件或系统的密码或密钥。对称密码如三重DES和AES特别容易受到这种攻击。量子计算的这种应用是政府机构的主要兴趣。
#There exists a boolean function which evaluates each input and determines whether it is the correct answer
#There exists a boolean function which evaluates each input and determines whether it is the correct answer
存在一个布尔函数，它计算每个输入并确定它是否是正确的答案
For problems with all these properties, the running time of [[Grover's algorithm]] on a quantum computer will scale as the square root of the number of inputs (or elements in the database), as opposed to the linear scaling of classical algorithms. A general class of problems to which [[Grover's algorithm]] can be applied<ref>{{cite journal |last1=Ambainis |first1=Ambainis |title=Quantum search algorithms |journal=ACM SIGACT News |date=June 2004 |volume=35 |issue=2 |pages=22–35 |doi=10.1145/992287.992296 |arxiv=quant-ph/0504012 |bibcode=2005quant.ph..4012A |s2cid=11326499 }}</ref> is [[Boolean satisfiability problem]]. In this instance, the ''database'' through which the algorithm is iterating is that of all possible answers. An example (and possible) application of this is a [[Password cracking|password cracker]] that attempts to guess the password or secret key for an [[encryption|encrypted]] file or system. [[Symmetric-key algorithm|Symmetric ciphers]] such as [[Triple DES]] and [[Advanced Encryption Standard|AES]] are particularly vulnerable to this kind of attack.{{citation needed|date=November 2019}} This application of quantum computing is a major interest of government agencies.<ref>{{cite news |url=https://www.washingtonpost.com/world/national-security/nsa-seeks-to-build-quantum-computer-that-could-crack-most-types-of-encryption/2014/01/02/8fff297e-7195-11e3-8def-a33011492df2_story.html |title=NSA seeks to build quantum computer that could crack most types of encryption |first1=Steven |last1=Rich |first2=Barton |last2=Gellman |date=2014-02-01 |newspaper=Washington Post}}</ref>
For problems with all these properties, the running time of [[Grover's algorithm]] on a quantum computer will scale as the square root of the number of inputs (or elements in the database), as opposed to the linear scaling of classical algorithms. A general class of problems to which [[Grover's algorithm]] can be applied<ref>{{cite journal |last1=Ambainis |first1=Ambainis |title=Quantum search algorithms |journal=ACM SIGACT News |date=June 2004 |volume=35 |issue=2 |pages=22–35 |doi=10.1145/992287.992296 |arxiv=quant-ph/0504012 |bibcode=2005quant.ph..4012A |s2cid=11326499 }}</ref> is [[Boolean satisfiability problem]]. In this instance, the ''database'' through which the algorithm is iterating is that of all possible answers. An example (and possible) application of this is a [[Password cracking|password cracker]] that attempts to guess the password or secret key for an [[encryption|encrypted]] file or system. [[Symmetric-key algorithm|Symmetric ciphers]] such as [[Triple DES]] and [[Advanced Encryption Standard|AES]] are particularly vulnerable to this kind of attack.{{citation needed|date=November 2019}} This application of quantum computing is a major interest of government agencies.<ref>{{cite news |url=https://www.washingtonpost.com/world/national-security/nsa-seeks-to-build-quantum-computer-that-could-crack-most-types-of-encryption/2014/01/02/8fff297e-7195-11e3-8def-a33011492df2_story.html |title=NSA seeks to build quantum computer that could crack most types of encryption |first1=Steven |last1=Rich |first2=Barton |last2=Gellman |date=2014-02-01 |newspaper=Washington Post}}</ref>
对于具有所有这些性质的问题，[[Grover算法]]在量子计算机上的运行时间将按输入（或数据库中元素）数量的平方根进行缩放，而不是经典算法的线性缩放。一类可以应用[[Grover算法]]的一般问题是[[布尔可满足性问题]]。在本例中，算法迭代使用的“数据库”是所有可能答案的数据库。这方面的一个例子（也是可能的）应用是一个[[密码破解|密码破解器]]试图猜测[[加密|加密]]文件或系统的密码或密钥。[[对称密钥算法|对称密码]]例如[[Triple DES]]和[[Advanced Encryption Standard | AES]]特别容易受到此类攻击。{{引文需要{日期=2019年11月}}量子计算的这一应用是政府机构的主要兴趣。
Since chemistry and nanotechnology rely on understanding quantum systems, and such systems are impossible to simulate in an efficient manner classically, many believe quantum simulation will be one of the most important applications of quantum computing. Quantum simulation could also be used to simulate the behavior of atoms and particles at unusual conditions such as the reactions inside a collider.
Since chemistry and nanotechnology rely on understanding quantum systems, and such systems are impossible to simulate in an efficient manner classically, many believe quantum simulation will be one of the most important applications of quantum computing. Quantum simulation could also be used to simulate the behavior of atoms and particles at unusual conditions such as the reactions inside a collider.
由于化学和纳米技术依赖于对量子系统的理解，而这样的系统是不可能以有效的经典方式进行模拟的，许多人相信'''<font color="#ff8000"> 量子模拟</font>'''将是量子计算最重要的应用之一。'''<font color="#ff8000"> 量子模拟</font>'''也可以用来模拟原子和粒子在非正常条件下的行为，比如对撞机内部的反应。
=== Quantum simulation ===
=== Quantum simulation ===