量子计算优越性 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "量子计算优越性" in Chinese language version.

refsWebsite

Global rank Chinese rank

23web.archive.org

1^st place

18doi.org

2^nd place

23^rd place

14arxiv.org

69^th place

254^th place

11harvard.edu

18^th place

57^th place

9worldcat.org

5^th place

12^th place

4nih.gov

4^th place

5^th place

3nature.com

234^th place

227^th place

2sina.com.cn

144^th place

3^rd place

2ieee.org

652^nd place

712^th place

1lib.ru

1,588^th place

4,531^st place

1xinhuanet.com

309^th place

19^th place

1umbc.edu

low place

1nist.gov

355^th place

411^th place

1springer.com

274^th place

320^th place

1sciencemag.org

857^th place

506^th place

1newscientist.com

774^th place

706^th place

1archive.org

6^th place

4^th place

1technologyreview.com

1,943^rd place

2,036^th place

1telegraph.co.uk

30^th place

111^th place

1scientificamerican.com

896^th place

1,333^rd place

1hk01.com

379^th place

11^th place

1ft.com

210^th place

353^rd place

1ibm.com

1,131^st place

1,050^th place

1qq.com

381^st place

15^th place

1googleblog.com

1,272^nd place

2,099^th place

1sputniknews.com

2,033^rd place

2,367^th place

archive.org (Global: 6^th place; Chinese: 4^th place)

Dyakonov, M. I. Is Fault-Tolerant Quantum Computation Really Possible?. 2006. arXiv:quant-ph/0610117 .

arxiv.org (Global: 69^th place; Chinese: 254^th place)

Papageorgiou, Anargyros; Traub, Joseph F. Measures of quantum computing speedup. Physical Review A. 2013-08-12, 88 (2): 022316. Bibcode:2013PhRvA..88b2316P. ISSN 1050-2947. arXiv:1307.7488 . doi:10.1103/PhysRevA.88.022316.
Preskill, John. "Quantum computing and the entanglement frontier". 2012-03-26. arXiv:1203.5813 .
Shor, P. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Review. 1999-01-01, 41 (2): 303–332. Bibcode:1999SIAMR..41..303S. ISSN 0036-1445. arXiv:quant-ph/9508027 . doi:10.1137/S0036144598347011.
Aaronson, Scott; Arkhipov, Alex. The Computational Complexity of Linear Optics. Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing. STOC '11 (New York, NY, USA: ACM). 2011: 333–342. ISBN 9781450306911. arXiv:1011.3245 . doi:10.1145/1993636.1993682.
Lund, A. P.; Bremner, Michael J.; Ralph, T. C. Quantum sampling problems, BosonSampling and quantum supremacy. Npj Quantum Information. 2017-04-13, 3 (1): 15 [2019-10-23]. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. arXiv:1702.03061 . doi:10.1038/s41534-017-0018-2. （原始内容存档于2021-03-08）.
Gard, Bryan T.; Motes, Keith R.; Olson, Jonathan P.; Rohde, Peter P.; Dowling, Jonathan P. From Atomic to Mesoscale: the Role of Quantum Coherence in Systems of Various Complexities. World Scientific. August 2015: 167–192. ISBN 978-981-4678-70-4. arXiv:1406.6767 . doi:10.1142/9789814678704_0008.
Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. Average-case complexity versus approximate simulation of commuting quantum computations. Physical Review Letters. 2016-08-18, 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Rahimi-Keshari, Saleh; Ralph, Timothy C.; Caves, Carlton M. Sufficient Conditions for Efficient Classical Simulation of Quantum Optics. Physical Review X. 2016-06-20, 6 (2): 021039. Bibcode:2016PhRvX...6b1039R. arXiv:1511.06526 . doi:10.1103/PhysRevX.6.021039.
Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu. Universal linear optics. Science. 2015-08-14, 349 (6249): 711–716 [2019-10-23]. ISSN 0036-8075. PMID 26160375. arXiv:1505.01182 . doi:10.1126/science.aab3642. （原始内容存档于2020-12-16）.
Neville, Alex; Sparrow, Chris; Clifford, Raphaël; Johnston, Eric; Birchall, Patrick M.; Montanaro, Ashley; Laing, Anthony. No imminent quantum supremacy by boson sampling. Nature Physics. 2017-10-02, 13 (12): 1153–1157 [2019-10-23]. ISSN 1745-2473. arXiv:1705.00686 . doi:10.1038/nphys4270. （原始内容存档于2020-08-06）.
Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N.; Babbush, Ryan; Ding, Nan; Jiang, Zhang; Bremner, Michael J.; Martinis, John M.; Neven, Hartmut. Characterizing quantum supremacy in near-term devices. Nature Physics. 2018-04-23, 14 (6): 595–600. arXiv:1608.00263 . doi:10.1038/s41567-018-0124-x.
Knill, E. Quantum computing with realistically noisy devices. Nature. 2005-03-03, 434 (7029): 39–44 [2019-10-23]. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. arXiv:quant-ph/0410199 . doi:10.1038/nature03350. （原始内容存档于2009-06-28）.
Dyakonov, M. I. Is Fault-Tolerant Quantum Computation Really Possible?. 2006. arXiv:quant-ph/0610117 .
Pednault, Edwin. Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits. 2019-10-22. arXiv:1910.09534  [quant-ph].

