  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.
