Strong simulation of linear optical processes
From MaRDI portal
Publication:6167678
DOI10.1016/j.cpc.2023.108848arXiv2206.10549MaRDI QIDQ6167678
Nicolas Heurtel, Jean Senellart, Benoît Valiron, Shane Mansfield
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Classical Complexity of Boson Sampling
- The complexity of computing the permanent
- The permanent of a square matrix
- Quantum communication complexity
- A linear-optical proof that the permanent is # P -hard
- The computational complexity of linear optics
- Statistical benchmark for BosonSampling
This page was built for publication: Strong simulation of linear optical processes