doi.org (Global: 2^nd place; Chinese: 23^rd place)

Papageorgiou, Anargyros; Traub, Joseph F. Measures of quantum computing speedup. Physical Review A. 2013-08-12, 88 (2): 022316. Bibcode:2013PhRvA..88b2316P. ISSN 1050-2947. arXiv:1307.7488 . doi:10.1103/PhysRevA.88.022316.
Feynman, Richard P. Simulating Physics with Computers. International Journal of Theoretical Physics. 1982-06-01, 21 (6–7): 467–488. Bibcode:10.1.1.45.9310 请检查|bibcode=值 (帮助). ISSN 0020-7748. doi:10.1007/BF02650179.
Shor, P. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Review. 1999-01-01, 41 (2): 303–332. Bibcode:1999SIAMR..41..303S. ISSN 0036-1445. arXiv:quant-ph/9508027 . doi:10.1137/S0036144598347011.
Aaronson, Scott; Arkhipov, Alex. The Computational Complexity of Linear Optics. Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing. STOC '11 (New York, NY, USA: ACM). 2011: 333–342. ISBN 9781450306911. arXiv:1011.3245 . doi:10.1145/1993636.1993682.
Watrous, John. Meyers, Robert A. , 编. Quantum Computational Complexity. Springer New York. 2009: 7174–7201. ISBN 9780387758886. doi:10.1007/978-0-387-30440-3_428.
Lund, A. P.; Bremner, Michael J.; Ralph, T. C. Quantum sampling problems, BosonSampling and quantum supremacy. Npj Quantum Information. 2017-04-13, 3 (1): 15 [2019-10-23]. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. arXiv:1702.03061 . doi:10.1038/s41534-017-0018-2. （原始内容存档于2021-03-08）.
Gard, Bryan T.; Motes, Keith R.; Olson, Jonathan P.; Rohde, Peter P.; Dowling, Jonathan P. From Atomic to Mesoscale: the Role of Quantum Coherence in Systems of Various Complexities. World Scientific. August 2015: 167–192. ISBN 978-981-4678-70-4. arXiv:1406.6767 . doi:10.1142/9789814678704_0008.
Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. Average-case complexity versus approximate simulation of commuting quantum computations. Physical Review Letters. 2016-08-18, 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Babai, László; Beals, Robert; Seress, Ákos. Polynomial-time Theory of Matrix Groups. Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing. STOC '09 (New York, NY, USA: ACM). 2009: 55–64. Bibcode:10.1.1.674.9429 请检查|bibcode=值 (帮助). ISBN 9781605585062. doi:10.1145/1536414.1536425.
Rivest, R. L.; Shamir, A.; Adleman, L. A Method for Obtaining Digital Signatures and Public-key Cryptosystems. Commun. ACM. February 1978, 21 (2): 120–126. Bibcode:10.1.1.607.2677 请检查|bibcode=值 (帮助). ISSN 0001-0782. doi:10.1145/359340.359342.
Rahimi-Keshari, Saleh; Ralph, Timothy C.; Caves, Carlton M. Sufficient Conditions for Efficient Classical Simulation of Quantum Optics. Physical Review X. 2016-06-20, 6 (2): 021039. Bibcode:2016PhRvX...6b1039R. arXiv:1511.06526 . doi:10.1103/PhysRevX.6.021039.
Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu. Universal linear optics. Science. 2015-08-14, 349 (6249): 711–716 [2019-10-23]. ISSN 0036-8075. PMID 26160375. arXiv:1505.01182 . doi:10.1126/science.aab3642. （原始内容存档于2020-12-16）.
Neville, Alex; Sparrow, Chris; Clifford, Raphaël; Johnston, Eric; Birchall, Patrick M.; Montanaro, Ashley; Laing, Anthony. No imminent quantum supremacy by boson sampling. Nature Physics. 2017-10-02, 13 (12): 1153–1157 [2019-10-23]. ISSN 1745-2473. arXiv:1705.00686 . doi:10.1038/nphys4270. （原始内容存档于2020-08-06）.
Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N.; Babbush, Ryan; Ding, Nan; Jiang, Zhang; Bremner, Michael J.; Martinis, John M.; Neven, Hartmut. Characterizing quantum supremacy in near-term devices. Nature Physics. 2018-04-23, 14 (6): 595–600. arXiv:1608.00263 . doi:10.1038/s41567-018-0124-x.
Shor, Peter W. Scheme for reducing decoherence in quantum computer memory. Physical Review A. 1995-10-01, 52 (4): R2493–R2496. Bibcode:1995PhRvA..52.2493S. doi:10.1103/PhysRevA.52.R2493.
Steane, A. M. Error Correcting Codes in Quantum Theory. Physical Review Letters. 1996-07-29, 77 (5): 793–797. Bibcode:1996PhRvL..77..793S. PMID 10062908. doi:10.1103/PhysRevLett.77.793.
Knill, E. Quantum computing with realistically noisy devices. Nature. 2005-03-03, 434 (7029): 39–44 [2019-10-23]. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. arXiv:quant-ph/0410199 . doi:10.1038/nature03350. （原始内容存档于2009-06-28）.
Arute, Frank; et al. Quantum supremacy using a programmable superconducting processor. 自然期刊. 23 October 2019, 574: 505–510 [25 October 2019]. doi:10.1038/s41586-019-1666-5. （原始内容存档于2019-10-23）.

