Fast and memory-efficient strong simulation of noisy adaptive linear optical circuits

DOI10.1016/J.CPC.2025.110016MaRDI QIDQ7242071zbMATH OpenFDO

Authors Timothée Goubault de Brugière, Nicolas Heurtel

Publication date 13 May 2026

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

Full work available at URL https://doi.org/10.1016/J.CPC.2025.110016

zbMATH Keywords

exact computationfeedforwardlinear opticsnoisesingle photonsSteiner treesstrong simulation

Mathematics Subject Classification ID

Computer science (68-XX) Optics, electromagnetic theory (78-XX)

Cites work

• Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons
• 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 3249395 (Why is no real title available?)
• Implications, conflicts, and reductions for Steiner trees
• On the classical complexity of sampling from quantum interference of indistinguishable bosons
• Permanents
• Quantum cryptography: public key distribution and coin tossing
• Quantum internet: A vision for the road ahead
• Riemannian optimization of photonic quantum circuits in phase and Fock space
• Steiner tree problems
• Strong simulation of linear optical processes
• The Complexity of Computing Steiner Minimal Trees
• The computational complexity of linear optics
• The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
• The permanent of a square matrix

This page was built for publication: Fast and memory-efficient strong simulation of noisy adaptive linear optical circuits

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