2021
DOI: 10.48550/arxiv.2109.04528
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Polynomial speedup in Torontonian calculation by a scalable recursive algorithm

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 stateof-the-art algorithms. According to our numerical analysis the complexity of the algorithm is proportional to N 1.0691 2 N/2 with N being the size of the problem. We also show that the recursive algorithm can be scaled up to H… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…We do not conjecture that these complexities are optimal. The structure of this matrix function may be exploited to reduce the complexity, for example by using methods similar to those for low rank permanents [22], exploiting recursion [24] and using Laplace expansions [25]. However, we leave it as an open problem to find faster algorithms for the Bristolian.…”
Section: Time Complexitiesmentioning
confidence: 99%
See 1 more Smart Citation
“…We do not conjecture that these complexities are optimal. The structure of this matrix function may be exploited to reduce the complexity, for example by using methods similar to those for low rank permanents [22], exploiting recursion [24] and using Laplace expansions [25]. However, we leave it as an open problem to find faster algorithms for the Bristolian.…”
Section: Time Complexitiesmentioning
confidence: 99%
“…However, both of these steps can make use of the Cholesky decomposition of O, so we anticipate that the polynomial prefactor can be improved, following the methods described in Ref. [24].…”
Section: Time Complexitiesmentioning
confidence: 99%