ft.com (Global: 210^th place; Chinese: 353^rd place)

Google claims to have reached quantum supremacy. Financial times. 2019-09-21 [2019-10-23]. （原始内容存档于2021-04-29）.

googleblog.com (Global: 1,272^nd place; Chinese: 2,099^th place)

ai.googleblog.com

John Martinis. Quantum Supremacy Using a Programmable Superconducting Processor. 2019-10-23. （原始内容存档于2019-10-23）.

harvard.edu (Global: 18^th place; Chinese: 57^th place)

ui.adsabs.harvard.edu

Papageorgiou, Anargyros; Traub, Joseph F. Measures of quantum computing speedup. Physical Review A. 2013-08-12, 88 (2): 022316. Bibcode:2013PhRvA..88b2316P. ISSN 1050-2947. arXiv:1307.7488 . doi:10.1103/PhysRevA.88.022316.
Feynman, Richard P. Simulating Physics with Computers. International Journal of Theoretical Physics. 1982-06-01, 21 (6–7): 467–488. Bibcode:10.1.1.45.9310 请检查|bibcode=值 (帮助). ISSN 0020-7748. doi:10.1007/BF02650179.
Shor, P. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Review. 1999-01-01, 41 (2): 303–332. Bibcode:1999SIAMR..41..303S. ISSN 0036-1445. arXiv:quant-ph/9508027 . doi:10.1137/S0036144598347011.
Lund, A. P.; Bremner, Michael J.; Ralph, T. C. Quantum sampling problems, BosonSampling and quantum supremacy. Npj Quantum Information. 2017-04-13, 3 (1): 15 [2019-10-23]. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. arXiv:1702.03061 . doi:10.1038/s41534-017-0018-2. （原始内容存档于2021-03-08）.
Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. Average-case complexity versus approximate simulation of commuting quantum computations. Physical Review Letters. 2016-08-18, 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Babai, László; Beals, Robert; Seress, Ákos. Polynomial-time Theory of Matrix Groups. Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing. STOC '09 (New York, NY, USA: ACM). 2009: 55–64. Bibcode:10.1.1.674.9429 请检查|bibcode=值 (帮助). ISBN 9781605585062. doi:10.1145/1536414.1536425.
Rivest, R. L.; Shamir, A.; Adleman, L. A Method for Obtaining Digital Signatures and Public-key Cryptosystems. Commun. ACM. February 1978, 21 (2): 120–126. Bibcode:10.1.1.607.2677 请检查|bibcode=值 (帮助). ISSN 0001-0782. doi:10.1145/359340.359342.
Rahimi-Keshari, Saleh; Ralph, Timothy C.; Caves, Carlton M. Sufficient Conditions for Efficient Classical Simulation of Quantum Optics. Physical Review X. 2016-06-20, 6 (2): 021039. Bibcode:2016PhRvX...6b1039R. arXiv:1511.06526 . doi:10.1103/PhysRevX.6.021039.
Shor, Peter W. Scheme for reducing decoherence in quantum computer memory. Physical Review A. 1995-10-01, 52 (4): R2493–R2496. Bibcode:1995PhRvA..52.2493S. doi:10.1103/PhysRevA.52.R2493.
Steane, A. M. Error Correcting Codes in Quantum Theory. Physical Review Letters. 1996-07-29, 77 (5): 793–797. Bibcode:1996PhRvL..77..793S. PMID 10062908. doi:10.1103/PhysRevLett.77.793.
Knill, E. Quantum computing with realistically noisy devices. Nature. 2005-03-03, 434 (7029): 39–44 [2019-10-23]. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. arXiv:quant-ph/0410199 . doi:10.1038/nature03350. （原始内容存档于2009-06-28）.

