561
个编辑
更改
→Quantum supremacy
约翰 · 普雷斯基尔提出了'''<font color="#ff8000"> 量子优势Quantum supremacy</font>'''这一术语，指的是量子计算机在某一领域相对于经典计算机的假设加速优势。谷歌在2017年宣布，它希望在今年年底前实现'''<font color="#ff8000"> 量子优势</font>'''，尽管这一目标没有实现。IBM 在2018年表示，最好的经典计算机将在大约5年内在某些实际任务上被击败，并将'''<font color="#ff8000"> 量子优势</font>'''测试视为未来的潜在基准。尽管像吉尔 · 卡莱这样的怀疑者对量子优势的实现持怀疑态度，但在2019年10月，据报道，与谷歌人工智能量子公司合作开发的 Sycamore 处理器已经取得了量子优势，其计算速度是顶峰计算机的300万倍以上，顶峰计算机被公认为世界上最快的计算机。比尔 · 安鲁在1994年发表的一篇论文中对量子计算机的实用性表示怀疑。认为一台400量子位的计算机甚至会与全息原理宇宙理论暗示的宇宙学信息发生冲突。
约翰 · 普雷斯基尔提出了'''<font color="#ff8000"> 量子优势Quantum supremacy</font>'''这一术语，指的是量子计算机在某一领域相对于经典计算机的假设加速优势。谷歌在2017年宣布，它希望在今年年底前实现'''<font color="#ff8000"> 量子优势</font>'''，尽管这一目标没有实现。IBM 在2018年表示，最好的经典计算机将在大约5年内在某些实际任务上被击败，并将'''<font color="#ff8000"> 量子优势</font>'''测试视为未来的潜在基准。尽管像吉尔 · 卡莱这样的怀疑者对量子优势的实现持怀疑态度，但在2019年10月，据报道，与谷歌人工智能量子公司合作开发的 Sycamore 处理器已经取得了量子优势，其计算速度是顶峰计算机的300万倍以上，顶峰计算机被公认为世界上最快的计算机。比尔 · 安鲁在1994年发表的一篇论文中对量子计算机的实用性表示怀疑。认为一台400量子位的计算机甚至会与全息原理宇宙理论暗示的宇宙学信息发生冲突。
=== Quantum supremacy ===
=== Quantum supremacy 量子至上===
{{Main|Quantum supremacy}}
{{Main|Quantum supremacy}}
[[John Preskill]] has introduced the term ''[[quantum supremacy]]'' to refer to the hypothetical speedup advantage that a quantum computer would have over a classical computer in a certain field.<ref>{{Cite journal|title=Characterizing Quantum Supremacy in Near-Term Devices|journal=Nature Physics|volume=14|issue=6|pages=595–600|first1=Sergio|last1=Boixo|first2=Sergei V.|last2=Isakov|first3=Vadim N.|last3=Smelyanskiy|first4=Ryan|last4=Babbush|first5=Nan|last5=Ding|first6=Zhang|last6=Jiang|first7=Michael J.|last7=Bremner|first8=John M.|last8=Martinis|first9=Hartmut|last9=Neven|year=2018|arxiv=1608.00263|doi=10.1038/s41567-018-0124-x|bibcode=2018NatPh..14..595B|s2cid=4167494}}</ref> [[Google]] announced in 2017 that it expected to achieve quantum supremacy by the end of the year though that did not happen. [[IBM]] said in 2018 that the best classical computers will be beaten on some practical task within about five years and views the quantum supremacy test only as a potential future benchmark.<ref>{{cite web|url=https://www.scientificamerican.com/article/quantum-computers-compete-for-supremacy/|title=Quantum Computers Compete for "Supremacy"|first=Neil|last=Savage}}</ref> Although skeptics like [[Gil Kalai]] doubt that quantum supremacy will ever be achieved,<ref>{{cite web|url=https://rjlipton.wordpress.com/2016/04/22/quantum-supremacy-and-complexity/|title=Quantum Supremacy and Complexity|date=23 April 2016}}</ref><ref>{{cite web|last1=Kalai|first1=Gil|title=The Quantum Computer Puzzle|url=http://www.ams.org/journals/notices/201605/rnoti-p508.pdf|publisher=AMS}}</ref> in October 2019, a [[Sycamore processor]] created in conjunction with Google AI Quantum was reported to have achieved quantum supremacy,<ref>{{cite journal|last1=Arute|first1=Frank|last2=Arya|first2=Kunal|last3=Babbush|first3=Ryan|last4=Bacon|first4=Dave|last5=Bardin|first5=Joseph C.|last6=Barends|first6=Rami|last7=Biswas|first7=Rupak|last8=Boixo|first8=Sergio|last9=Brandao|first9=Fernando G. S. L.|last10=Buell|first10=David A.|last11=Burkett|first11=Brian|date=23 October 2019|title=Quantum supremacy using a programmable superconducting processor|journal=Nature|volume=574|issue=7779|first15=Roberto|first57=Murphy Yuezhen|last64=Rubin|first63=Pedram|last63=Roushan|first62=Eleanor G.|last62=Rieffel|first61=Chris|last61=Quintana|first60=John C.|last60=Platt|first59=Andre|last59=Petukhov|first58=Eric|last58=Ostby|last57=Niu|last65=Sank|first56=Charles|last56=Neill|first55=Matthew|last55=Neeley|first54=Ofer|last54=Naaman|first53=Josh|last53=Mutus|first52=Masoud|last52=Mohseni|first51=Kristel|last51=Michielsen|first50=Xiao|last50=Mi|first64=Nicholas C.|first65=Daniel|last49=Megrant|last74=Yeh|last12=Chen|first12=Yu|last13=Chen|first13=Zijun|last14=Chiaro|first14=Ben|first77=John M.|last77=Martinis|first76=Hartmut|last76=Neven|first75=Adam|last75=Zalcman|first74=Ping|first73=Z. Jamie|last66=Satzinger|last73=Yao|first72=Theodore|last72=White|first71=Benjamin|last71=Villalonga|first70=Amit|last70=Vainsencher|first69=Matthew D.|last69=Trevithick|first68=Kevin J.|last68=Sung|first67=Vadim|last67=Smelyanskiy|first66=Kevin J.|first49=Anthony|first48=Matthew|last16=Courtney|last24=Guerin|first30=Trent|last30=Huang|first29=Markus|last29=Hoffman|first28=Alan|last28=Ho|first27=Michael J.|last27=Hartmann|first26=Matthew P.|last26=Harrigan|first25=Steve|last25=Habegger|first24=Keith|first23=Rob|first31=Travis S.|last23=Graff|first22=Marissa|last22=Giustina|first21=Craig|last21=Gidney|first20=Austin|last20=Fowler|first19=Brooks|last19=Foxen|first18=Edward|last18=Farhi|first17=Andrew|last17=Dunsworsth|first16=William|last31=Humble|last32=Isakov|last48=McEwen|first40=Alexander|first47=Jarrod R.|last47=McClean|first46=Salvatore|last46=Mandrà|first45=Dmitry|last45=Lyakh|first44=Erik|last44=Lucero|first43=Mike|last43=Lindmark|first42=David|last42=Landhuis|first41=Fedor|last15=Collins|last40=Korotov|first32=Sergei V.|first39=Sergey|last39=Knysh|first38=Paul V.|last38=Klimov|first37=Julian|last37=Kelly|first36=Kostyantyn|last36=Kechedzhi|first35=Dvir|last35=Kafri|first34=Zhang|last34=Jiang|first33=Evan|last33=Jeffery|last41=Kostritsa|doi=10.1038/s41586-019-1666-5|pmid=31645734|pages=505–510|bibcode=2019Natur.574..505A|arxiv=1910.11333|s2cid=204836822}}</ref> with calculations more than 3,000,000 times as fast as those of [[Summit (supercomputer)|Summit]], generally considered the world's fastest computer.<ref>{{Cite web|url=https://www.technologyreview.com/f/614416/google-researchers-have-reportedly-achieved-quantum-supremacy/|title=Google researchers have reportedly achieved "quantum supremacy"|website=MIT Technology Review}}</ref> [[Bill Unruh]] doubted the practicality of quantum computers in a paper published back in 1994.<ref>{{Cite journal|last1=Unruh|first1=Bill|title=Maintaining coherence in Quantum Computers|journal=Physical Review A|volume=51|issue=2|pages=992–997|arxiv=hep-th/9406058|bibcode=1995PhRvA..51..992U|year=1995|doi=10.1103/PhysRevA.51.992|pmid=9911677|s2cid=13980886}}</ref> [[Paul Davies]] argued that a 400-qubit computer would even come into conflict with the cosmological information bound implied by the [[holographic principle]].<ref>{{cite web|last1=Davies|first1=Paul|title=The implications of a holographic universe for quantum information science and the nature of physical law|url=http://power.itp.ac.cn/~mli/pdavies.pdf|publisher=Macquarie University}}</ref>
[[John Preskill]] has introduced the term ''[[quantum supremacy]]'' to refer to the hypothetical speedup advantage that a quantum computer would have over a classical computer in a certain field.<ref>{{Cite journal|title=Characterizing Quantum Supremacy in Near-Term Devices|journal=Nature Physics|volume=14|issue=6|pages=595–600|first1=Sergio|last1=Boixo|first2=Sergei V.|last2=Isakov|first3=Vadim N.|last3=Smelyanskiy|first4=Ryan|last4=Babbush|first5=Nan|last5=Ding|first6=Zhang|last6=Jiang|first7=Michael J.|last7=Bremner|first8=John M.|last8=Martinis|first9=Hartmut|last9=Neven|year=2018|arxiv=1608.00263|doi=10.1038/s41567-018-0124-x|bibcode=2018NatPh..14..595B|s2cid=4167494}}</ref> [[Google]] announced in 2017 that it expected to achieve quantum supremacy by the end of the year though that did not happen. [[IBM]] said in 2018 that the best classical computers will be beaten on some practical task within about five years and views the quantum supremacy test only as a potential future benchmark.<ref>{{cite web|url=https://www.scientificamerican.com/article/quantum-computers-compete-for-supremacy/|title=Quantum Computers Compete for "Supremacy"|first=Neil|last=Savage}}</ref> Although skeptics like [[Gil Kalai]] doubt that quantum supremacy will ever be achieved,<ref>{{cite web|url=https://rjlipton.wordpress.com/2016/04/22/quantum-supremacy-and-complexity/|title=Quantum Supremacy and Complexity|date=23 April 2016}}</ref><ref>{{cite web|last1=Kalai|first1=Gil|title=The Quantum Computer Puzzle|url=http://www.ams.org/journals/notices/201605/rnoti-p508.pdf|publisher=AMS}}</ref> in October 2019, a [[Sycamore processor]] created in conjunction with Google AI Quantum was reported to have achieved quantum supremacy,<ref>{{cite journal|last1=Arute|first1=Frank|last2=Arya|first2=Kunal|last3=Babbush|first3=Ryan|last4=Bacon|first4=Dave|last5=Bardin|first5=Joseph C.|last6=Barends|first6=Rami|last7=Biswas|first7=Rupak|last8=Boixo|first8=Sergio|last9=Brandao|first9=Fernando G. S. L.|last10=Buell|first10=David A.|last11=Burkett|first11=Brian|date=23 October 2019|title=Quantum supremacy using a programmable superconducting processor|journal=Nature|volume=574|issue=7779|first15=Roberto|first57=Murphy Yuezhen|last64=Rubin|first63=Pedram|last63=Roushan|first62=Eleanor G.|last62=Rieffel|first61=Chris|last61=Quintana|first60=John C.|last60=Platt|first59=Andre|last59=Petukhov|first58=Eric|last58=Ostby|last57=Niu|last65=Sank|first56=Charles|last56=Neill|first55=Matthew|last55=Neeley|first54=Ofer|last54=Naaman|first53=Josh|last53=Mutus|first52=Masoud|last52=Mohseni|first51=Kristel|last51=Michielsen|first50=Xiao|last50=Mi|first64=Nicholas C.|first65=Daniel|last49=Megrant|last74=Yeh|last12=Chen|first12=Yu|last13=Chen|first13=Zijun|last14=Chiaro|first14=Ben|first77=John M.|last77=Martinis|first76=Hartmut|last76=Neven|first75=Adam|last75=Zalcman|first74=Ping|first73=Z. Jamie|last66=Satzinger|last73=Yao|first72=Theodore|last72=White|first71=Benjamin|last71=Villalonga|first70=Amit|last70=Vainsencher|first69=Matthew D.|last69=Trevithick|first68=Kevin J.|last68=Sung|first67=Vadim|last67=Smelyanskiy|first66=Kevin J.|first49=Anthony|first48=Matthew|last16=Courtney|last24=Guerin|first30=Trent|last30=Huang|first29=Markus|last29=Hoffman|first28=Alan|last28=Ho|first27=Michael J.|last27=Hartmann|first26=Matthew P.|last26=Harrigan|first25=Steve|last25=Habegger|first24=Keith|first23=Rob|first31=Travis S.|last23=Graff|first22=Marissa|last22=Giustina|first21=Craig|last21=Gidney|first20=Austin|last20=Fowler|first19=Brooks|last19=Foxen|first18=Edward|last18=Farhi|first17=Andrew|last17=Dunsworsth|first16=William|last31=Humble|last32=Isakov|last48=McEwen|first40=Alexander|first47=Jarrod R.|last47=McClean|first46=Salvatore|last46=Mandrà|first45=Dmitry|last45=Lyakh|first44=Erik|last44=Lucero|first43=Mike|last43=Lindmark|first42=David|last42=Landhuis|first41=Fedor|last15=Collins|last40=Korotov|first32=Sergei V.|first39=Sergey|last39=Knysh|first38=Paul V.|last38=Klimov|first37=Julian|last37=Kelly|first36=Kostyantyn|last36=Kechedzhi|first35=Dvir|last35=Kafri|first34=Zhang|last34=Jiang|first33=Evan|last33=Jeffery|last41=Kostritsa|doi=10.1038/s41586-019-1666-5|pmid=31645734|pages=505–510|bibcode=2019Natur.574..505A|arxiv=1910.11333|s2cid=204836822}}</ref> with calculations more than 3,000,000 times as fast as those of [[Summit (supercomputer)|Summit]], generally considered the world's fastest computer.<ref>{{Cite web|url=https://www.technologyreview.com/f/614416/google-researchers-have-reportedly-achieved-quantum-supremacy/|title=Google researchers have reportedly achieved "quantum supremacy"|website=MIT Technology Review}}</ref> [[Bill Unruh]] doubted the practicality of quantum computers in a paper published back in 1994.<ref>{{Cite journal|last1=Unruh|first1=Bill|title=Maintaining coherence in Quantum Computers|journal=Physical Review A|volume=51|issue=2|pages=992–997|arxiv=hep-th/9406058|bibcode=1995PhRvA..51..992U|year=1995|doi=10.1103/PhysRevA.51.992|pmid=9911677|s2cid=13980886}}</ref> [[Paul Davies]] argued that a 400-qubit computer would even come into conflict with the cosmological information bound implied by the [[holographic principle]].<ref>{{cite web|last1=Davies|first1=Paul|title=The implications of a holographic universe for quantum information science and the nature of physical law|url=http://power.itp.ac.cn/~mli/pdavies.pdf|publisher=Macquarie University}}</ref>
[[John Preskill]]引入了“[[量子至上]]”一词来指量子计算机在某一领域相对于经典计算机所具有的假设加速优势。[[Google]]在2017年宣布，它预计将在今年年底实现量子霸权，但这并没有实现。[[IBM]]在2018年表示，最好的经典计算机将在大约五年内完成一些实际任务，并将量子优势测试视为未来潜在的基准。尽管像[[Gil Kalai]]这样的怀疑论者怀疑量子霸权是否会实现，据报道，2019年10月，与谷歌AI Quantum联合创建的[[Sycamore processor]]实现了量子优势，它的计算速度是世界上最快的计算机[[Summit（supercomputer）| Summit]]的300多万倍。[[Paul Davies]]认为，一台400 量子比特的计算机甚至会与[[全息原理]所隐含的宇宙信息界发生冲突。
There are a number of technical challenges in building a large-scale quantum computer. Physicist David DiVincenzo has listed the following requirements for a practical quantum computer:
There are a number of technical challenges in building a large-scale quantum computer. Physicist David DiVincenzo has listed the following requirements for a practical quantum computer: