{"id":482961,"date":"2026-05-13T17:58:14","date_gmt":"2026-05-13T17:58:14","guid":{"rendered":"https:\/\/www.europesays.com\/ie\/482961\/"},"modified":"2026-05-13T17:58:14","modified_gmt":"2026-05-13T17:58:14","slug":"gaussian-boson-sampling-with-1024-squeezed-states-in-8176-modes","status":"publish","type":"post","link":"https:\/\/www.europesays.com\/ie\/482961\/","title":{"rendered":"Gaussian boson sampling with 1,024 squeezed states in 8,176 modes"},"content":{"rendered":"
  • \n

    Aaronson, S. & Arkhipov, A. The computational complexity of linear optics. Theory Comput. 9<\/b>, 143\u2013252 (2013).<\/p>\n

    Article<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Hamilton, C. S. et al. Gaussian boson sampling. Phys. Rev. Lett. 119<\/b>, 170501 (2017).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Quesada, N., Arrazola, J. M. & Killoran, N. Gaussian boson sampling using threshold detectors. Phys. Rev. A 98<\/b>, 062322 (2018).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Tzitrin, I., Bourassa, J. E., Menicucci, N. C. & Sabapathy, K. K. Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes. Phys. Rev. A 101<\/b>, 032315 (2020).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Bourassa, J. E. et al. Blueprint for a scalable photonic fault-tolerant quantum computer. Quantum 5<\/b>, 392 (2021).<\/p>\n

    Article<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Larsen, M. et al. Integrated photonic source of Gottesman\u2013Kitaev\u2013Preskill qubits. Nature 642<\/b>, 587\u2013591 (2025).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n     PubMed Central<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Zhong, H.-S. et al. Quantum computational advantage using photons. Science 370<\/b>, 1460\u20131463 (2020).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Zhong, H.-S. et al. Phase-programmable Gaussian boson sampling using stimulated squeezed light. Phys. Rev. Lett. 127<\/b>, 180502 (2021).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Madsen, L. S. et al. Quantum computational advantage with a programmable photonic processor. Nature 606<\/b>, 75\u201381 (2022).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n     PubMed Central<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Deng, Y.-H. et al. Gaussian boson sampling with pseudo-photon-number-resolving detectors and quantum computational advantage. Phys. Rev. Lett. 131<\/b>, 150601 (2023).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Oh, C., Liu, M., Alexeev, Y., Fefferman, B. & Jiang, L. Classical algorithm for simulating experimental Gaussian boson sampling. Nat. Phys. 20<\/b>, 1461\u20131468 (2024).<\/p>\n

    Article<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Bouland, A., Fefferman, B., Nirkhe, C. & Vazirani, U. On the complexity and verification of quantum random circuit sampling. Nat. Phys. 15<\/b>, 159\u2013163 (2019).<\/p>\n

    Article<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574<\/b>, 505\u2013510 (2019).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Wu, Y. et al. Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett. 127<\/b>, 180501 (2021).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Morvan, A. et al. Phase transitions in random circuit sampling. Nature 634<\/b>, 328\u2013333 (2024).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n     PubMed Central<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Gao, D. et al. Establishing a new benchmark in quantum computational advantage with 105-qubit Zuchongzhi 3.0 processor. Phys. Rev. Lett. 134<\/b>, 090601 (2025).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Google Quantum AI and Collaborators Observation of constructive interference at the edge of quantum ergodicity. Nature 646<\/b>, 825\u2013830 (2025).<\/p>\n

    Article<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Pan, F., Gu, H., Kuang, L., Liu, B. & Zhang, P. Efficient quantum circuit simulation by tensor network methods on modern GPUs. ACM Trans. Quantum Comput. 5<\/b>, 26:1\u201326:26 (2024).<\/p>\n

    Article<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Zhao, X.-H. et al. Leapfrogging Sycamore: harnessing 1432 GPUs for 7\u00d7 faster quantum random circuit sampling. Natl Sci. Rev. 12<\/b>, nwae317 (2025).<\/p>\n

    Article<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Qi, H., Brod, D. J., Quesada, N. & Garc\u00eda-Patr\u00f3n, R. Regimes of classical simulability for noisy Gaussian boson sampling. Phys. Rev. Lett. 124<\/b>, 100502 (2020).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Villalonga, B. et al. Efficient approximation of experimental Gaussian boson sampling. Preprint at https:\/\/arxiv.org\/abs\/2109.11525<\/a> (2021).<\/p>\n<\/li>\n

  • \n

    Bulmer, J. F. F. et al. The boundary for quantum advantage in Gaussian boson sampling. Sci. Adv. 8<\/b>, eabl9236 (2022).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n     PubMed Central<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Oh, C., Lim, Y., Fefferman, B. & Jiang, L. Classical simulation of boson sampling based on graph structure. Phys. Rev. Lett. 128<\/b>, 190501 (2022).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Oh, C., Jiang, L. & Fefferman, B. Spoofing cross-entropy measure in boson sampling. Phys. Rev. Lett. 131<\/b>, 010401 (2023).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Arrazola, J. M., Bromley, T. R. & Rebentrost, P. Quantum approximate optimization with Gaussian boson sampling. Phys. Rev. A 98<\/b>, 012322 (2018).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Arrazola, J. M. & Bromley, T. R. Using Gaussian boson sampling to find dense subgraphs. Phys. Rev. Lett. 121<\/b>, 030503 (2018).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Banchi, L., Fingerhuth, M., Babej, T., Ing, C. & Arrazola, J. M. Molecular docking with Gaussian boson sampling. Science Advances 6<\/b>, eaax1950 (2020).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n     PubMed Central<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Huh, J., Guerreschi, G. G., Peropadre, B., McClean, J. R. & Aspuru-Guzik, A. Boson sampling for molecular vibronic spectra. Nat. Photonics 9<\/b>, 615\u2013620 (2015).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Jahangiri, S., Arrazola, J. M. & Delgado, A. Quantum algorithm for simulating single-molecule electron transport. Phys. Chem. Lett. 12<\/b>, 1256\u20131261 (2021).<\/p>\n

    Article<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Deng, Y.-H. et al. Solving graph problems using Gaussian boson sampling. Phys. Rev. Lett. 130<\/b>, 190601 (2023).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Shang, Z.-X. et al. Boson sampling enhanced quantum chemistry. PRX Quantum 6<\/b>, 040357 (2025).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Cimini, V. et al. Large-scale quantum reservoir computing using a Gaussian Boson Sampler. Preprint at https:\/\/arxiv.org\/abs\/2505.13695<\/a> (2025).<\/p>\n<\/li>\n

  • \n

    Gong, S.-Q. et al. Enhanced image recognition using Gaussian Boson Sampling. Preprint at https:\/\/arxiv.org\/abs\/2506.19707<\/a> (2025).<\/p>\n<\/li>\n

  • \n

    TOP500. November 2024. https:\/\/www.top500.org\/lists\/top500\/2024\/11\/<\/a> (2024).<\/p>\n<\/li>\n

  • \n

    Chen, Y. et al. FastMPS: revisit data parallel in large-scale Matrix Product State sampling. Preprint at https:\/\/arxiv.org\/abs\/2512.20064<\/a> (2025).<\/p>\n<\/li>\n

  • \n

    Nikolopoulos, G. M. Cryptographic one-way function based on boson sampling. Quantum Inf. Process. 18<\/b>, 259 (2019).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Gottesman, D., Kitaev, A. & Preskill, J. Encoding a qubit in an oscillator. Phys. Rev. A 64<\/b>, 012310 (2001).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Noh, K. & Chamberland, C. Fault-tolerant bosonic quantum error correction with the surface\u2013Gottesman-Kitaev-Preskill code. Phys. Rev. A 101<\/b>, 012316 (2020).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Roh, C., Gwak, G., Yoon, Y.-D. & Ra, Y.-S. Generation of three-dimensional cluster entangled state. Nat. Photon. 19<\/b>, 526\u2013532 (2026).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Aghaee Rad, H. et al. Scaling and networking a modular photonic quantum computer. Nature 638<\/b>, 912\u2013919 (2025).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n     PubMed Central<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Vasconcelos, H. M., Sanz, L. & Glancy, S. All-optical generation of states for \u201cencoding a qubit in an oscillator\u201d. Opt. Lett. 35<\/b>, 3261\u20133263 (2010).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Menicucci, N. C. Fault-tolerant measurement-based quantum computing with continuous-variable cluster states. Phys. Rev. Lett. 112<\/b>, 120504 (2014).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n

  • \n

    Konno, S. et al. Logical states for fault-tolerant quantum computation with propagating light. Science 383<\/b>, 289\u2013293 (2024).<\/p>\n

    Article<\/a>\u00a0
    \n     ADS<\/a>\u00a0
    \n     CAS<\/a>\u00a0
    \n     PubMed<\/a>\u00a0
    \n
    \n Google Scholar<\/a>\u00a0\n <\/p>\n<\/li>\n","protected":false},"excerpt":{"rendered":"Aaronson, S. & Arkhipov, A. The computational complexity of linear optics. Theory Comput. 9, 143\u2013252 (2013). Article\u00a0 Google…\n","protected":false},"author":2,"featured_media":482962,"comment_status":"","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[271],"tags":[18,1099,19,17,1100,452,1097,2571,12161,133],"class_list":{"0":"post-482961","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-physics","8":"tag-eire","9":"tag-humanities-and-social-sciences","10":"tag-ie","11":"tag-ireland","12":"tag-multidisciplinary","13":"tag-physics","14":"tag-quantum-information","15":"tag-quantum-optics","16":"tag-quantum-simulation","17":"tag-science"},"share_on_mastodon":{"url":"https:\/\/pubeurope.com\/@ie\/116568569217806339","error":""},"_links":{"self":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/posts\/482961","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/comments?post=482961"}],"version-history":[{"count":0,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/posts\/482961\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/media\/482962"}],"wp:attachment":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/media?parent=482961"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/categories?post=482961"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/tags?post=482961"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}