hk01.com (Global: 379^th place; Chinese: 11^th place)

中國量子電腦原型機「九章」問世　速度快Google「懸鈴木」百億倍. [2020-12-04]. （原始内容存档于2020-12-04）.

ibm.com (Global: 1,131^st place; Chinese: 1,050^th place)

On “Quantum Supremacy”. IBM Research Blog. 2019-10-22 [2019-10-27]. （原始内容存档于2021-11-11）（美国英语）.

ieee.org (Global: 652^nd place; Chinese: 712^th place)

spectrum.ieee.org

Google Plans to Demonstrate the Supremacy of Quantum Computing. IEEE Spectrum: Technology, Engineering, and Science News. [2018-01-11]. （原始内容存档于2021-04-25）.
CES 2018: Intel's 49-Qubit Chip Shoots for Quantum Supremacy. IEEE Spectrum: Technology, Engineering, and Science News. [2017-07-22]. （原始内容存档于2021-03-23）.

lib.ru (Global: 1,588^th place; Chinese: 4,531^st place)

publ.lib.ru

Manin, Yu. I. Vychislimoe i nevychislimoe [Computable and Noncomputable]. Sov.Radio. 1980: 13–15 [2013-03-04]. （原始内容存档于2013-05-10）（俄语）.

nature.com (Global: 234^th place; Chinese: 227^th place)

Lund, A. P.; Bremner, Michael J.; Ralph, T. C. Quantum sampling problems, BosonSampling and quantum supremacy. Npj Quantum Information. 2017-04-13, 3 (1): 15 [2019-10-23]. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. arXiv:1702.03061 . doi:10.1038/s41534-017-0018-2. （原始内容存档于2021-03-08）.
Knill, E. Quantum computing with realistically noisy devices. Nature. 2005-03-03, 434 (7029): 39–44 [2019-10-23]. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. arXiv:quant-ph/0410199 . doi:10.1038/nature03350. （原始内容存档于2009-06-28）.
Arute, Frank; et al. Quantum supremacy using a programmable superconducting processor. 自然期刊. 23 October 2019, 574: 505–510 [25 October 2019]. doi:10.1038/s41586-019-1666-5. （原始内容存档于2019-10-23）.

newscientist.com (Global: 774^th place; Chinese: 706^th place)

