2018/01/23 by Regina Kruse, Craig S. Hamilton, Linda Sansoni +3 · 2 citations
Computer Science · Physics and Astronomy · #Algorithm #Boson #Computer science #Data mining #Gaussian #Measure (data warehouse) #Photon #Photonics #Physics #Protocol (science) #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Quantum optics and atomic interactions #Sampling (signal processing) #Statistical physics #Telecommunications #quant-ph
paper · pdf · doi:10.1103/physreva.100.032326
published as Phys. Rev. A 100, 032326 (2019)
arxiv created 2018/01/23 · openalex publication_date 2019/09/18 · arxiv updated 2019/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Since the development of boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonic states. In this paper, we interpret and extend the results presented previously [Phys. Rev. Lett. 119, 170501 (2017)]. We derive an expression that relates the probability to measure a specific photon output pattern from a Gaussian state to the Hafnian matrix function and use it to design a Gaussian boson sampling protocol. Then, we discuss the advantages that this protocol has relative to other photonic protocols and the experimental requirements for Gaussian boson sampling. Finally, we relate it to the previously most general protocol, scattershot boson sampling [Phys. Rev. Lett. 113, 100502 (2014)].