Benchmarking 50-Photon Gaussian Boson Sampling on the Sunway TaihuLight
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
Boson sampling is expected to be an important milestone that will demonstrate quantum computational advantage (or quantum supremacy). This work establishes the benchmarking of Gaussian boson sampling (GBS) with threshold detection based on the Sunway TaihuLight supercomputer. To achieve the best performance and provide a competitive scenario for future quantum computing studies, the selected simulation algorithm is fully optimized based on a set of innovative approaches, including a parallel framework with almost perfect load balance and an instruction-level optimizing scheme based on a shortest-path-based instruction scheduling. In addition, data precision is carefully processed by an integer-instruction-based and multiple-precision fixed-point implementation, including 128- and 256-bit precison mode, which can be appropriately selected based on an adaptive precision optimizing scheme. Based on these methods, a highly efficient parallel quantum sampling algorithm is designed. The largest run enables us to obtain one Torontonian function of a$100\times 100$submatrix from 50-photon GBS within 20 hours in 128-bit precision and 2 days in 256-bit precision. To our knowledge, this was the largest quantum computing simulation based on Boson Sampling by using modern supercomputers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405 · cited 3×
“2020 [14], and was claimed to be a significant milestone in achieving quantum computational advantage.”
BackgroundMethodInfluentialSelf-citationImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“classes are the direct evolutions of the quantum state [25], [27], [33], [34], [35] and the perturbation of stabilizer circuits [36], [37], [38], respectively.”
BackgroundCharacterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Boson Sampling on a Photonic Chip
Spring, J. B., Metcalf, B. J., Humphreys, P. C., Kolthammer, W. S., Jin, X.-M., Barbieri, M., Datta, A., Thomas-Peter, N., Langford, N. K., Kundys, D., et al. (2013) · Science · doi:10.1126/science.1231692 · Cited by 837
Tillmann, M., Dakić, B., Heilmann, R., Nolte, S., Szameit, A., & Walther, P. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.102 · Cited by 709
Integrated multimode interferometers with arbitrary designs for photonic boson sampling
Crespi, A., Osellame, R., Ramponi, R., Brod, D. J., Galvão, E. F., Spagnolo, N., Vitelli, C., Maiorino, E., Mataloni, P., & Sciarrino, F. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.112 · Cited by 662 · cited 2×
“Several algorithms have been designed and experiments have been conducted referring to such approaches [36], [37], [38], [39], [40].”
BackgroundMethodPhotonic Boson Sampling in a Tunable Circuit
Broome, M. A., Fedrizzi, A., Rahimi-Keshari, S., Dove, J., Aaronson, S., Ralph, T. C., & White, A. G. (2013) · Science · doi:10.1126/science.1231440 · Cited by 634 · cited 2×
“In terms of the classical benchmarks of boson-based methods, several algorithms have been designed, and experiments have been conducted [46], [47], [48], [49], [50].”
BackgroundMethod
Cited by
Quantum computational advantage with a programmable photonic processor
Madsen, L. S., Laudenbach, F., Askarani, M. F., Rortais, F., Vincent, T., Bulmer, J. F. F., Miatto, F. M., Neuhaus, L., Helt, L. G., Collins, M. J., et al. (2022) · Nature · doi:10.1038/s41586-022-04725-x · Cited by 1,101
Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
Zhong, H.-S., Deng, Y.-H., Qin, J., Wang, H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Wu, D., Gong, S.-Q., Su, H., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.180502 · Cited by 434
Self-citationQuantum computational advantage via high-dimensional Gaussian boson sampling
Deshpande, A., Mehta, A., Vincent, T., Quesada, N., Hinsche, M., Ioannou, M., Madsen, L., Lavoie, J., Qi, H., Eisert, J., et al. (2022) · Science Advances · doi:10.1126/sciadv.abi7894 · Cited by 106
“Similar to the approach of the Google and USTC supremacy experiments [48, 49], we focus on the former approach— with a classical adversary producing samples according to a noisy model distribution—because these samples are likely to perform at least as well as the actual device in suitable…”
Efficient approximation of experimental Gaussian boson sampling
Villalonga, B., Niu, M. Y., Li, L., Neven, H., Platt, J. C., Smelyanskiy, V. N., & Boixo, S. (2021) · arXiv · doi:10.48550/arxiv.2109.11525 · Cited by 16
Metadata
- Authors
- Li, Y., Gan, L., Chen, M., Chen, Y., Lu, H., Lu, C., Pan, J., Fu, H., & Yang, G.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2022-06-01
- Volume
- 33
- Issue
- 6
- Pages
- 1357-1372
- ISSN
- 1045-9219 (ISSN-L)
- 1558-2183
- 2161-9883
- OpenAlex
- W3201488726
- Cited by
- 19
- References
- 24
- FWCI
- 1.24
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Benchmarking 50-Photon Gaussian Boson Sampling on the Sunway TaihuLight. https://app.cochat.ai/papers/10.1109/tpds.2021.3111185
- The paper
- Li, Y., Gan, L., Chen, M., Chen, Y., Lu, H., Lu, C., Pan, J., Fu, H., & Yang, G. (2022). Benchmarking 50-Photon Gaussian Boson Sampling on the Sunway TaihuLight. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2021.3111185
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.