Laplace expansions and tree decompositions: A faster polytime algorithm for shallow nearest-neighbour Boson Sampling

In a Boson Sampling quantum optical experiment we send $n$ individual photons into an $m$-mode interferometer and we measure the occupation pattern on the output. The statistics of this process depending on the permanent of a matrix representing the experiment, a \#P-hard problem to compute, is the reason behind ideal and fully general Boson Sampling being hard to simulate on a classical computer. We exploit the fact that for a nearest-neighbour shallow circuit, i.e. depth $D = \mathcal{O}(\log m)$, one can adapt the algorithm by Clifford & Clifford (2018) to exploit the sparsity of the shallow interferometer using an algorithm by Cifuentes & Parrilo (2016) that can efficiently compute a permanent of a structured matrix from a tree decomposition. Our algorithm generates a sample from a shallow circuit in time $\mathcal{O}(n^2 2^\omega \omega^2) + \mathcal{O}(\omega n^3)$, where $\omega$ is the treewidth of the decomposition which satisfies $\omega \le 2D$ for nearest-neighbour shallow circuits. The key difference in our work with respect to previous work using similar methods is the reuse of the structure of the tree decomposition, allowing us to adapt the Laplace expansion used by Clifford & Clifford which removes a significant factor of $m$ from the running time, especially as $m>n^2$ is a requirement of the original Boson Sampling proposal.