A classical algorithm to mimic quantum decisions

• 作者: Mile Gu
• 来源期刊: 国家科学评论（英文版）
• 年，卷（期）: 2019,（4）
• 页码范围: 前插2,609
• 页数: 2页
• 语种: 英文
• DOI: 10.1093/nsr/nwz081

摘要

In his famous 1982 lecture, Nobel lau-reate Richard Feynman seeded the idea of quantum computation. He reasoned that the amount of classical information required to describe a quantum system scaled exponentially with its size, and thus could not be efficiently simulated by a classical computer. Indeed, a fairly mod-est system of 100 quantum bits would already require more information to de-scribe than all the present data storage on Earth [1]. Given this, there would likely be computational tasks that achieve quantum supremacy—impossible to per-form practically without the aid of a quan-tum information processor. In the 37 in-tervening years, these initial ideas have solidified, as the discovery of a string of quantum algorithms—from efficient factoring of large numbers to simulat-ing chemical reactions—fueled a race for quantum supremacy.