Ágoston Kaposi (ELTE), Zoltán Kolarovszki (ELTE), Tamás Kozsik (ELTE), Zoltán Zimborás (Wigner FK) and Péter Rakyta (ELTE)

(2022.05.01 - 2022.12.31)

Grant: NKFIH 2020-2.1.1-ED-2021-00179

Abstract: Evaluating the Torontonian function is a central computational challenge in the simulation of Gaussian Boson Sampling (GBS) with threshold detection. In this work, we propose a recursive algorithm providing a polynomial speedup in the exact calculation of the Torontonian compared to state-of-the-art algorithms. According to our numerical analysis the complexity of the algorithm is proportional to N1.06912N/2 with N being the size of the problem. We also show that the recursive algorithm can be scaled up to HPC use cases making feasible the simulation of threshold GBS up to 35−40 photon clicks without the needs of large-scale computational capacities.

Publications: Ágoston Kaposi, Zoltán Kolarovszki, Tamás Kozsik, Zoltán Zimborás, Péter Rakyta: Polynomial speedup in Torontonian calculation by a scalable recursive algorithm ArXiv:2109.04528