添加的内容 删除的内容
(修改自此处;原许可:CC BY-SA 3.0[网站升级迁移]) |
小 (机器人:清理不当的来源、移除无用的模板参数) |
||
(未显示2个用户的5个中间版本) | |||
第1行: | 第1行: | ||
'''量子演算法'''(Quantum algorithm;量子算法)是在[[量子 |
'''量子演算法'''(Quantum algorithm;量子算法)是在[[量子计算]]中,于量子计算的现实模型上运行的[[演算法]],最常用的模型是[[量子线路]]的计算模型。<ref>{{cite book|title=Quantum Computation and Quantum Information|last1=Nielsen|first1=Michael A.|last2=Chuang|first2=Isaac L.|publisher=[[Cambridge University Press]]|year=2000|isbn=978-0-521-63503-5|||title-link=Quantum Computation and Quantum Information}}</ref><ref>{{cite arXiv|eprint=0808.0369|class=quant-ph|first=M.|last=Mosca||title=Quantum Algorithms|date=2008}}</ref>经典(或非量子)演算法是有限的指令序列,或用于解決问题的分步驟过程,其中每个步驟或指令都可以在经典计算机上执行。同样地量子演算法是一个循序渐进的过程,其中每个步驟都可以在[[量子计算机]]上执行。儘管所有经典演算法也可以在量子计算机上执行,<ref>{{Cite book|title = Quantum Computer Science||publisher = Morgan & Claypool Publishers|date = 2009-01-01|isbn = 9781598297324|first1 = Marco|last1 = Lanzagorta|first2 = Jeffrey K.|last2 = Uhlmann}}</ref>{{rp|126}}量子演算法一词通常用于那些看起来本质上是量子的演算法,或者使用量子计算的某些基本特征,例如[[量子疊加]]、或[[量子糾纏]]等。 |
||
使用 |
使用经典计算机对于[[不可判定问题]]仍然无法使用量子计算机判定。<ref name=nielchuan>{{cite book|title=Quantum Computation and Quantum Information|last1=Nielsen|first1=Michael A.|last2=Chuang|first2=Isaac L.|publisher=Cambridge University Press|year=2010|isbn=978-1-107-00217-3|edition=2nd|location=Cambridge}}</ref>{{rp|127}}量子演算法的有趣之处在于它们可能比经典演算法更快地解決一些问题,因为量子演算法利用的量子疊加及量子糾纏可能无法解決在经典计算机上进行有效的模擬(参閱[[量子计算优越性]])。 |
||
最著名的演算法是用 |
最著名的演算法是用于因式分解的[[蕭尔演算法]]以及用于搜索非结构化数据库,或无序列表的[[格罗弗算法]]。蕭尔演算法比最著名的经典分解算法([[普通数域篩选法]])运行得快得多(几乎呈指数级)。<ref>{{Cite web|url=https://quantum-computing.ibm.com/docs/iqx/guide/shors-algorithm|title = Shor's algorithm}}</ref>对于相同的任务,格罗弗演算法的运行速度比最好的经典演算法快两倍,是一种[[线性搜索]]方法。 |
||
== |
== 注释 == |
||
{{reflist |
{{reflist}} |
||
== |
== 参閱 == |
||
* [[量子 |
* [[量子编程]] |
||
== 外部 |
== 外部链接 == |
||
{{div col|2}} |
{{div col|2}} |
||
* The [ |
* The [https://math.nist.gov/quantum/zoo/ Quantum Algorithm Zoo]: A comprehensive list of quantum algorithms that provide a speedup over the fastest known classical algorithms. |
||
* [https://www.cs.umd.edu/~amchilds/qa/ Andrew Childs' lecture notes on quantum algorithms] |
* [https://www.cs.umd.edu/~amchilds/qa/ Andrew Childs' lecture notes on quantum algorithms] |
||
* [https://bastion.center/the-quantum-search-algorithm/ The Quantum search algorithm - brute force]. |
* [https://bastion.center/the-quantum-search-algorithm/ The Quantum search algorithm - brute force]. |
||
=== |
=== 调查 === |
||
* {{Cite book | last1 = Smith | first1 = J. | last2 = Mosca | first2 = M. | doi = 10.1007/978-3-540-92910-9_43 | chapter = Algorithms for Quantum Computers | title = Handbook of Natural Computing | pages = 1451 | year = 2012 | isbn = 978-3-540-92909-3 | s2cid = 16565723 }} |
* {{Cite book | last1 = Smith | first1 = J. | last2 = Mosca | first2 = M. | doi = 10.1007/978-3-540-92910-9_43 | chapter = Algorithms for Quantum Computers | title = Handbook of Natural Computing | pages = 1451 | year = 2012 | isbn = 978-3-540-92909-3 | s2cid = 16565723 }} |
||
* {{Cite journal | last1 = Childs | first1 = A. M. | last2 = Van Dam | first2 = W. | doi = 10.1103/RevModPhys.82.1 | title = Quantum algorithms for algebraic problems | journal = Reviews of Modern Physics | volume = 82 | pages = 1–52 | year = 2010 | issue = 1 |bibcode = 2010RvMP...82....1C | arxiv = 0812.0380 | s2cid = 119261679 }} |
* {{Cite journal | last1 = Childs | first1 = A. M. | last2 = Van Dam | first2 = W. | doi = 10.1103/RevModPhys.82.1 | title = Quantum algorithms for algebraic problems | journal = Reviews of Modern Physics | volume = 82 | pages = 1–52 | year = 2010 | issue = 1 |bibcode = 2010RvMP...82....1C | arxiv = 0812.0380 | s2cid = 119261679 }} |
||
第28行: | 第28行: | ||
{{DEFAULTSORT:Quantum Algorithm}} |
{{DEFAULTSORT:Quantum Algorithm}} |
||
[[Category:量子演算法| ]] |
[[Category:量子演算法| ]] |
||
[[Category:量子 |
[[Category:量子计算]] |
||
[[Category:量子信息]] |
[[Category:量子信息]] |
||
[[Category:理论计算机科学]] |
[[Category:理论计算机科学]] |