Liōng-chí ián-sǹg-hoat
跳至導覽
跳至搜尋
使用經典計算機
註解 [修改]
- ↑ Nielsen, Michael A.; Choang, Isaac L. (2000). Quantum Computation and Quantum Information. Cambridge University Press. ISBN 978-0-521-63503-5.
- ↑ Mosca, M. (2008). "Quantum Algorithms". arXiv:0808.0369
[quant-ph].
- ↑ Lanzagorta, Marco; Uhlmann, Jeffrey K. (2009-01-01). Quantum Computer Science. Morgan & Claypool Publishers. ISBN 9781598297324.
- ↑ Nielsen, Michael A.; Choang, Isaac L. (2010). Quantum Computation and Quantum Information (2nd pán.). Cambridge: Cambridge University Press. ISBN 978-1-107-00217-3.
- ↑ "Shor's algorithm".
- ↑ "IBM quantum composer user guide: Grover's algorithm". quantum-computing.ibm.com. 7 June 2022 khòaⁿ--ê.
參閱[修改]
- Quantum machine learning
- Quantum optimization algorithms
- Quantum sort
- Primality test
外部 連結 [修改]
- TheQuantum Algorithm Zoo: A comprehensive list of quantum algorithms that provide a speedup over the fastest known classical algorithms。
- Andrew Childs' lecture notesonquantum algorithms
- TheQuantum search algorithm - brute force。
調查 [修改]
- Smith, J。; Mosca, M。 (2012). "Algorithms for Quantum Computers". Handbook of Natural Computing. p. 1451. doi:10.1007/978-3-540-92910-9_43. ISBN 978-3-540-92909-3.
- Childs, A。 M。; Van Dam, W。 (2010). "Quantum algorithms for algebraic problems". Reviews of Modern Physics. 82 (1): 1–52. arXiv:0812.0380 . Bibcode:2010RvMP...82....1C. doi:10.1103/RevModPhys.82.1.
