^Gard, Bryan T.; Motes, Keith R.; Olson, Jonathan P.; Rohde, Peter P.; Dowling, Jonathan P. (August 2015). “An introduction to boson-sampling”. From Atomic to Mesoscale: the Role of Quantum Coherence in Systems of Various Complexities. World Scientific. pp. 167–192. arXiv:1406.6767. doi:10.1142/9789814678704_0008. ISBN978-981-4678-70-4
^Rubinstein, Michael (19 October 2006). "The distribution of solutions to xy = N mod a with an application to factoring integers". arXiv:math/0610612。
^Babai, László; Beals, Robert; Seress, Ákos (2009). Polynomial-time Theory of Matrix Groups. STOC '09. New York, NY, USA: ACM. 55–64. doi:10.1145/1536414.1536425. ISBN9781605585062
^Rivest, R. L.; Shamir, A.; Adleman, L. (February 1978). “A Method for Obtaining Digital Signatures and Public-key Cryptosystems”. Commun. ACM21 (2): 120–126. doi:10.1145/359340.359342. ISSN0001-0782.
^Martín-López, Enrique; Laing, Anthony; Lawson, Thomas; Alvarez, Roberto; Zhou, Xiao-Qi; O'Brien, Jeremy L. (November 2012). “Experimental realization of Shor's quantum factoring algorithm using qubit recycling”. Nature Photonics6 (11): 773–776. arXiv:1111.4147. Bibcode: 2012NaPho...6..773M. doi:10.1038/nphoton.2012.259. ISSN1749-4893.
^Fowler, Austin G.; Mariantoni, Matteo; Martinis, John M.; Cleland, Andrew N. (2012-09-18). “Surface codes: Towards practical large-scale quantum computation”. Physical Review A86 (3): 032324. arXiv:1208.0928. doi:10.1103/PhysRevA.86.032324.
^Kalai, Gil (2 June 2011). "How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation". arXiv:1106.0485 [quant-ph]。
^Kalai, Gil (3 May 2016). "The Quantum Computer Puzzle (Expanded Version)". arXiv:1605.00992 [quant-ph]。
^Dyakonov, M. I. (2007). “Is Fault-Tolerant Quantum Computation Really Possible?”. In S. Luryi. Future Trends in Microelectronics. Up the Nano Creek. Wiley. pp. 4–18. arXiv:quant-ph/0610117. Bibcode: 2006quant.ph.10117D
^Tang, Ewin (2019-05-09). “A quantum-inspired classical algorithm for recommendation systems”. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019. pp. 217–228. arXiv:1807.04271v3. doi:10.1145/3313276.3316310. ISBN9781450367059
^Palacios-Berraquero, Carmen; Mueck, Leonie; Persaud, Divya M. (2019-12-10). “Instead of 'supremacy' use 'quantum advantage'” (英語). Nature576 (7786): 213. doi:10.1038/d41586-019-03781-0. PMID31822842.
All text is available under the terms of the GNU Free Documentation License. この記事は、ウィキペディアの量子超越性 (改訂履歴)の記事を複製、再配布したものにあたり、GNU Free Documentation Licenseというライセンスの下で提供されています。 Weblio辞書に掲載されているウィキペディアの記事も、全てGNU Free Documentation Licenseの元に提供されております。