Google研究團隊首次證明了量子霸權(quán)
《英國金融時報》的一篇報告稱，John Martinis帶領(lǐng)的一個Google研究團隊首次證明了量子霸權(quán)。
This is the point at which a quantum computer is shown to be capable of performing a task that’s beyond the reach of even the most powerful conventional supercomputer.
當(dāng)時發(fā)現(xiàn)一臺量子計算機能完成最強大的傳統(tǒng)超級計算機都不能完成的任務(wù)。
The claim appeared in a paper that was posted on a NASA website, but the publication was then taken down. Google did not respond to a request for comment from MIT Technology Review.
這一聲明出現(xiàn)在NASA網(wǎng)站上發(fā)表的一篇論文中，但隨后被刪除了。《麻省理工科技評論》請求Google對此作出評論，但未得到回應(yīng)。
Google struck an agreement last year to use supercomputers available to NASA as benchmarks for its supremacy experiments.
去年Google決定將NASA可用的超級計算機作為霸權(quán)實驗的標桿。
According to the Financial Times report, the paper said that Google’s quantum processor was able to perform a calculation in three minutes and 20 seconds that would take today’s most advanced supercomputer, known as Summit, around 10,000 years.
據(jù)《英國金融時報》報道，該論文稱Google的量子處理器能在3分20秒內(nèi)完成現(xiàn)在最先進的超級計算機Summit一萬年才能完成的計算。
In the paper, the researchers said that, to their knowledge, the experiment “marks the first computation that can only be performed on a quantum processor.”
該論文中研究人員稱，據(jù)他們所知這一實驗“標志著第一個只能在量子處理器上進行的計算”。
Quantum machines are so powerful because they harness quantum bits, or qubits. Unlike classical bits, which represent either a 1 or a 0, qubits can be in a kind of combination of both at the same time.
量子計算機如此強大是因為他們利用了量子比特或量子位。經(jīng)典的二進制只代表1或0，而量子位不一樣，可以同時是兩者的一種組合。
Thanks to other quantum phenomena, which are described in our explainer here, quantum computers can crunch large amounts of data in parallel that conventional machines have to work through sequentially.
多虧了其他我們在解釋中描述過的量子現(xiàn)象，量子計算機可以并行運算大量數(shù)據(jù)，而傳統(tǒng)計算機只能按順序進行運算。
Scientists have been working for years to demonstrate that the machines can definitively outperform conventional ones.
科學(xué)家已研究多年，想要證明量子計算機絕對優(yōu)于傳統(tǒng)計算機。