Google's quantum computing plans threatened by IBM curveball. 2017-10-20 [2017-10-22]. （原始内容存档于2021-01-25）.

nih.gov (Global: 4^th place; Chinese: 5^th place)

ncbi.nlm.nih.gov

Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. Average-case complexity versus approximate simulation of commuting quantum computations. Physical Review Letters. 2016-08-18, 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu. Universal linear optics. Science. 2015-08-14, 349 (6249): 711–716 [2019-10-23]. ISSN 0036-8075. PMID 26160375. arXiv:1505.01182 . doi:10.1126/science.aab3642. （原始内容存档于2020-12-16）.
Steane, A. M. Error Correcting Codes in Quantum Theory. Physical Review Letters. 1996-07-29, 77 (5): 793–797. Bibcode:1996PhRvL..77..793S. PMID 10062908. doi:10.1103/PhysRevLett.77.793.
Knill, E. Quantum computing with realistically noisy devices. Nature. 2005-03-03, 434 (7029): 39–44 [2019-10-23]. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. arXiv:quant-ph/0410199 . doi:10.1038/nature03350. （原始内容存档于2009-06-28）.

nist.gov (Global: 355^th place; Chinese: 411^th place)

math.nist.gov

Jordan, Stephen. Quantum Algorithm Zoo. math.nist.gov. [2017-07-29]. （原始内容存档于2018-04-29）.

qq.com (Global: 381^st place; Chinese: 15^th place)

new.qq.com

谷歌声索“量子霸权”，IBM不服. 腾讯新闻. [2019-10-27]. （原始内容存档于2020-12-04）.

sciencemag.org (Global: 857^th place; Chinese: 506^th place)

science.sciencemag.org

Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu. Universal linear optics. Science. 2015-08-14, 349 (6249): 711–716 [2019-10-23]. ISSN 0036-8075. PMID 26160375. arXiv:1505.01182 . doi:10.1126/science.aab3642. （原始内容存档于2020-12-16）.

scientificamerican.com (Global: 896^th place; Chinese: 1,333^rd place)

A New "Law" Suggests Quantum Supremacy Could Happen This Year. Quanta Magazine. 2019-06-21 [2019-10-23]. （原始内容存档于2021-03-02） –通过Scientific American, Daily Digest.

sina.com.cn (Global: 144^th place; Chinese: 3^rd place)

finance.sina.com.cn

澎湃新闻. 潘建伟团队实现量子优越性：特定问题比顶级超算快百万亿倍. finance.sina.com.cn. 2020-12-04 [2020-12-12].
观察者网. 谷歌声索"量子霸权" IBM不服:尚未实现吧. finance.sina.com.cn. 2019-10-24 [2019-10-27]. （原始内容存档于2019-10-24）.

springer.com (Global: 274^th place; Chinese: 320^th place)

Bernstein, Daniel. Post-Quantum Cryptography. Springer. 2009 [2019-10-23]. ISBN 9783540887010. （原始内容存档于2021-05-11）（英语）.

sputniknews.com (Global: 2,033^rd place; Chinese: 2,367^th place)

Ivanka Trump Congratulates US on Achieving 'Quantum Supremacy'. sputniknews.com. [2019-10-27]. （原始内容存档于2021-01-02）（英语）.

technologyreview.com (Global: 1,943^rd place; Chinese: 2,036^th place)

Harris, Mark. Google has enlisted NASA to help it prove quantum supremacy within months. MIT Technology Review. [2018-11-30]. （原始内容存档于2020-03-10）（英语）.

telegraph.co.uk (Global: 30^th place; Chinese: 111^th place)

IBM unveils world's first commercial quantum computer （页面存档备份，存于互联网档案馆） The Telegraph 2019年1月8日

umbc.edu (Global: low place; Chinese: low place)

csee.umbc.edu

Vazirani, Umesh. A Survey of Quantum Complexity Theory (PDF). Proceedings of Symposia in Applied Mathematics. [2019-10-23]. （原始内容存档 (PDF)于2021-05-07）.

web.archive.org (Global: 1^st place; Chinese: 1^st place)

Manin, Yu. I. Vychislimoe i nevychislimoe [Computable and Noncomputable]. Sov.Radio. 1980: 13–15 [2013-03-04]. （原始内容存档于2013-05-10）（俄语）.
Google Plans to Demonstrate the Supremacy of Quantum Computing. IEEE Spectrum: Technology, Engineering, and Science News. [2018-01-11]. （原始内容存档于2021-04-25）.
CES 2018: Intel's 49-Qubit Chip Shoots for Quantum Supremacy. IEEE Spectrum: Technology, Engineering, and Science News. [2017-07-22]. （原始内容存档于2021-03-23）.
最快！我国量子计算机实现算力全球领先. 新华网. [2020-12-04]. （原始内容存档于2020-12-12）.
Vazirani, Umesh. A Survey of Quantum Complexity Theory (PDF). Proceedings of Symposia in Applied Mathematics. [2019-10-23]. （原始内容存档 (PDF)于2021-05-07）.
Lund, A. P.; Bremner, Michael J.; Ralph, T. C. Quantum sampling problems, BosonSampling and quantum supremacy. Npj Quantum Information. 2017-04-13, 3 (1): 15 [2019-10-23]. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. arXiv:1702.03061 . doi:10.1038/s41534-017-0018-2. （原始内容存档于2021-03-08）.
Jordan, Stephen. Quantum Algorithm Zoo. math.nist.gov. [2017-07-29]. （原始内容存档于2018-04-29）.
Bernstein, Daniel. Post-Quantum Cryptography. Springer. 2009 [2019-10-23]. ISBN 9783540887010. （原始内容存档于2021-05-11）（英语）.
Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu. Universal linear optics. Science. 2015-08-14, 349 (6249): 711–716 [2019-10-23]. ISSN 0036-8075. PMID 26160375. arXiv:1505.01182 . doi:10.1126/science.aab3642. （原始内容存档于2020-12-16）.
Neville, Alex; Sparrow, Chris; Clifford, Raphaël; Johnston, Eric; Birchall, Patrick M.; Montanaro, Ashley; Laing, Anthony. No imminent quantum supremacy by boson sampling. Nature Physics. 2017-10-02, 13 (12): 1153–1157 [2019-10-23]. ISSN 1745-2473. arXiv:1705.00686 . doi:10.1038/nphys4270. （原始内容存档于2020-08-06）.
Google's quantum computing plans threatened by IBM curveball. 2017-10-20 [2017-10-22]. （原始内容存档于2021-01-25）.
Knill, E. Quantum computing with realistically noisy devices. Nature. 2005-03-03, 434 (7029): 39–44 [2019-10-23]. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. arXiv:quant-ph/0410199 . doi:10.1038/nature03350. （原始内容存档于2009-06-28）.
Harris, Mark. Google has enlisted NASA to help it prove quantum supremacy within months. MIT Technology Review. [2018-11-30]. （原始内容存档于2020-03-10）（英语）.
IBM unveils world's first commercial quantum computer （页面存档备份，存于互联网档案馆） The Telegraph 2019年1月8日
A New "Law" Suggests Quantum Supremacy Could Happen This Year. Quanta Magazine. 2019-06-21 [2019-10-23]. （原始内容存档于2021-03-02） –通过Scientific American, Daily Digest.
中國量子電腦原型機「九章」問世　速度快Google「懸鈴木」百億倍. [2020-12-04]. （原始内容存档于2020-12-04）.
Google claims to have reached quantum supremacy. Financial times. 2019-09-21 [2019-10-23]. （原始内容存档于2021-04-29）.
On “Quantum Supremacy”. IBM Research Blog. 2019-10-22 [2019-10-27]. （原始内容存档于2021-11-11）（美国英语）.
谷歌声索“量子霸权”，IBM不服. 腾讯新闻. [2019-10-27]. （原始内容存档于2020-12-04）.
Arute, Frank; et al. Quantum supremacy using a programmable superconducting processor. 自然期刊. 23 October 2019, 574: 505–510 [25 October 2019]. doi:10.1038/s41586-019-1666-5. （原始内容存档于2019-10-23）.
John Martinis. Quantum Supremacy Using a Programmable Superconducting Processor. 2019-10-23. （原始内容存档于2019-10-23）.
Ivanka Trump Congratulates US on Achieving 'Quantum Supremacy'. sputniknews.com. [2019-10-27]. （原始内容存档于2021-01-02）（英语）.
观察者网. 谷歌声索"量子霸权" IBM不服:尚未实现吧. finance.sina.com.cn. 2019-10-24 [2019-10-27]. （原始内容存档于2019-10-24）.

