Strong simulation of linear optical processes

DOI10.1016/J.CPC.2023.108848MaRDI QIDQ6167678zbMATH OpenFDO

Authors Nicolas Heurtel, Shane Mansfield, Jean Senellart, Benoît Valiron

Publication date 7 August 2023

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2206.10549

zbMATH Keywords

linear opticsquantum computingstrong simulation

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Abstract: In this paper, we provide an algorithm and general framework for the simulation of photons passing through linear optical interferometers. Given $n$ photons at the input of an $m$-mode interferometer, our algorithm computes the probabilities of all possible output states with time complexity $$, linear in the number of output states $$. It outperforms the na"ive method by an exponential factor, and for the restricted problem of computing the probability for one given output it matches the current state-of-the-art. Our algorithm also has additional versatility by virtue of its use of memorisation -- the storing of intermediate results -- which is advantageous in situations where several input states may be of interest. Additionally it allows for hybrid simulations, in which outputs are sampled from output states whose probability exceeds a given threshold, or from a restricted set of states. We consider a concrete, optimised implementation, and we benchmark the efficiency of our approach compared to existing tools.

Cites work

• A linear-optical proof that the permanent is \(\#\mathrm{P}\)-hard
• scientific article; zbMATH DE number 5835674 (Why is no real title available?)
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• scientific article; zbMATH DE number 7250159 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Practical methods of optimization.
• Quantum communication complexity
• Statistical benchmark for bosonsampling
• The classical complexity of boson sampling
• The complexity of computing the permanent
• The computational complexity of linear optics
• The permanent of a square matrix

Cited in

(2)

• Riemannian optimization of photonic quantum circuits in phase and Fock space
• Fast and memory-efficient strong simulation of noisy adaptive linear optical circuits

This page was built for publication: Strong simulation of linear optical processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167678)