量子算法可以用于加密吗？
量子算法有用吗？
有没有人成功地将量子算法投入实际应用？
Can quantum algorithms be useful?
Has any one been successful in putting quantum algorithms to any use?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（7）
“量子算法”是在量子计算机上运行的算法。
在量子计算模型中可以快速完成一些经典计算无法实现的事情：离散对数和整数分解（参见Shor 算法）位于 BQP，但不被认为是在 P 中（或 BPP ）。 因此，当/如果一台量子计算机被建造出来时，众所周知它可以破解 RSA 和大多数当前的密码学。
然而，
[还有量子密码学的想法，它是基于量子通道的密码学，与量子计算有很大不同。]
"Quantum algorithms" are algorithms to be run on quantum computers.
There are things that can be done quickly in the quantum computation model that are not known (or believed) to be possible with classical computation: Discrete logarithm and Integer factorisation (see Shor's algorithm) are in BQP, but not believed to be in P (or BPP). Thus when/if a quantum computer is built, it is known that it can break RSA and most current cryptography.
However,
[There is also the idea of quantum cryptography, which is cryptography over a quantum channel, and is something quite different from quantum computation.]
唯一合乎逻辑的答案是它们既有用又没用。 ;-)
The only logical answer is that they are both useful and not useful. ;-)
我的理解是，当前的量子计算能力可用于安全地交换密钥。 然后交换的密钥可以用于执行传统的加密。
My understanding is that current quantum computing capabilities can be used to exchange keys securely. The exchanged keys can then be used to perform traditional cryptography.
据我所知，量子计算和算法。我在密码学中看到了量子算法的很多用法。如果您真的对密码学感兴趣，请检查这些内容。基本上，重要的是您对量子力学和离散数学基础知识的了解程度。 例如：你一定看到过像 Shor 算法这样的困难算法，这基本上是整数分解。使用普通算法代数群分解算法、费马分解方法等基本上整数分解是很容易的事情，但当涉及到量子计算时，它完全不同，你在量子计算机中运行这些东西，所以算法发生了变化，我们必须使用像 Shor 等算法。
基本上对量子计算有很好的理解，然后看看量子算法
As far i know about Quantum Computing and Algorithms.I seen pretty much usage of Quantum Algorithms in Cryptography.If you are really interested in Cryptography do please check on those things.Basically all matter is how well you know basics of Quantum mechanics and discrete mathematics. Eg: you must be seeing difficult algorithms like Shor's Algorithm ,this basically integer factorization.Basically integer factorization is easy thing using normal algorithms Algebraic-group factorization algorithm,Fermat's factorization method..etc but when its comes to Quantum Computing its totally different,you are running the things in Quantum computers so algorithm changes and we have to use the algorithms like Shor's etc.
Basically make good understanding about Quantum Computing and then look Quantum Algorithms
还有一些研究涉及量子计算是否可以用于解决难题，例如分解大数（如果可行，它将破坏当前的加密技术）。
There is also some research into whether quantum computing can be used to solve hard problems, such as factoring large numbers (if this was feasible it would break current encryption techniques).
Stackoverflow 运行在某种量子计算机上。
费曼暗示量子概率可能是人类创造力的源泉。
人群中的个人提出答案并对其进行投票，只有正确的可能性。 只有对人群进行多次采样，才能将概率提高到一个置信水平。
因此，Stackoverflow 或许是量子算法成功实现的一个例子。
你怎么认为？
Stackoverflow runs on a quantum computer of sorts.
Feynman has implied the possibility that quantum probability is the source of human creativity.
Individuals in the crowd present answers and vote on them with only a probability of being correct. Only by sampling the crowd many times can the probability be raised to a confident level.
So maybe Stackoverflow examplifies a successful quantum algorithm implementation.
What do you think?
当前技术中可以实现的量子设备的一个很好的用途是随机数生成器。
生成真正的随机位是一种重要的密码原语，例如在 RSA 算法中用于生成私钥。 在我们的电脑中，随机数生成器根本不是随机的，因为源中没有熵，因此根本不是真正随机的。
One good use of a quantum device that can be done in current technology is a random number generator.
Generating truly random bits is an important cryptographic primitive, and is used, for example, in the RSA algorithm to generate the private key. In our PC the random number generator isn't random at all in the sense that the source has no entropy in it, and therefore isn't really random at all.