多光子玻色子采样机在五玻色子采样方面没有击败早期的经典计算机
The Multiphoton Boson Sampling Machine Doesn't Beat Early Classical Computers for Five-boson Sampling
摘要：
本文提出了一种新的计算n * n矩阵积和式的算法--Store-zechin算法，它重复利用存储数据。分析表明，新算法所需的乘法和加法运算次数分别远小于著名的Ryser算法。特别是对于一个5-玻色子采样任务，Store-zechin算法在ENIAC和TRADIC上计算相应的积和式的运行时间比在多光子玻色子采样机上的运行时间要短（简称MPBSM），因此MPBSM并没有击败早期的经典计算机（尽管如此，当n变得足够大时，量子玻色子采样机可能会击败经典计算机）。在计算机上，人们可以设计一个以空间换时间的算法，而在MPBSM上，人们不能这样做，这是通用计算机与MPBSM的最大区别。这种差异正是MPBSM不能被称为（光子）量子计算机的原因。
英文摘要：
A new algorithm which is called Store-zechin, and utilizes stored data repetitively for calculating the permanent of an n * n matrix is proposed. The analysis manifests that the numbers of multiplications and additions taken by the new algorithm are respectively far smaller than those taken by the famous Ryser algorithm. Especially, for a 5-boson sampling task, the running time of the Store-zechin algorithm computing the correspondent permanent on ENIAC as well as TRADIC is lower than that of the sampling operation on a multiphoton boson sampling machine (shortly MPBSM), and thus MPBSM does not beat the early classical computers (despite of this, it is possible that when n gets large enough, a quantum boson sampling machine will beat a classical computer). On a computer, people can design an algorithm that exchanges space for time while on MPBSM, people can not do so, which is the greatest difference between a universal computer and MPBSM. This difference is right the reason why MPBSM may not be called a (photonic) quantum computer.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