worldcat.org (Global: 5^th place; Chinese: 12^th place)

Papageorgiou, Anargyros; Traub, Joseph F. Measures of quantum computing speedup. Physical Review A. 2013-08-12, 88 (2): 022316. Bibcode:2013PhRvA..88b2316P. ISSN 1050-2947. arXiv:1307.7488 . doi:10.1103/PhysRevA.88.022316.
Feynman, Richard P. Simulating Physics with Computers. International Journal of Theoretical Physics. 1982-06-01, 21 (6–7): 467–488. Bibcode:10.1.1.45.9310 请检查|bibcode=值 (帮助). ISSN 0020-7748. doi:10.1007/BF02650179.
Shor, P. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Review. 1999-01-01, 41 (2): 303–332. Bibcode:1999SIAMR..41..303S. ISSN 0036-1445. arXiv:quant-ph/9508027 . doi:10.1137/S0036144598347011.
Lund, A. P.; Bremner, Michael J.; Ralph, T. C. Quantum sampling problems, BosonSampling and quantum supremacy. Npj Quantum Information. 2017-04-13, 3 (1): 15 [2019-10-23]. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. arXiv:1702.03061 . doi:10.1038/s41534-017-0018-2. （原始内容存档于2021-03-08）.
Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. Average-case complexity versus approximate simulation of commuting quantum computations. Physical Review Letters. 2016-08-18, 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Rivest, R. L.; Shamir, A.; Adleman, L. A Method for Obtaining Digital Signatures and Public-key Cryptosystems. Commun. ACM. February 1978, 21 (2): 120–126. Bibcode:10.1.1.607.2677 请检查|bibcode=值 (帮助). ISSN 0001-0782. doi:10.1145/359340.359342.
Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu. Universal linear optics. Science. 2015-08-14, 349 (6249): 711–716 [2019-10-23]. ISSN 0036-8075. PMID 26160375. arXiv:1505.01182 . doi:10.1126/science.aab3642. （原始内容存档于2020-12-16）.
Neville, Alex; Sparrow, Chris; Clifford, Raphaël; Johnston, Eric; Birchall, Patrick M.; Montanaro, Ashley; Laing, Anthony. No imminent quantum supremacy by boson sampling. Nature Physics. 2017-10-02, 13 (12): 1153–1157 [2019-10-23]. ISSN 1745-2473. arXiv:1705.00686 . doi:10.1038/nphys4270. （原始内容存档于2020-08-06）.
Knill, E. Quantum computing with realistically noisy devices. Nature. 2005-03-03, 434 (7029): 39–44 [2019-10-23]. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. arXiv:quant-ph/0410199 . doi:10.1038/nature03350. （原始内容存档于2009-06-28）.

xinhuanet.com (Global: 309^th place; Chinese: 19^th place)

最快！我国量子计算机实现算力全球领先. 新华网. [2020-12-04]. （原始内容存档于2020-12-12）.

量子计算优越性 (Chinese Wikipedia)

archive.org (Global: 6th place; Chinese: 4th place)

arxiv.org (Global: 69th place; Chinese: 254th place)

doi.org (Global: 2nd place; Chinese: 23rd place)

ft.com (Global: 210th place; Chinese: 353rd place)

googleblog.com (Global: 1,272nd place; Chinese: 2,099th place)

ai.googleblog.com

harvard.edu (Global: 18th place; Chinese: 57th place)

ui.adsabs.harvard.edu

hk01.com (Global: 379th place; Chinese: 11th place)

ibm.com (Global: 1,131st place; Chinese: 1,050th place)

ieee.org (Global: 652nd place; Chinese: 712th place)

spectrum.ieee.org

lib.ru (Global: 1,588th place; Chinese: 4,531st place)

publ.lib.ru

nature.com (Global: 234th place; Chinese: 227th place)

newscientist.com (Global: 774th place; Chinese: 706th place)

nih.gov (Global: 4th place; Chinese: 5th place)