Quantum Boson-Sampling Machine

In the Post-Moore law era, Quantum computing, as a novel promising computing technology, is paid great attention to, since quantum algorithms are able to offer exponential speed-up over the classical ones. However, despite the various means for the implementation of a universal quantum computer, it´s desperately hard to build one. Fortunately, a computing model called Boson-Sampling is able to show the great power of quantum computing. The device that conducts the simulation process of Boson-Sampling based on quantum computing is called Quantum Boson-Sampling Machine (QBSM) while this simulation on a classical computer is intractable. In this paper, we introduce the boson-sampling process, analyze the difficulty of Boson-Sampling on classical computing, describe the advantages of Boson-Sampling, list the resent physical experiments that implemented QBSMs, and discuss the further research of Boson-Sampling.