A benchmark test of boson sampling on Tianhe-2 supercomputer. Issue 5 (31st July 2018)

• Record Type: Journal Article
• Authors: Wu, Junjie; Liu, Yong; Zhang, Baida; Jin, Xianmin; Wang, Yang; Wang, Huiquan; Yang, Xuejun
• Is Part Of: National science review. Volume 5:Issue 5(2018)
• Page Start: 715
• Page End: 720
• Publication Date: 2018-07-31
• Subjects: boson sampling -- permanent -- quantum supremacy -- quantum computing -- supercomputer; Science -- Periodicals; 505
• DOI: 10.1093/nsr/nwy079
• Languages: English
• ISSNs: 2095-5138

Abstract

Abstract: Boson sampling, thought to be intractable classically, can be solved by a quantum machine composed of merely generation, linear evolution and detection of single photons. Such an analog quantum computer for this specific problem provides a shortcut to boost the absolute computing power of quantum computers to beat classical ones. However, the capacity bound of classical computers for simulating boson sampling has not yet been identified. Here we simulate boson sampling on the Tianhe-2 supercomputer, which occupied the first place in the world ranking six times from 2013 to 2016. We computed the permanent of the largest matrix using up to 312 000 CPU cores of Tianhe-2, and inferred from the current most efficient permanent-computing algorithms that an upper bound on the performance of Tianhe-2 is one 50-photon sample per ∼100 min. In addition, we found a precision issue with one of two permanent-computing algorithms.